{"$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":"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"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"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"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"]}],"properties":{"cwe":["CWE-506"]}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"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":"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":"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":"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":"c3.esm.ChartInternal.updateLegend (cyclomatic 68): c3.esm.ChartInternal.updateLegend has cyclomatic complexity 68 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 10 belong to 7 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":10324}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90f0941369df013f81d774081b2f0324c5409040eb8e128e8e62eb642cfa440"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.updateLegend (cyclomatic 68): c3.ChartInternal.updateLegend has cyclomatic complexity 68 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 10 belong to 7 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":8336}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e1698f3767fcd653a366801c166b6bcf72e99e16c4034db858c53b5f4be1c6"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.updateLegend (cyclomatic 68): c3.esm.ChartInternal.updateLegend has cyclomatic complexity 68 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 10 belong to 7 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.esm.js"},"region":{"startLine":10324}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ece09d9682e2097da6547f14dbe765030ab4ea27a9d4f73c0ac92d3854aec1"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.updateLegend (cyclomatic 68): c3.ChartInternal.updateLegend has cyclomatic complexity 68 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 10 belong to 7 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.js"},"region":{"startLine":8336}}}],"partialFingerprints":{"codehealthFindingId/v1":"31dc763ae3782ff246d20a839dd24bd6caa690be59f4c3fe984cbe297359930d"}},{"ruleId":"D1","level":"warning","message":{"text":"legend.ChartInternal.updateLegend (cyclomatic 68): legend.ChartInternal.updateLegend has cyclomatic complexity 68 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 10 belong to 7 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/legend.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"30953686c649a29f01af775670057a130f13481b1a6951e69b2a0ea5d5deff09"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.redraw (cyclomatic 49): c3.esm.ChartInternal.redraw has cyclomatic complexity 49 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 4 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":"c3.esm.js"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05e2cf67ef7ee202778786bd177fe2b1be4401a57a975c9328af5168d05c442"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.redraw (cyclomatic 49): c3.ChartInternal.redraw has cyclomatic complexity 49 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 4 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":"c3.js"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbcee912bee809e6369124e528ca702b03c4057335bff52b2b34066457f9313"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.redraw (cyclomatic 49): c3.esm.ChartInternal.redraw has cyclomatic complexity 49 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 4 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":"docs/js/c3.esm.js"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a273a737c611e0b1d506eae1bf556ca4c29ca149b2e4fd37203b162d35d101"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.redraw (cyclomatic 49): c3.ChartInternal.redraw has cyclomatic complexity 49 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 4 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":"docs/js/c3.js"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed496c0ef23ec2f1a220cf0fd372e21f8969f68a177b1537ee43243fb063689d"}},{"ruleId":"D1","level":"warning","message":{"text":"core.ChartInternal.redraw (cyclomatic 49): core.ChartInternal.redraw has cyclomatic complexity 49 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b17aa2d70e10adf910883ee4ae636398b1096a1a52ec10a05bbf0dd9961271"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.getYDomain (cyclomatic 45): c3.esm.ChartInternal.getYDomain has cyclomatic complexity 45 (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":"c3.esm.js"},"region":{"startLine":9011}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d072aa812d2aa868ed4374f84413cb438862ee5d3eaff5928b4727b84fd1ab"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.getYDomain (cyclomatic 45): c3.ChartInternal.getYDomain has cyclomatic complexity 45 (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":"c3.js"},"region":{"startLine":7270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff445a64f3d9b02cfb021167de781ccd79f9ad223341e80eae8de7af1b30ea2"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.getYDomain (cyclomatic 45): c3.esm.ChartInternal.getYDomain has cyclomatic complexity 45 (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/js/c3.esm.js"},"region":{"startLine":9011}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c0abcf5268582a877d27a6a670199027cddc10e58995555003102ce21e6246"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.getYDomain (cyclomatic 45): c3.ChartInternal.getYDomain has cyclomatic complexity 45 (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/js/c3.js"},"region":{"startLine":7270}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2a1c283338453b603a87fb76fde9fbddb1120a347f75bdf75dd95a0c496626"}},{"ruleId":"D1","level":"warning","message":{"text":"domain.ChartInternal.getYDomain (cyclomatic 45): domain.ChartInternal.getYDomain has cyclomatic complexity 45 (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/domain.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ea5fc21b1a28d030742f29e2e2af8be2ac1dfd0ae9d00cf53e6e7692ee160c"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::redraw (cyclomatic 45): (anonymous)::redraw has cyclomatic complexity 45 (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":"c3.js"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"c940f17697c238aa6116be28f79271479584fa232a96c1e9a3a9f31605ebc38a"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::getYDomain (cyclomatic 45): (anonymous)::getYDomain has cyclomatic complexity 45 (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":"c3.js"},"region":{"startLine":7270}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd520412f2dd7a1c47d69537b8ff7badb1fa8fda2072e43f748a7892b56837bc"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.redrawArc (cyclomatic 44): c3.esm.ChartInternal.redrawArc has cyclomatic complexity 44 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 26 belong to 16 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":"c3.esm.js"},"region":{"startLine":6727}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2bf317c66a71d4772a16fd757fc0b34a0ca5b103b79a18a265893ef421c7df"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.redrawArc (cyclomatic 44): c3.ChartInternal.redrawArc has cyclomatic complexity 44 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 26 belong to 16 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":"c3.js"},"region":{"startLine":5294}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22061f46abe9ada0e97ebbcbfb81f6a0f37120a0f7f0b44822d0ea7ea2b1c29"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.redrawArc (cyclomatic 44): c3.esm.ChartInternal.redrawArc has cyclomatic complexity 44 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 26 belong to 16 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":"docs/js/c3.esm.js"},"region":{"startLine":6727}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfa6d8603225796ebac79e9401380121173b2ea2376c0d2b177262550f039f2"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.redrawArc (cyclomatic 44): c3.ChartInternal.redrawArc has cyclomatic complexity 44 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 26 belong to 16 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":"docs/js/c3.js"},"region":{"startLine":5294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2694140d74c3da107948f59c49b751a575e929f083ce806b9f3ac800d977200a"}},{"ruleId":"D1","level":"warning","message":{"text":"arc.ChartInternal.redrawArc (cyclomatic 44): arc.ChartInternal.redrawArc has cyclomatic complexity 44 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 26 belong to 16 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/arc.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe9893eb8b6daff6cfd2bb2cb849636056df26d654f97c74e45a8a5e318f660"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.redrawEventRect (cyclomatic 40): c3.esm.ChartInternal.redrawEventRect has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 9 of the 40 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 9956, 10058, 9938, \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":"c3.esm.js"},"region":{"startLine":9898}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77501911a3ee03ece5a06bd789ef95ae39dc022044d7dc88a880c90428365ef"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.redrawEventRect (cyclomatic 40): c3.ChartInternal.redrawEventRect has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 9 of the 40 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 8042, 8121, 8027, \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":"c3.js"},"region":{"startLine":7998}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d812e260df78ec52e73bd10147179aa2b4fbad03d4d8cbf9a93751ced200c22"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.redrawEventRect (cyclomatic 40): c3.esm.ChartInternal.redrawEventRect has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 9 of the 40 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 9956, 10058, 9938, \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":"docs/js/c3.esm.js"},"region":{"startLine":9898}}}],"partialFingerprints":{"codehealthFindingId/v1":"642d63acf00cbb5d05bca9b6c2480d470eaf79d310041e154667c1ba74790484"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.redrawEventRect (cyclomatic 40): c3.ChartInternal.redrawEventRect has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 9 of the 40 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 8042, 8121, 8027, \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":"docs/js/c3.js"},"region":{"startLine":7998}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4aa14890fd7916833616a10a016c6b6557c6be1312d32c6b159ed29f958a978"}},{"ruleId":"D1","level":"warning","message":{"text":"interaction.ChartInternal.redrawEventRect (cyclomatic 40): interaction.ChartInternal.redrawEventRect has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 9 of the 40 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 88, 190, 70, \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/interaction.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"707fd834fe615d0bbc65939c2664d820ebef969f71089782e4ffb369f1075bcc"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::(anonymous)::_parsePath::_parseNumber (cyclomatic 38): (anonymous)::(anonymous)::_parsePath::_parseNumber has cyclomatic complexity 38 (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":"c3.js"},"region":{"startLine":3640}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd90d199f7b0b4bdad40dffac203b39395728fb9ae38f6c51c7f1a641926413"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::_parsePath::_parseNumber (cyclomatic 38): (anonymous)::_parsePath::_parseNumber has cyclomatic complexity 38 (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":"c3.esm.js"},"region":{"startLine":4656}}}],"partialFingerprints":{"codehealthFindingId/v1":"73034d19984dc47a8653f831903ae6d880704bcef8f552d3945e0979f20b866b"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::updateLegend (cyclomatic 34): (anonymous)::updateLegend has cyclomatic complexity 34 (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":"c3.js"},"region":{"startLine":8336}}}],"partialFingerprints":{"codehealthFindingId/v1":"6655c075da5a98cde1fcdca22b66f6059f805ba88e47f29c670db65b06c426cf"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.convertDataToTargets (cyclomatic 31): c3.esm.ChartInternal.convertDataToTargets has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 11 of the 31 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 7913, 7963, 8002, \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":"c3.esm.js"},"region":{"startLine":7880}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e36d82149427e13e0ec8af3b969433b7759b397fa6ee0187de7b5ad0f9901df"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.updateSizes (cyclomatic 31): c3.ChartInternal.updateSizes has cyclomatic complexity 31 (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":"c3.js"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee18c5a1fb4f0b22f0881a290cfb08ec02d6ac0b11595d9d491940775bd835c"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.convertDataToTargets (cyclomatic 31): c3.ChartInternal.convertDataToTargets has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 11 of the 31 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 6339, 6384, 6416, \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":"c3.js"},"region":{"startLine":6317}}}],"partialFingerprints":{"codehealthFindingId/v1":"131ad3cb58d56db581582c76dc31527b7abacc331cbe8dd789638bdd01d4f457"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.convertDataToTargets (cyclomatic 31): c3.esm.ChartInternal.convertDataToTargets has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 11 of the 31 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 7913, 7963, 8002, \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":"docs/js/c3.esm.js"},"region":{"startLine":7880}}}],"partialFingerprints":{"codehealthFindingId/v1":"972e65bbaa77f6a0fe4f086cdf311ea7deb2b4cf850ddc7c766dd7e441fe5b9e"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.updateSizes (cyclomatic 31): c3.ChartInternal.updateSizes has cyclomatic complexity 31 (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/js/c3.js"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d6a761a070033c34d5783127ea68978a76a63cd7599ade17d76db552091aa8"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.convertDataToTargets (cyclomatic 31): c3.ChartInternal.convertDataToTargets has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 11 of the 31 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 6339, 6384, 6416, \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":"docs/js/c3.js"},"region":{"startLine":6317}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e5d3759feca23a0cc756bb2091ffa4008082a8b81fa0731a214873049948f7"}},{"ruleId":"D1","level":"warning","message":{"text":"core.ChartInternal.updateSizes (cyclomatic 31): core.ChartInternal.updateSizes has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"f011c7c3cdb6f06cf93b9f1b13e2e2b0c7042f833cc51ba01a2f9ba12c2b3649"}},{"ruleId":"D1","level":"warning","message":{"text":"data.convert.ChartInternal.convertDataToTargets (cyclomatic 31): data.convert.ChartInternal.convertDataToTargets has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 11 of the 31 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 205, 255, 294, \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/data.convert.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae9784bccf6625194f5d7fa2c6a9e0e299cc6fe5abf26ede63d127ff4d4b869"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::updateSizes (cyclomatic 31): (anonymous)::updateSizes has cyclomatic complexity 31 (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":"c3.js"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"161508033f1d39e8b51ef82f092493407d2c84a5cb79ad9594dc863915db5349"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.updateSizes (cyclomatic 29): c3.esm.ChartInternal.updateSizes has cyclomatic complexity 29 (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":"c3.esm.js"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"9103fa153a12886aec5f2d9b4cd49b21893c8974fecde29386669e81697400fc"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.updateSizes (cyclomatic 29): c3.esm.ChartInternal.updateSizes has cyclomatic complexity 29 (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/js/c3.esm.js"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb3bf1da445b8467bb0275761988dde0d65d50594cd5a1935fd666a1d8d5acd"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.Chart.flow (cyclomatic 28): c3.esm.Chart.flow has cyclomatic complexity 28 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 14 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":5326}}}],"partialFingerprints":{"codehealthFindingId/v1":"690549367097b514a8285c24d3e6cf3cbb6e2a962e14ecb18e17dfd139ec8647"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.Chart.flow (cyclomatic 28): c3.Chart.flow has cyclomatic complexity 28 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 14 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":4151}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b67e5016ab29c4e122f6c81408205834b6fae380f3568026c67389cff59517"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.Chart.flow (cyclomatic 28): c3.esm.Chart.flow has cyclomatic complexity 28 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 14 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.esm.js"},"region":{"startLine":5326}}}],"partialFingerprints":{"codehealthFindingId/v1":"534f8b3c18d43f3c471926df86128fb136e0181214506cb3add0a78e39590284"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.Chart.flow (cyclomatic 28): c3.Chart.flow has cyclomatic complexity 28 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 14 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.js"},"region":{"startLine":4151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0762d08927e88dd16d0d8ba379e8109e49aa4f51942d8140b8d90c2afc3c5882"}},{"ruleId":"D1","level":"warning","message":{"text":"api.flow.Chart.flow (cyclomatic 28): api.flow.Chart.flow has cyclomatic complexity 28 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 14 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/api.flow.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a85e9a9bc72d5ed6c2dadba0926962a8e8665c081cf32963be1e09576f7534"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.initWithData (cyclomatic 25): c3.esm.ChartInternal.initWithData has cyclomatic complexity 25 (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":"c3.esm.js"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"4779a745c3f5b17086625b00233f5059944e98dcd7487c6aa07418d554216ee4"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.generateFlow (cyclomatic 25): c3.esm.ChartInternal.generateFlow has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 5491, 5605). 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":"c3.esm.js"},"region":{"startLine":5486}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd131e632df61f12ff788442573993ba37927f960321d70ae5a76bcd41c296c"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.updateStanfordElements (cyclomatic 25): c3.esm.ChartInternal.updateStanfordElements has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 21 function literals inside it that branch (lines 13351, 13374, 13399, \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":"c3.esm.js"},"region":{"startLine":13222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99dc24f735d4d724ed28d2490dad269d700d8c23b28b19a36b216e259078cfb"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.initWithData (cyclomatic 25): c3.ChartInternal.initWithData has cyclomatic complexity 25 (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":"c3.js"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec41324ee74af388f8b047763108d7f247580677a39aa7bda11435a3aa596cd"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.generateFlow (cyclomatic 25): c3.ChartInternal.generateFlow has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 4292, 4364). 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":"c3.js"},"region":{"startLine":4290}}}],"partialFingerprints":{"codehealthFindingId/v1":"efaf1a73a63072b4ece21803f98be6ef9064772dc51946ad7800411f34972a29"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.updateStanfordElements (cyclomatic 25): c3.ChartInternal.updateStanfordElements has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 21 function literals inside it that branch (lines 10752, 10774, 10799, \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":"c3.js"},"region":{"startLine":10644}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0c68c09b6e852c5512623ae009031efea56ae303113df70afb266448203cf5"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.initWithData (cyclomatic 25): c3.esm.ChartInternal.initWithData has cyclomatic complexity 25 (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/js/c3.esm.js"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c775b4b671c5db6f50cf181527ebe9c043bf4a45c5ca0095c7606b37f17d581"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.generateFlow (cyclomatic 25): c3.esm.ChartInternal.generateFlow has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 5491, 5605). 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":"docs/js/c3.esm.js"},"region":{"startLine":5486}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d12ab3994f0d1aca63eedd1854073ba38c6796de153838894567e97ab398db"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.updateStanfordElements (cyclomatic 25): c3.esm.ChartInternal.updateStanfordElements has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 21 function literals inside it that branch (lines 13351, 13374, 13399, \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":"docs/js/c3.esm.js"},"region":{"startLine":13222}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ecb3843645abe0e73d8115d994611d1fbcc52b7eec17f6ad2db05d53070c66"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.initWithData (cyclomatic 25): c3.ChartInternal.initWithData has cyclomatic complexity 25 (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/js/c3.js"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b331533457ec1ef8c5cd27cb877cd61b957b264e98768b54dad47a9fa76cf7"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.generateFlow (cyclomatic 25): c3.ChartInternal.generateFlow has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 4292, 4364). 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":"docs/js/c3.js"},"region":{"startLine":4290}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd876849fc2df965b903be816c4cdde2524965aa4475b785943f78b9b5b655d"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.updateStanfordElements (cyclomatic 25): c3.ChartInternal.updateStanfordElements has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 21 function literals inside it that branch (lines 10752, 10774, 10799, \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":"docs/js/c3.js"},"region":{"startLine":10644}}}],"partialFingerprints":{"codehealthFindingId/v1":"a563af4f31030a1cc807f2d22798aac80e302656f2de33059ab19f615256fecf"}},{"ruleId":"D1","level":"warning","message":{"text":"core.ChartInternal.initWithData (cyclomatic 25): core.ChartInternal.initWithData has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e11737be8182d7847c724ed5059339eed42cdd1828b51083246a17e8084c27"}},{"ruleId":"D1","level":"warning","message":{"text":"api.flow.ChartInternal.generateFlow (cyclomatic 25): api.flow.ChartInternal.generateFlow has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 170, 284). 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/api.flow.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e301615c175032d8e735c92d5b2b3cf837f6690b3ada463b2ff560e3e8a0968"}},{"ruleId":"D1","level":"warning","message":{"text":"stanfordelements.ChartInternal.updateStanfordElements (cyclomatic 25): stanfordelements.ChartInternal.updateStanfordElements has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 21 function literals inside it that branch (lines 147, 170, 195, \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/stanfordelements.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6f2f06721a726ad83b8e015e2ef5c63bf9a691b8dd70b8a16193b06728b5a0"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::initWithData (cyclomatic 25): (anonymous)::initWithData has cyclomatic complexity 25 (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":"c3.js"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0eb24e5d35d5943d344691e1c6b8a473c40b034f1a3145bab395927e634bfe"}},{"ruleId":"D1","level":"warning","message":{"text":"generateAxis (cyclomatic 25): generateAxis has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 29 function items inside it that branch (axis::(anonymous), orient, tickInterval, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"a532662c14f84d959f4545fd2fa34f27555a68065d98b9556f34d999e837f1db"}},{"ruleId":"D1","level":"warning","message":{"text":"initParams (cyclomatic 25): initParams has cyclomatic complexity 25 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af2cfab194230429771c5360daa190fd60f3f7b7be6fc9bad78f6163d47b628"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.updateGrid (cyclomatic 23): c3.esm.ChartInternal.updateGrid has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: c3.esm.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":9620}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f5a25dbb50eb44d33ac6ca1917bb5e86e6dc494d4617c8ef0db75fc2896d49"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.updateGrid (cyclomatic 23): c3.ChartInternal.updateGrid has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: c3.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":7762}}}],"partialFingerprints":{"codehealthFindingId/v1":"726250f3295c48168bf6b9aa700f0b59bf7820ab07f875e942ef1a0b8f08b775"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.updateGrid (cyclomatic 23): c3.esm.ChartInternal.updateGrid has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: c3.esm.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.esm.js"},"region":{"startLine":9620}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e09b2129e36c27908d0ffbb1acd18d759c083a49b775676971f63ff18fe933"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.updateGrid (cyclomatic 23): c3.ChartInternal.updateGrid has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: c3.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.js"},"region":{"startLine":7762}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5c77f312b50385e15f72ea1b78603ea73edf9bd8350900c8c7934824859830"}},{"ruleId":"D1","level":"warning","message":{"text":"grid.ChartInternal.updateGrid (cyclomatic 23): grid.ChartInternal.updateGrid has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grid.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef4ad75694453f4a72501010c2afd86bf76f3e49c1ef786438da61b24099d67"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.getHorizontalAxisHeight (cyclomatic 22): c3.ChartInternal.getHorizontalAxisHeight has cyclomatic complexity 22 (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 is NOT this file\u0027s highest cyclomatic complexity: c3.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":9899}}}],"partialFingerprints":{"codehealthFindingId/v1":"51763bcccdb4bcb130a304b41e8fd91734ff3bbc1c3fa721ab3e495cfb94ad0b"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.getHorizontalAxisHeight (cyclomatic 22): c3.ChartInternal.getHorizontalAxisHeight has cyclomatic complexity 22 (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 is NOT this file\u0027s highest cyclomatic complexity: c3.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.js"},"region":{"startLine":9899}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b5658fb595b5de6b8281c6de1d2d91def2c8dfa3aec05d6ea0883c1c1a31fe"}},{"ruleId":"D1","level":"warning","message":{"text":"c3ext.c3ext.ZoomBehavior (cyclomatic 22): c3ext.c3ext.ZoomBehavior has cyclomatic complexity 22 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 9 belong to 4 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/js/c3ext.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45c02013766aeaf31dda0c79247908fad40c0a863d20c7fd873772f591c07fd"}},{"ruleId":"D1","level":"warning","message":{"text":"size.ChartInternal.getHorizontalAxisHeight (cyclomatic 22): size.ChartInternal.getHorizontalAxisHeight has cyclomatic complexity 22 (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/size.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ba0c8db0cce27dceaf914af4f828d05b8942606ebfd1667ef0544052f98050"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::getHorizontalAxisHeight (cyclomatic 22): (anonymous)::getHorizontalAxisHeight has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::(anonymous)::_parsePath::parseSegment (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":9899}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c03b988ba355400b14ce0bfd7699befffcc1b472648834345c629ca05111274"}},{"ruleId":"D1","level":"warning","message":{"text":"ZoomBehavior (cyclomatic 22): ZoomBehavior has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 4 of the 22 points are its own statements and the rest belongs to 18 function items inside it that branch (setOptions, verifyZoom, left, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"htdocs/js/extensions/c3ext.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f0117ccddd7e66c193e55af68af544e27409f52c1f8f47370d84fe2fbd3274"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::updateGrid (cyclomatic 21): (anonymous)::updateGrid has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::(anonymous)::_parsePath::parseSegment (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":7762}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb1bcd95776522cc6032d55310af7440916495cb939d34681900af9f05cc9ba"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.lineWithRegions (cyclomatic 20): c3.esm.ChartInternal.lineWithRegions has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: c3.esm.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":11712}}}],"partialFingerprints":{"codehealthFindingId/v1":"570bf47723ae7b3f8408b5d03c2e951f907fc9660c510b8952b8e0983543a5cc"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.getHorizontalAxisHeight (cyclomatic 20): c3.esm.ChartInternal.getHorizontalAxisHeight 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. This is NOT this file\u0027s highest cyclomatic complexity: c3.esm.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":12253}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e132838a453df194247ce3ce131561f7abefc65a6ec7bcdad9d8c8319e4cde"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.getTooltipContent (cyclomatic 20): c3.esm.ChartInternal.getTooltipContent 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. This is NOT this file\u0027s highest cyclomatic complexity: c3.esm.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":13540}}}],"partialFingerprints":{"codehealthFindingId/v1":"618f0ba0ea547386bd01a73b7561800798ae96c49fa194b578599da4df74d179"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.lineWithRegions (cyclomatic 20): c3.ChartInternal.lineWithRegions has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: c3.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":9466}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3e6d4fb7158a558966b37a06b23fab2ae0cb37a30230cf02833ddc67191c12"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.getTooltipContent (cyclomatic 20): c3.ChartInternal.getTooltipContent 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. This is NOT this file\u0027s highest cyclomatic complexity: c3.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":10918}}}],"partialFingerprints":{"codehealthFindingId/v1":"77eafdf6c1b1b5141e12bdde3fd88e3539fd0c6657b7a6af085411e033370dd7"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.lineWithRegions (cyclomatic 20): c3.esm.ChartInternal.lineWithRegions has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: c3.esm.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.esm.js"},"region":{"startLine":11712}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6e01770cf0033060501d8a96f4370807eae1d6e46858384ad0aebfe936a1c2"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.getHorizontalAxisHeight (cyclomatic 20): c3.esm.ChartInternal.getHorizontalAxisHeight 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. This is NOT this file\u0027s highest cyclomatic complexity: c3.esm.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.esm.js"},"region":{"startLine":12253}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1bd73c19b7b233074447d82b5962c88766e9bd9fca9e1443c24b07cfd68a25"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.getTooltipContent (cyclomatic 20): c3.esm.ChartInternal.getTooltipContent 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. This is NOT this file\u0027s highest cyclomatic complexity: c3.esm.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.esm.js"},"region":{"startLine":13540}}}],"partialFingerprints":{"codehealthFindingId/v1":"f148ba23ba056ec02b73e655641b1b88a123e53dc2ce1acb37323b1a3b2b32fa"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.lineWithRegions (cyclomatic 20): c3.ChartInternal.lineWithRegions has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: c3.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.js"},"region":{"startLine":9466}}}],"partialFingerprints":{"codehealthFindingId/v1":"00064f8a5c655ac6e0b90f330011a5e04fbf03c092ad6baf8c20dd9942486dd2"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.getTooltipContent (cyclomatic 20): c3.ChartInternal.getTooltipContent 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. This is NOT this file\u0027s highest cyclomatic complexity: c3.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.js"},"region":{"startLine":10918}}}],"partialFingerprints":{"codehealthFindingId/v1":"854b8bd5a907cba9b8e5e8b8abcfb2a01b71f22b3d1dbad4932c406a83f1904f"}},{"ruleId":"D1","level":"warning","message":{"text":"shape.line.ChartInternal.lineWithRegions (cyclomatic 20): shape.line.ChartInternal.lineWithRegions has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shape.line.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55f11fd0eba661cc7218caac1519dec9b79ae61ad8457f096aa7c56204165ef"}},{"ruleId":"D1","level":"warning","message":{"text":"tooltip.ChartInternal.getTooltipContent (cyclomatic 20): tooltip.ChartInternal.getTooltipContent 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/tooltip.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9c8af99d2f17077bae2a0b3467db6fe289d20b76d802f4e845900a2852ba19"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::getTooltipContent (cyclomatic 20): (anonymous)::getTooltipContent 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. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::(anonymous)::_parsePath::parseSegment (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":10918}}}],"partialFingerprints":{"codehealthFindingId/v1":"b744814197af9ee5c0f7109899be8c7f7b88c5eba0409ee9da12abcc1a0d93e1"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::updateLegend::updatePositions (cyclomatic 19): (anonymous)::updateLegend::updatePositions 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. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::(anonymous)::_parsePath::parseSegment (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":8356}}}],"partialFingerprints":{"codehealthFindingId/v1":"c003abf23da78a6d4f1275365d7aae8f38ac92093280b928fb21aa5b3c321b09"}},{"ruleId":"D1","level":"warning","message":{"text":"updateLegend::updatePositions (cyclomatic 19): updateLegend::updatePositions 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. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::_parsePath::parseSegment (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":10381}}}],"partialFingerprints":{"codehealthFindingId/v1":"697eeac28aaf95708a0a41ce32231d0a165eec55d9f0d31e14e776d1e8070b02"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.transformForArcLabel (cyclomatic 17): c3.esm.ChartInternal.transformForArcLabel has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: c3.esm.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":6461}}}],"partialFingerprints":{"codehealthFindingId/v1":"2867310f8bd35d87291b14af66026a430985e366605f848d04ebcd3108ed81c0"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.transformForArcLabel (cyclomatic 17): c3.ChartInternal.transformForArcLabel has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: c3.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":5079}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef34ac9ea8175a97ebd3b47a6e3370f3d22248489d68fa6bb6c7ab9242a78ff5"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.transformForArcLabel (cyclomatic 17): c3.esm.ChartInternal.transformForArcLabel has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: c3.esm.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.esm.js"},"region":{"startLine":6461}}}],"partialFingerprints":{"codehealthFindingId/v1":"35bb822ee2fc1719f8676ea485b9b49754af3159282baaf09fa0504237dfde3d"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.transformForArcLabel (cyclomatic 17): c3.ChartInternal.transformForArcLabel has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: c3.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.js"},"region":{"startLine":5079}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a420873158e764369a29fcada53861e86c13ea2ca3970fe3da0846452624ef8"}},{"ruleId":"D1","level":"warning","message":{"text":"arc.ChartInternal.transformForArcLabel (cyclomatic 17): arc.ChartInternal.transformForArcLabel has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/arc.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d568a8be4245564c01699e8eaee2d8d795f4d364ce14799934c6c8ae5b34325"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::initParams (cyclomatic 17): (anonymous)::initParams has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::(anonymous)::_parsePath::parseSegment (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aede0d5165bbe934c4f2e515caab8625eb856aa2285e346b27262632e5fb25d"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::transformForArcLabel (cyclomatic 17): (anonymous)::transformForArcLabel 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. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::(anonymous)::_parsePath::parseSegment (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":5079}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2a1a1e9c92ad3a2a79f70592ddc5a7bdbad2c887b8b35094ae0fa59fcfdbd4"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::redrawArc (cyclomatic 17): (anonymous)::redrawArc 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. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::(anonymous)::_parsePath::parseSegment (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":5294}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df2d8e99570470e8591b97a0563e7878c67618ede7f8433bae546f9d80f2964"}},{"ruleId":"D1","level":"warning","message":{"text":"copy (cyclomatic 17): copy has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/js/c3ext.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1139b81f742e441b62c0e33f6695e67cf46047b2e521a7427b064b1a5f40a0"}},{"ruleId":"D1","level":"warning","message":{"text":"copy (cyclomatic 17): copy has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"htdocs/js/extensions/c3ext.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"1039c224ec3566e4c141c5014c6c96fcd725cb14d63e23589dd19d25279ae7bd"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.drag (cyclomatic 16): c3.esm.ChartInternal.drag has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 9344). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: c3.esm.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":9308}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaab3e443000ee39267cd930824515ab85804f96b731bd8b26df61a02b5d585f"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.getTooltipSortFunction (cyclomatic 16): c3.esm.ChartInternal.getTooltipSortFunction has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 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. This is NOT this file\u0027s highest cyclomatic complexity: c3.esm.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":13465}}}],"partialFingerprints":{"codehealthFindingId/v1":"617a2cf83a02dd448238f0cbad9f06396815e711763e123101c26d1914393577"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.drag (cyclomatic 16): c3.ChartInternal.drag has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 7518). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: c3.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":7488}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d43a37f1a225b2356957ad470241dde153b947499a1bce3a4d04893cb67e84"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.getTooltipSortFunction (cyclomatic 16): c3.ChartInternal.getTooltipSortFunction has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 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. This is NOT this file\u0027s highest cyclomatic complexity: c3.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":10852}}}],"partialFingerprints":{"codehealthFindingId/v1":"debc41919f17f5ad5304687aab7241b7c5bf1b580f43ff31d0e1a01bd0e650c6"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.drag (cyclomatic 16): c3.esm.ChartInternal.drag has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 9344). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: c3.esm.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.esm.js"},"region":{"startLine":9308}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc41c4b4a22be1e28ba767279f192350e5d7bd46e588b11174246ef16282b76"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.esm.ChartInternal.getTooltipSortFunction (cyclomatic 16): c3.esm.ChartInternal.getTooltipSortFunction has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 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. This is NOT this file\u0027s highest cyclomatic complexity: c3.esm.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.esm.js"},"region":{"startLine":13465}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e5d89cbdc04ef49ed60a68b89b5a649e0c38ae46a1b1de9e632e575c750612"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.drag (cyclomatic 16): c3.ChartInternal.drag has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 7518). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: c3.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.js"},"region":{"startLine":7488}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d35d74d7e103f92a84e462dfe536e4b15a744f38165c9d1b80929e1e028657"}},{"ruleId":"D1","level":"warning","message":{"text":"c3.ChartInternal.getTooltipSortFunction (cyclomatic 16): c3.ChartInternal.getTooltipSortFunction has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 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. This is NOT this file\u0027s highest cyclomatic complexity: c3.AxisInternal.generateAxis (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.js"},"region":{"startLine":10852}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8d807f49656c64195e1bd8a10c1bd573bb47e8479abeabde046e7e52d094b0"}},{"ruleId":"D1","level":"warning","message":{"text":"c3ext.c3ext.generate (cyclomatic 16): c3ext.c3ext.generate has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/js/c3ext.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c47cf15dd1fe3c43035803f256dcecb003dd317395d257b071c0ef10386c11c"}},{"ruleId":"D1","level":"warning","message":{"text":"drag.ChartInternal.drag (cyclomatic 16): drag.ChartInternal.drag has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 41). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/drag.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ac2fa792ffca977f9f0626007a7c990290ceeeca848f92336f6aeacdf7fcaa"}},{"ruleId":"D1","level":"warning","message":{"text":"tooltip.ChartInternal.getTooltipSortFunction (cyclomatic 16): tooltip.ChartInternal.getTooltipSortFunction has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tooltip.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a9d90dafa808cac5cb19fa98ac2f487b768b3ee60c2f881d9270244cefeb2f"}},{"ruleId":"D1","level":"warning","message":{"text":"updateScales (cyclomatic 16): updateScales has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::_parsePath::parseSegment (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":10995}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb4bd5dcb7a7a323a057b98373bbbeee0d933db348863ab2c09c6948f987b24"}},{"ruleId":"D1","level":"warning","message":{"text":"initBrush (cyclomatic 16): initBrush has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 9 function items inside it that branch ((anonymous), selectionAsValue, (anonymous), \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::_parsePath::parseSegment (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":12290}}}],"partialFingerprints":{"codehealthFindingId/v1":"0047bc6e14b500770b6895f8215520707dbb13dbd68808ffe35e76ad2e8bb348"}},{"ruleId":"D1","level":"warning","message":{"text":"generate (cyclomatic 16): generate has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to 13 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":"htdocs/js/extensions/c3ext.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c6727d90cb43ba4a1ee727d8203debe6b5ae34ec216f96e4596fae7bf20de0"}},{"ruleId":"D2","level":"warning","message":{"text":"redraw (cognitive 67): redraw has cognitive complexity 67 (threshold 15). Drivers by points: if/else 28 (39 pts), ternaries 10 (13 pts), boolean chains 12, loops 1 (3 pts) (nesting depth added 16). Of this number, 56 points are the body\u0027s own statements and 11 belong to 6 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":"c3.esm.js"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7ee5ee39071f593d1219eb397020489aa3116f8fb3933dcfae7bcaf747e7af"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.redrawEventRect (cognitive 66): c3.esm.ChartInternal.redrawEventRect has cognitive complexity 66 (threshold 15). Drivers by points: if/else 21 (42 pts), ternaries 9 (14 pts), boolean chains 10 (nesting depth added 26). Most of this is not in the body itself: 8 of the 66 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 9956, 10058, 9938, \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":"c3.esm.js"},"region":{"startLine":9898}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbd5aa3da784f237ae3e39833087dabf6f1504f4eead172637622780d09a4e4"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.redrawEventRect (cognitive 66): c3.ChartInternal.redrawEventRect has cognitive complexity 66 (threshold 15). Drivers by points: if/else 21 (42 pts), ternaries 9 (14 pts), boolean chains 10 (nesting depth added 26). Most of this is not in the body itself: 8 of the 66 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 8042, 8121, 8027, \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":"c3.js"},"region":{"startLine":7998}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73ffd317989fbb4b21411c1b00f4a18bd2d49c43e7ac34503a841534f2ccb0d"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.redrawEventRect (cognitive 66): c3.esm.ChartInternal.redrawEventRect has cognitive complexity 66 (threshold 15). Drivers by points: if/else 21 (42 pts), ternaries 9 (14 pts), boolean chains 10 (nesting depth added 26). Most of this is not in the body itself: 8 of the 66 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 9956, 10058, 9938, \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":"docs/js/c3.esm.js"},"region":{"startLine":9898}}}],"partialFingerprints":{"codehealthFindingId/v1":"8454e64415f4f583ec268923ecbd38b79b068fd51f0a76f782e3568f03ec9d06"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.redrawEventRect (cognitive 66): c3.ChartInternal.redrawEventRect has cognitive complexity 66 (threshold 15). Drivers by points: if/else 21 (42 pts), ternaries 9 (14 pts), boolean chains 10 (nesting depth added 26). Most of this is not in the body itself: 8 of the 66 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 8042, 8121, 8027, \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":"docs/js/c3.js"},"region":{"startLine":7998}}}],"partialFingerprints":{"codehealthFindingId/v1":"9626c8990ccfa0c80e6fd95d7ec68ca2ca238b371d56dcc112da123542b78866"}},{"ruleId":"D2","level":"warning","message":{"text":"interaction.ChartInternal.redrawEventRect (cognitive 66): interaction.ChartInternal.redrawEventRect has cognitive complexity 66 (threshold 15). Drivers by points: if/else 21 (42 pts), ternaries 9 (14 pts), boolean chains 10 (nesting depth added 26). Most of this is not in the body itself: 8 of the 66 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 88, 190, 70, \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/interaction.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a69e8fd18d47ebb2fec906a8dfa8c4f7599791308401a290d3229a3f05ebf2c"}},{"ruleId":"D2","level":"warning","message":{"text":"redrawArc (cognitive 62): redrawArc has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 21 (34 pts), if/else 18 (23 pts), boolean chains 5 (nesting depth added 18). Of this number, 25 points are the body\u0027s own statements and 37 belong to 24 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":"c3.esm.js"},"region":{"startLine":6727}}}],"partialFingerprints":{"codehealthFindingId/v1":"288be2f9a9525adc3bc757bebd614effd2ac4eca7c7ae5118bf406a304191f40"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.redraw (cognitive 59): c3.ChartInternal.redraw has cognitive complexity 59 (threshold 15). Drivers by points: if/else 28 (39 pts), boolean chains 12, ternaries 2 (5 pts), loops 1 (3 pts) (nesting depth added 16). Of this number, 48 points are the body\u0027s own statements and 11 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":"c3.js"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28883d32f3f063ac22cda39b6670cb2182fb376068fb13a29f0c728fa8c16f2"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.redraw (cognitive 59): c3.esm.ChartInternal.redraw has cognitive complexity 59 (threshold 15). Drivers by points: if/else 28 (39 pts), boolean chains 12, ternaries 2 (5 pts), loops 1 (3 pts) (nesting depth added 16). Of this number, 48 points are the body\u0027s own statements and 11 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":"docs/js/c3.esm.js"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98accbf6856f291199b4f9fa1b8de3412e7ded564bc76a61ea884ab093d2a68"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.redraw (cognitive 59): c3.ChartInternal.redraw has cognitive complexity 59 (threshold 15). Drivers by points: if/else 28 (39 pts), boolean chains 12, ternaries 2 (5 pts), loops 1 (3 pts) (nesting depth added 16). Of this number, 48 points are the body\u0027s own statements and 11 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":"docs/js/c3.js"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a649e21204c0125140e33511c6502fe369f8c7825b3f056aa583113b1920797"}},{"ruleId":"D2","level":"warning","message":{"text":"core.ChartInternal.redraw (cognitive 59): core.ChartInternal.redraw has cognitive complexity 59 (threshold 15). Drivers by points: if/else 28 (39 pts), boolean chains 12, ternaries 2 (5 pts), loops 1 (3 pts) (nesting depth added 16). Of this number, 48 points are the body\u0027s own statements and 11 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"d680c564b93a9036a5045ec32a04627c82203bbdb5fc1b8a053db3d744ff7c4e"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.redrawArc (cognitive 57): c3.ChartInternal.redrawArc has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (29 pts), ternaries 16 (23 pts), boolean chains 5 (nesting depth added 19). Of this number, 22 points are the body\u0027s own statements and 35 belong to 16 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":"c3.js"},"region":{"startLine":5294}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c40d1907c0a8a0e629a65ce61d1825fcaa253dc951a3b31bfd032e2e96a9836"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.redrawArc (cognitive 57): c3.esm.ChartInternal.redrawArc has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (29 pts), ternaries 16 (23 pts), boolean chains 5 (nesting depth added 19). Of this number, 22 points are the body\u0027s own statements and 35 belong to 16 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":"docs/js/c3.esm.js"},"region":{"startLine":6727}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df79ece56ce0dff8ec21c6abf26e8460a55745a7ace7561cdf5be4bb788a772"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.redrawArc (cognitive 57): c3.ChartInternal.redrawArc has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (29 pts), ternaries 16 (23 pts), boolean chains 5 (nesting depth added 19). Of this number, 22 points are the body\u0027s own statements and 35 belong to 16 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":"docs/js/c3.js"},"region":{"startLine":5294}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb1f122228ee23f9ee185633f3008d423f746ae7574b7a42f9e3b5579958b09"}},{"ruleId":"D2","level":"warning","message":{"text":"arc.ChartInternal.redrawArc (cognitive 57): arc.ChartInternal.redrawArc has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (29 pts), ternaries 16 (23 pts), boolean chains 5 (nesting depth added 19). Of this number, 22 points are the body\u0027s own statements and 35 belong to 16 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/arc.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cee9ad22d3a8875bf0cd54036ed6aa39692a4c5494f71fb21707a7f8830e945"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.updateLegend (cognitive 56): c3.esm.ChartInternal.updateLegend has cognitive complexity 56 (threshold 15). Drivers by points: boolean chains 20, if/else 17 (19 pts), ternaries 16 (17 pts) (nesting depth added 3). Of this number, 55 points are the body\u0027s own statements and 1 belongs to 7 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"c3.esm.js"},"region":{"startLine":10324}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d8a40cfee8a54cf43277b127ba096d610467de035437310b7f7f3f548976e0"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.updateLegend (cognitive 56): c3.ChartInternal.updateLegend has cognitive complexity 56 (threshold 15). Drivers by points: boolean chains 20, if/else 17 (19 pts), ternaries 16 (17 pts) (nesting depth added 3). Of this number, 55 points are the body\u0027s own statements and 1 belongs to 7 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"c3.js"},"region":{"startLine":8336}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c8cae8ac33f8d7d4c493df32dab4782869bb94a3fba3852da0a2dd54052b2c"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.updateLegend (cognitive 56): c3.esm.ChartInternal.updateLegend has cognitive complexity 56 (threshold 15). Drivers by points: boolean chains 20, if/else 17 (19 pts), ternaries 16 (17 pts) (nesting depth added 3). Of this number, 55 points are the body\u0027s own statements and 1 belongs to 7 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/js/c3.esm.js"},"region":{"startLine":10324}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43e7dcb217a0186cb22ccc7c2802a431504f0c6954f2a03990bfa42c96dc95d"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.updateLegend (cognitive 56): c3.ChartInternal.updateLegend has cognitive complexity 56 (threshold 15). Drivers by points: boolean chains 20, if/else 17 (19 pts), ternaries 16 (17 pts) (nesting depth added 3). Of this number, 55 points are the body\u0027s own statements and 1 belongs to 7 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/js/c3.js"},"region":{"startLine":8336}}}],"partialFingerprints":{"codehealthFindingId/v1":"3396aeb86769a873bff4447d3cc7316b2a75e1cd45f85e90a2b5b1d523325b23"}},{"ruleId":"D2","level":"warning","message":{"text":"legend.ChartInternal.updateLegend (cognitive 56): legend.ChartInternal.updateLegend has cognitive complexity 56 (threshold 15). Drivers by points: boolean chains 20, if/else 17 (19 pts), ternaries 16 (17 pts) (nesting depth added 3). Of this number, 55 points are the body\u0027s own statements and 1 belongs to 7 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/legend.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67debc3d1af1a3b4cdd88f2586dbcf2e3d752b0d2547c413bf7af0b3c360e99"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::redraw (cognitive 56): (anonymous)::redraw has cognitive complexity 56 (threshold 15). Drivers by points: if/else 25 (32 pts), boolean chains 12, ternaries 9, loops 1 (3 pts) (nesting depth added 9). 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":"c3.js"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a64c1374b6295f48f30d898ce43ffa66ca9839bf1795d2b39398c408e73520c"}},{"ruleId":"D2","level":"warning","message":{"text":"flow (cognitive 54): flow has cognitive complexity 54 (threshold 15). Drivers by points: if/else 21 (34 pts), loops 5 (10 pts), ternaries 4 (10 pts) (nesting depth added 24). Of this number, 21 points are the body\u0027s own statements and 33 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":5326}}}],"partialFingerprints":{"codehealthFindingId/v1":"4339d8d6d124f57b27c8008cef34fe0fe18b36e82bc56dccf7eb4712a3adaa2c"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.Chart.flow (cognitive 52): c3.Chart.flow has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (34 pts), loops 5 (10 pts), ternaries 3 (8 pts) (nesting depth added 23). Of this number, 19 points are the body\u0027s own statements and 33 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":4151}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c921f676cad71dfada4b8fa91a8974ba755437c8dbdf63c67bf46b836651b6c"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.Chart.flow (cognitive 52): c3.esm.Chart.flow has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (34 pts), loops 5 (10 pts), ternaries 3 (8 pts) (nesting depth added 23). Of this number, 19 points are the body\u0027s own statements and 33 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.esm.js"},"region":{"startLine":5326}}}],"partialFingerprints":{"codehealthFindingId/v1":"897d90a7cbe2e36b6136e55a22b8a82ccb0c1240486e8c0fbc8c855a95a824f1"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.Chart.flow (cognitive 52): c3.Chart.flow has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (34 pts), loops 5 (10 pts), ternaries 3 (8 pts) (nesting depth added 23). Of this number, 19 points are the body\u0027s own statements and 33 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.js"},"region":{"startLine":4151}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f109c56cc27b2b2ff5b5adb65faa1dba9db1059f903e604242d612696fa4eb"}},{"ruleId":"D2","level":"warning","message":{"text":"api.flow.Chart.flow (cognitive 52): api.flow.Chart.flow has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (34 pts), loops 5 (10 pts), ternaries 3 (8 pts) (nesting depth added 23). Of this number, 19 points are the body\u0027s own statements and 33 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/api.flow.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4585f76c30907e7f8ea43c9103135f476fb3c88302610e78725ea82aa7075ebb"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::getYDomain (cognitive 51): (anonymous)::getYDomain has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (21 pts), ternaries 15 (18 pts), boolean chains 12 (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":"c3.js"},"region":{"startLine":7270}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11af533b874038101d87062043ca1d39d25fd2e27b0214f9476fea86d8c9255"}},{"ruleId":"D2","level":"warning","message":{"text":"getYDomain (cognitive 51): getYDomain has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (21 pts), ternaries 15 (18 pts), boolean chains 12 (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":"c3.esm.js"},"region":{"startLine":9011}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed937ca833d5189cd41a76be552fda8dba51545e8b864ceb48129901ddd0c92"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.getYDomain (cognitive 45): c3.ChartInternal.getYDomain has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 12, ternaries 9 (12 pts) (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":"c3.js"},"region":{"startLine":7270}}}],"partialFingerprints":{"codehealthFindingId/v1":"6128b0ddc3520ae16797e10ee9db91b7a03ba37ca3ee5f9b4e606c8e6662ae4c"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.getYDomain (cognitive 45): c3.esm.ChartInternal.getYDomain has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 12, ternaries 9 (12 pts) (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":"docs/js/c3.esm.js"},"region":{"startLine":9011}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed5954ab3e9ace49866e9150e2d8fbda81d2b0c802b5794554ebeddef02ba44"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.getYDomain (cognitive 45): c3.ChartInternal.getYDomain has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 12, ternaries 9 (12 pts) (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":"docs/js/c3.js"},"region":{"startLine":7270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f53f1859ea92b94a80a43035d3e76a3c917c34712183954d1ee1fcab0436dd1"}},{"ruleId":"D2","level":"warning","message":{"text":"domain.ChartInternal.getYDomain (cognitive 45): domain.ChartInternal.getYDomain has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 12, ternaries 9 (12 pts) (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":"src/domain.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"93949b401d9a5e2bda98644d6c63ae06f327cb150ed530f6615f943af8ad9303"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::(anonymous)::_parsePath::_parseNumber (cognitive 43): (anonymous)::(anonymous)::_parsePath::_parseNumber has cognitive complexity 43 (threshold 15). Drivers by points: boolean chains 21, if/else 12 (15 pts), loops 4 (7 pts) (nesting depth added 6). 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":"c3.js"},"region":{"startLine":3640}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a139867460ff9b63e59da9a017f5920760d3ff57bd1d9cff375ada482f7a902"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::_parsePath::_parseNumber (cognitive 43): (anonymous)::_parsePath::_parseNumber has cognitive complexity 43 (threshold 15). Drivers by points: boolean chains 21, if/else 12 (15 pts), loops 4 (7 pts) (nesting depth added 6). 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":"c3.esm.js"},"region":{"startLine":4656}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa1e39df70185036da83f47d1ff30bd3f4d019dcbbd042cb93cea0ed4fcce82"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::getTooltipContent (cognitive 42): (anonymous)::getTooltipContent has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (22 pts), ternaries 4 (14 pts), boolean chains 5, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":10918}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31e53d7ffc507f84937a56d642c9d63e9a96df1554c192771b394176a40aa46"}},{"ruleId":"D2","level":"warning","message":{"text":"lineWithRegions (cognitive 42): lineWithRegions has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (22 pts), ternaries 5 (11 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 17). Of this number, 32 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":"c3.esm.js"},"region":{"startLine":11712}}}],"partialFingerprints":{"codehealthFindingId/v1":"d440bd80323b18c489031f9004cf177d68c91a03b873554d1c221785cbc276c7"}},{"ruleId":"D2","level":"warning","message":{"text":"getTooltipContent (cognitive 42): getTooltipContent has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (22 pts), ternaries 4 (14 pts), boolean chains 5, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":13540}}}],"partialFingerprints":{"codehealthFindingId/v1":"712183b4c5a2a2033d55201dc3120fbf1c018a5e8b2a0052beb0a183f3d81a85"}},{"ruleId":"D2","level":"warning","message":{"text":"convertDataToTargets (cognitive 40): convertDataToTargets has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 9, ternaries 4 (8 pts) (nesting depth added 8). Most of this is not in the body itself: 8 of the 40 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 7963, 7913, 8006, \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":"c3.esm.js"},"region":{"startLine":7880}}}],"partialFingerprints":{"codehealthFindingId/v1":"6669a9c3fcb7c291a6b9c44f4bba66889328f9f6c37187f5e79e7e3147ebee0b"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::updateLegend (cognitive 35): (anonymous)::updateLegend has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 17 (19 pts), boolean chains 10, if/else 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, 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":"c3.js"},"region":{"startLine":8336}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cee4fdf8c6ad80ef4f58028e7917c4aa4b5089b80257eb6b4feffd51a04174"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.generateFlow (cognitive 33): c3.esm.ChartInternal.generateFlow has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 13, ternaries 3, loops 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 0 of the 33 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 5491, 5605). 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":"c3.esm.js"},"region":{"startLine":5486}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1593e2d2fea4c201bed4578d05c717d02c97c52c1bd83fe3804bccfae934be"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.generateFlow (cognitive 33): c3.ChartInternal.generateFlow has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 13, ternaries 3, loops 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 0 of the 33 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 4292, 4364). 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":"c3.js"},"region":{"startLine":4290}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae3b3b14a76844c178f48bc40f44eafb24c95b6201730ce9e137ea12f4834a0"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.generateFlow (cognitive 33): c3.esm.ChartInternal.generateFlow has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 13, ternaries 3, loops 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 0 of the 33 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 5491, 5605). 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":"docs/js/c3.esm.js"},"region":{"startLine":5486}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a622c8567c533298d1ea870fa6b14f734f1d8e6a33ac49f64867db80b210330"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.generateFlow (cognitive 33): c3.ChartInternal.generateFlow has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 13, ternaries 3, loops 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 0 of the 33 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 4292, 4364). 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":"docs/js/c3.js"},"region":{"startLine":4290}}}],"partialFingerprints":{"codehealthFindingId/v1":"20808b4e613d2fda03b4cfe53f77b53d425eea396f1fdbff58f50d8254956851"}},{"ruleId":"D2","level":"warning","message":{"text":"api.flow.ChartInternal.generateFlow (cognitive 33): api.flow.ChartInternal.generateFlow has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 13, ternaries 3, loops 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 0 of the 33 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 170, 284). 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/api.flow.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea12db7dc45409e31adbce65ab8c53ab84dbac4066108f189c0bc429d96501b"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::lineWithRegions (cognitive 32): (anonymous)::lineWithRegions has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 5 (11 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":9466}}}],"partialFingerprints":{"codehealthFindingId/v1":"720aa184e81c8466e6af9edab2fcfc2a40472b926927ea32677324a2ed3b7685"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::updateSizes (cognitive 30): (anonymous)::updateSizes has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 16, if/else 8, boolean chains 6. 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":"c3.js"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"203a5056ba33d03bcf30b653e0f94d304b49c2a4237d9ba04e57395ccb278e29"}},{"ruleId":"D2","level":"warning","message":{"text":"generateAxis (cognitive 29): generateAxis has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (17 pts), ternaries 7 (10 pts), boolean chains 1, match/switch 1 (nesting depth added 4). Most of this is not in the body itself: 0 of the 29 points are its own statements and the rest belongs to 29 function items inside it that branch (axis::(anonymous), tickValues, tickInterval, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfc56900309601021496422e1aec4c9ae509c7a77bd20a974a03071d7137de1"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.getTooltipContent (cognitive 28): c3.ChartInternal.getTooltipContent has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 5, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":10918}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2ec7177e78509db9b2e219cef7c1f14cf8d9e3b37b4783aae4a5c0175e2829"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.getTooltipContent (cognitive 28): c3.esm.ChartInternal.getTooltipContent has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 5, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.esm.js"},"region":{"startLine":13540}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a09887191e56b714f71c4a71197f86aeafdacf083ab969fac82ffa7252d6fa"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.getTooltipContent (cognitive 28): c3.ChartInternal.getTooltipContent has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 5, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.js"},"region":{"startLine":10918}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a60d06669bfafc3e4ac9088a10ecbe18223779349e023ff9d1bb7e0ba9198ab"}},{"ruleId":"D2","level":"warning","message":{"text":"tooltip.ChartInternal.getTooltipContent (cognitive 28): tooltip.ChartInternal.getTooltipContent has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 5, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tooltip.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"745c9cb875cbe6b364ce00d5ffc7a6a39aa1c7b70891daaf13d350c32afe7a07"}},{"ruleId":"D2","level":"warning","message":{"text":"updateSizes (cognitive 28): updateSizes has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 15, if/else 8, boolean chains 5. 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":"c3.esm.js"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6ef732929dd731a883c4649346ab83dd08de41697cba7918455ce34a9895e7"}},{"ruleId":"D2","level":"warning","message":{"text":"getTooltipSortFunction (cognitive 28): getTooltipSortFunction has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 3 (10 pts), boolean chains 4 (nesting depth added 12). Of this number, 18 points are the body\u0027s own statements and 10 belong to 7 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":"c3.esm.js"},"region":{"startLine":13465}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9268acf92fb6da57d01023bf77eee91cec1c436ee9d5ad87ce8e2220de5ecc"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.initWithData (cognitive 27): c3.esm.ChartInternal.initWithData has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, ternaries 2 (4 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"c3.esm.js"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1044a879ebd4a2eb5af38116fc8a1a8c5a26895462966fe7192575cc5b72ff"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.initWithData (cognitive 27): c3.ChartInternal.initWithData has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, ternaries 2 (4 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"c3.js"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9371075b03c33e942e7d60865bd594a4a7d92278dde6dad8f131d3af426c936"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.initWithData (cognitive 27): c3.esm.ChartInternal.initWithData has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, ternaries 2 (4 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/js/c3.esm.js"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"d410b21c758b09ef9308fefe81e080be1a513d288ef386329d36b5d106a9a563"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.initWithData (cognitive 27): c3.ChartInternal.initWithData has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, ternaries 2 (4 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/js/c3.js"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c3ecd3424fec3c608e16a467370a7ab92bb28f4d987d696e3d5430c57cc96d"}},{"ruleId":"D2","level":"warning","message":{"text":"core.ChartInternal.initWithData (cognitive 27): core.ChartInternal.initWithData has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, ternaries 2 (4 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"db19fa2906d88b7d09acf98384f04d33717e69c51ca281c4e67d0336d0f423f0"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::initWithData (cognitive 27): (anonymous)::initWithData has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, ternaries 2 (4 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"c3.js"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e1d5127dbcbb21fa269722aef464fe91a732622be10028e5dd0117c8bcc08b"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::transformForArcLabel (cognitive 27): (anonymous)::transformForArcLabel has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 6 (16 pts), if/else 5 (6 pts), boolean chains 5 (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":"c3.js"},"region":{"startLine":5079}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fb64406c6b0d6363f90f810f771cffa4ea688c4cbe1d2f11df1e5192629570"}},{"ruleId":"D2","level":"warning","message":{"text":"transformForArcLabel (cognitive 27): transformForArcLabel has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 6 (16 pts), if/else 5 (6 pts), boolean chains 5 (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":"c3.esm.js"},"region":{"startLine":6461}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f7d7403b589c9e1ea9b51a6850cfbbce12bd35c3b9f824cf620f485f6a9264"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.lineWithRegions (cognitive 26): c3.ChartInternal.lineWithRegions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (7 pts), boolean chains 2, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":9466}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f29c8b919e14f0a099f678c51321156b5e09eac3258dc07c6d9ba7ff7c8b96"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.lineWithRegions (cognitive 26): c3.esm.ChartInternal.lineWithRegions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (7 pts), boolean chains 2, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.esm.js"},"region":{"startLine":11712}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1adbbb7274406b686185d58fe55872103296d8bbe5ac0a652d7986991903bb"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.lineWithRegions (cognitive 26): c3.ChartInternal.lineWithRegions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (7 pts), boolean chains 2, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.js"},"region":{"startLine":9466}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcdaded24459d472067d7aadd251fa6e1b4d4cb4c38b7e3ded8eb1e844c0030"}},{"ruleId":"D2","level":"warning","message":{"text":"shape.line.ChartInternal.lineWithRegions (cognitive 26): shape.line.ChartInternal.lineWithRegions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (7 pts), boolean chains 2, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shape.line.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac6e4d5c9eeece5f8da2b8321903d726fe07a89df2a69826156d74b68c2563a"}},{"ruleId":"D2","level":"warning","message":{"text":"getYDomainMin (cognitive 26): getYDomainMin has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (5 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 16). Of this number, 17 points are the body\u0027s own statements and 9 belong to 4 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":"c3.esm.js"},"region":{"startLine":8907}}}],"partialFingerprints":{"codehealthFindingId/v1":"633a787f9f343c4ed9b6b323d693ef25792c1dbbc4c823e3f22f3c25d25b5238"}},{"ruleId":"D2","level":"warning","message":{"text":"getYDomainMax (cognitive 26): getYDomainMax has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (5 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 16). Of this number, 17 points are the body\u0027s own statements and 9 belong to 4 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":"c3.esm.js"},"region":{"startLine":8959}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff68ee869cc1dbecbdeaaabc10a16f22621f621d5576dbc02bd29704910421c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::redrawArc (cognitive 25): (anonymous)::redrawArc has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 12 (19 pts), if/else 4 (5 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":"c3.js"},"region":{"startLine":5294}}}],"partialFingerprints":{"codehealthFindingId/v1":"55173a53c98cde55e6e5a4b6662b09627f99acc258994a23fd1c5844689ddfff"}},{"ruleId":"D2","level":"warning","message":{"text":"updateStanfordElements (cognitive 25): updateStanfordElements has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 22, if/else 2 (3 pts) (nesting depth added 1). Most of this is not in the body itself: 0 of the 25 points are its own statements and the rest belongs to 26 function literals inside it that branch (lines 13399, 13351, 13374, \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":"c3.esm.js"},"region":{"startLine":13222}}}],"partialFingerprints":{"codehealthFindingId/v1":"a258425acfe71c00cf24c790e495ac419b8fd2cf0bcfec40478be6a72acee54e"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.convertDataToTargets (cognitive 24): c3.ChartInternal.convertDataToTargets has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 9 (nesting depth added 2). Of this number, 12 points are the body\u0027s own statements and 12 belong to 5 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"c3.js"},"region":{"startLine":6317}}}],"partialFingerprints":{"codehealthFindingId/v1":"761c29d729282d7095b432634989420a995d4e13f266c0bda79ac52876783ccb"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.convertDataToTargets (cognitive 24): c3.esm.ChartInternal.convertDataToTargets has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 9 (nesting depth added 2). Of this number, 12 points are the body\u0027s own statements and 12 belong to 5 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/js/c3.esm.js"},"region":{"startLine":7880}}}],"partialFingerprints":{"codehealthFindingId/v1":"64245879161697b1827b868a66c5c7609dd3822a8181144c5bb357b18c531c54"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.convertDataToTargets (cognitive 24): c3.ChartInternal.convertDataToTargets has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 9 (nesting depth added 2). Of this number, 12 points are the body\u0027s own statements and 12 belong to 5 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/js/c3.js"},"region":{"startLine":6317}}}],"partialFingerprints":{"codehealthFindingId/v1":"96179c42ba57c07cbde41ca1536d260e9ed5c54aac1d9b3b329db223b6a55598"}},{"ruleId":"D2","level":"warning","message":{"text":"data.convert.ChartInternal.convertDataToTargets (cognitive 24): data.convert.ChartInternal.convertDataToTargets has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 9 (nesting depth added 2). Of this number, 12 points are the body\u0027s own statements and 12 belong to 5 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/data.convert.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"29201c26381897df181678e0e11d7edc5b6c3df6f8ad123e3a79c4e2aa36316f"}},{"ruleId":"D2","level":"warning","message":{"text":"initParams (cognitive 24): initParams has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 13, if/else 7, boolean chains 4. Of this number, 16 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"865a0cfd685f0d4f296a442c948b4cfb0403308b575a98fefc1ef3c9d74b3308"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.getYDomainMin (cognitive 23): c3.ChartInternal.getYDomainMin has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 13). Of this number, 17 points are the body\u0027s own statements and 6 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. This shape REPEATS in the file: one other method here (c3.ChartInternal.getYDomainMax) 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":"c3.js"},"region":{"startLine":7192}}}],"partialFingerprints":{"codehealthFindingId/v1":"5397258bf7cffae047823c717f7dc7c03e1de31fcdf147693fe312b72f1640f9"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.getYDomainMax (cognitive 23): c3.ChartInternal.getYDomainMax has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 13). Of this number, 17 points are the body\u0027s own statements and 6 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. This shape REPEATS in the file: one other method here (c3.ChartInternal.getYDomainMin) 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":"c3.js"},"region":{"startLine":7231}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd997680bb267471edc76a8b76d80065921f7b67ac5250fbc5033380ed5d6c0"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.getYDomainMin (cognitive 23): c3.esm.ChartInternal.getYDomainMin has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 13). Of this number, 17 points are the body\u0027s own statements and 6 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. This shape REPEATS in the file: one other method here (c3.esm.ChartInternal.getYDomainMax) 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":"docs/js/c3.esm.js"},"region":{"startLine":8907}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ceedd3e1c6db9a4b49680574ff7aa209ec026d2fb84b09781d2faca71b3d57"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.getYDomainMax (cognitive 23): c3.esm.ChartInternal.getYDomainMax has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 13). Of this number, 17 points are the body\u0027s own statements and 6 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. This shape REPEATS in the file: one other method here (c3.esm.ChartInternal.getYDomainMin) 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":"docs/js/c3.esm.js"},"region":{"startLine":8959}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e37a43e30bacbf26b7c05ef1110fe1c037c82436db0db21b8555f26e7a789f"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.getYDomainMin (cognitive 23): c3.ChartInternal.getYDomainMin has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 13). Of this number, 17 points are the body\u0027s own statements and 6 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. This shape REPEATS in the file: one other method here (c3.ChartInternal.getYDomainMax) 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":"docs/js/c3.js"},"region":{"startLine":7192}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efe7f675113cfe6a8ad5079a530719b3b43cd8ac1546eb169d7d674b9489cd1"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.getYDomainMax (cognitive 23): c3.ChartInternal.getYDomainMax has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 13). Of this number, 17 points are the body\u0027s own statements and 6 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. This shape REPEATS in the file: one other method here (c3.ChartInternal.getYDomainMin) 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":"docs/js/c3.js"},"region":{"startLine":7231}}}],"partialFingerprints":{"codehealthFindingId/v1":"67cfb888048214d72e6c64c1379702a9684ddf5246fc92864f4a312df1a16e22"}},{"ruleId":"D2","level":"warning","message":{"text":"domain.ChartInternal.getYDomainMin (cognitive 23): domain.ChartInternal.getYDomainMin has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 13). Of this number, 17 points are the body\u0027s own statements and 6 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. This shape REPEATS in the file: one other method here (domain.ChartInternal.getYDomainMax) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/domain.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd4125cb2f4cd2d5a06169a15b0164cc00bf3bf62cc61e225876b9b6a31a67f"}},{"ruleId":"D2","level":"warning","message":{"text":"domain.ChartInternal.getYDomainMax (cognitive 23): domain.ChartInternal.getYDomainMax has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 13). Of this number, 17 points are the body\u0027s own statements and 6 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. This shape REPEATS in the file: one other method here (domain.ChartInternal.getYDomainMin) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/domain.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d6f1714fe167ee9fbb43f4a570beec83b1abc0c9f331a1315e2beb3b568ad1"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.updateStanfordElements (cognitive 22): c3.ChartInternal.updateStanfordElements has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 19, if/else 2 (3 pts) (nesting depth added 1). Most of this is not in the body itself: 0 of the 22 points are its own statements and the rest belongs to 21 function literals inside it that branch (lines 10799, 10752, 10774, \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":"c3.js"},"region":{"startLine":10644}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7ac73e0672b9828fef89c02c16d61c940d98de0f3b2ce8823d28e9e896c28b"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.updateStanfordElements (cognitive 22): c3.esm.ChartInternal.updateStanfordElements has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 19, if/else 2 (3 pts) (nesting depth added 1). Most of this is not in the body itself: 0 of the 22 points are its own statements and the rest belongs to 21 function literals inside it that branch (lines 13399, 13351, 13374, \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":"docs/js/c3.esm.js"},"region":{"startLine":13222}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d41f37d6298d03c6db947cbbf1822d380a09ee6a44b53bcdffb24332b078fdf"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.updateStanfordElements (cognitive 22): c3.ChartInternal.updateStanfordElements has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 19, if/else 2 (3 pts) (nesting depth added 1). Most of this is not in the body itself: 0 of the 22 points are its own statements and the rest belongs to 21 function literals inside it that branch (lines 10799, 10752, 10774, \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":"docs/js/c3.js"},"region":{"startLine":10644}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f50e3ce64911797930296eb8129ada84689c1f8cb19a86b958a546855add11"}},{"ruleId":"D2","level":"warning","message":{"text":"stanfordelements.ChartInternal.updateStanfordElements (cognitive 22): stanfordelements.ChartInternal.updateStanfordElements has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 19, if/else 2 (3 pts) (nesting depth added 1). Most of this is not in the body itself: 0 of the 22 points are its own statements and the rest belongs to 21 function literals inside it that branch (lines 195, 147, 170, \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/stanfordelements.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87cb438724779905fc221c6b6f76e03c540b48e565c20442b1c86d3665ad474"}},{"ruleId":"D2","level":"warning","message":{"text":"updateGrid (cognitive 22): updateGrid has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 20, if/else 2. Of this number, 20 points are the body\u0027s own statements and 2 belong to 3 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":9620}}}],"partialFingerprints":{"codehealthFindingId/v1":"83418b038517bfd24d2b836ec4cb1755ed5d1c6ca7567b5dde88e77530d4f6f0"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.getShapeOffset (cognitive 21): c3.esm.ChartInternal.getShapeOffset has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 5 (9 pts), boolean chains 3 (nesting depth added 8). Most of this is not in the body itself: 0 of the 21 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 11456, 11474, 11452, \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":"c3.esm.js"},"region":{"startLine":11444}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1383252e1cd197d8c51d8860385ade0617e6209c7c77530d42a1aca8786723"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.getShapeOffset (cognitive 21): c3.ChartInternal.getShapeOffset has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 5 (9 pts), boolean chains 3 (nesting depth added 8). Most of this is not in the body itself: 0 of the 21 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 9246, 9263, 9244, \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":"c3.js"},"region":{"startLine":9240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8da08a459f82ac3759a86e72aab638771e8531879ca9daed38af16957224c91"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.getShapeOffset (cognitive 21): c3.esm.ChartInternal.getShapeOffset has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 5 (9 pts), boolean chains 3 (nesting depth added 8). Most of this is not in the body itself: 0 of the 21 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 11456, 11474, 11452, \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":"docs/js/c3.esm.js"},"region":{"startLine":11444}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51d88d29128f9cd02147ef549daa5a60e655c076ed6b5cc4576d60d8726a6d8"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.getShapeOffset (cognitive 21): c3.ChartInternal.getShapeOffset has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 5 (9 pts), boolean chains 3 (nesting depth added 8). Most of this is not in the body itself: 0 of the 21 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 9246, 9263, 9244, \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":"docs/js/c3.js"},"region":{"startLine":9240}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae59cd5398b2422b8545786c221cd1410969461db1bcb99b6bac0cb1d5e922d7"}},{"ruleId":"D2","level":"warning","message":{"text":"shape.ChartInternal.getShapeOffset (cognitive 21): shape.ChartInternal.getShapeOffset has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 5 (9 pts), boolean chains 3 (nesting depth added 8). Most of this is not in the body itself: 0 of the 21 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 68, 86, 64, \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/shape.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"25514eef799113f1604d9b146823240b9ff3dd33ee06f00fe41c346a2c9e7093"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::flow (cognitive 21): (anonymous)::flow has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (18 pts), ternaries 2 (3 pts) (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":"c3.js"},"region":{"startLine":4151}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcd0858c3564ae4cd7eb28bf1e97c0bf74c7bb7e3ef3200faadc2eb33807cf5"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::getRatio (cognitive 21): (anonymous)::getRatio has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 3 (8 pts), boolean chains 4 (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":"c3.js"},"region":{"startLine":7048}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57d3bba8458852dc3fe2ee74b4b9be5cfb90ed76a715fbcd7e2a2838f5e55c0"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::updateLegend::updatePositions (cognitive 21): (anonymous)::updateLegend::updatePositions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8, ternaries 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":8356}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ebf297ed938f9aaa9bdbe3f1b4054c2ac3da703bc6e9b902fe01ee9678ea4e"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::getYForText (cognitive 21): (anonymous)::getYForText has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":10360}}}],"partialFingerprints":{"codehealthFindingId/v1":"889210b81414372397a92aa95d753dddfa2401e16ac549c99b149ab912d9cf2f"}},{"ruleId":"D2","level":"warning","message":{"text":"updateLegend::updatePositions (cognitive 21): updateLegend::updatePositions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8, ternaries 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":10381}}}],"partialFingerprints":{"codehealthFindingId/v1":"5213bc93e4c6f537109cecc884cf1ca5c8815cf3aa2091d6acaa2e80c228d1dd"}},{"ruleId":"D2","level":"warning","message":{"text":"getYForText (cognitive 21): getYForText has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":12816}}}],"partialFingerprints":{"codehealthFindingId/v1":"b599cd493d706f9d1fa2dc75710938e23cbb448850861ff1768ea236b29b80b7"}},{"ruleId":"D2","level":"warning","message":{"text":"ZoomBehavior (cognitive 21): ZoomBehavior has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 3 (nesting depth added 1). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 18 function items inside it that branch (verifyZoom, left, setOptions, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/js/c3ext.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc63cb35a77e6ed0303a69d9dd90e10ba06df8c77a3ecaa30ea71c1912cd7c79"}},{"ruleId":"D2","level":"warning","message":{"text":"copy (cognitive 21): copy has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/js/c3ext.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7493797489d09b5ccea8bb304a9b8914e58ad3b883e6b0f4c9191bf11725a5e"}},{"ruleId":"D2","level":"warning","message":{"text":"ZoomBehavior (cognitive 21): ZoomBehavior has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 3 (nesting depth added 1). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 18 function items inside it that branch (verifyZoom, left, setOptions, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"htdocs/js/extensions/c3ext.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f764670068af37ae70c72f79ab2f3a1eaaa477e236102f87a00f927fc997aae"}},{"ruleId":"D2","level":"warning","message":{"text":"copy (cognitive 21): copy has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"htdocs/js/extensions/c3ext.js"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca795489900089da29072e807946b699c9294a0336de48cfa099b7a6b98b1b3"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.updateSizes (cognitive 20): c3.ChartInternal.updateSizes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8, boolean chains 6, ternaries 6. 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":"c3.js"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e251a0611bd6f2cbd5e31545a2792f32142086f71a217b962fce8eda025e6a"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.updateGrid (cognitive 20): c3.ChartInternal.updateGrid has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 18, if/else 2. 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":"c3.js"},"region":{"startLine":7762}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c91ad7a13841633f83667137bf057b07ec4725272d3edf5f4e9eea43a7eeb0"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.getTooltipSortFunction (cognitive 20): c3.ChartInternal.getTooltipSortFunction has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 6). Of this number, 18 points are the body\u0027s own statements and 2 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":"c3.js"},"region":{"startLine":10852}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b80d844950c8afbe717782f34a19ff13f2ff706a00f261cd6836bc1ff161f8"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.updateGrid (cognitive 20): c3.esm.ChartInternal.updateGrid has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 18, if/else 2. 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":"docs/js/c3.esm.js"},"region":{"startLine":9620}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40026e1fe11865e7ba1688143f35d5b654a002b5f2813cb8947a8d460b45062"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.getTooltipSortFunction (cognitive 20): c3.esm.ChartInternal.getTooltipSortFunction has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 6). Of this number, 18 points are the body\u0027s own statements and 2 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":"docs/js/c3.esm.js"},"region":{"startLine":13465}}}],"partialFingerprints":{"codehealthFindingId/v1":"35804202d283eff9b7f41fcc92d9ff7d03a0e4dde199aacfcb3aef665238961c"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.updateSizes (cognitive 20): c3.ChartInternal.updateSizes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8, boolean chains 6, ternaries 6. 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":"docs/js/c3.js"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fe7da7ca636161af6d4b360283b51c7e93aa2aeb7e198b8452579566b8f3cd"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.updateGrid (cognitive 20): c3.ChartInternal.updateGrid has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 18, if/else 2. 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":"docs/js/c3.js"},"region":{"startLine":7762}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa947897de0f2221864ac0eacf4d6fbfea8ee0646d2335bb06f099451694a01"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.getTooltipSortFunction (cognitive 20): c3.ChartInternal.getTooltipSortFunction has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 6). Of this number, 18 points are the body\u0027s own statements and 2 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":"docs/js/c3.js"},"region":{"startLine":10852}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae09d264c2e673170cd1e61d357365fa9443481afadee7bf47c8f6df55949a5"}},{"ruleId":"D2","level":"warning","message":{"text":"core.ChartInternal.updateSizes (cognitive 20): core.ChartInternal.updateSizes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8, boolean chains 6, ternaries 6. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"56995c0af2454fb7c1ff4cef5b5a27e797779aa6138bde483a85972ebd38e1df"}},{"ruleId":"D2","level":"warning","message":{"text":"grid.ChartInternal.updateGrid (cognitive 20): grid.ChartInternal.updateGrid has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 18, if/else 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grid.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad67fe0da374dfe400db4ffe394991ee37476ecabce67b20e0ff900e5097c1e"}},{"ruleId":"D2","level":"warning","message":{"text":"tooltip.ChartInternal.getTooltipSortFunction (cognitive 20): tooltip.ChartInternal.getTooltipSortFunction has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 6). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tooltip.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8d7ad4c129ded7b96f41d755835ece8c197cca260d4773dd8bd9a140459368"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::getTranslate (cognitive 20): (anonymous)::getTranslate has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 8 (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":"c3.js"},"region":{"startLine":1895}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe68fd8ba788be77183128b550d9dd154a0b75488daefd4b96f68172ea942e0"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::updateGrid (cognitive 20): (anonymous)::updateGrid has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 18, if/else 2. 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":"c3.js"},"region":{"startLine":7762}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ca445403eed26f424b1ab195a992861266040a33ef6c7118178267eb3c189f"}},{"ruleId":"D2","level":"warning","message":{"text":"getTranslate (cognitive 20): getTranslate has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 8 (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":"c3.esm.js"},"region":{"startLine":2317}}}],"partialFingerprints":{"codehealthFindingId/v1":"c140d9abd4061f1a12d3857614e7831e505bbd2bd9a810df22172034bf62bd28"}},{"ruleId":"D2","level":"warning","message":{"text":"getRatio (cognitive 20): getRatio has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (8 pts), boolean chains 4 (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":"c3.esm.js"},"region":{"startLine":8741}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4a0e023bcea1fdfd5e4e4bc8adde8969480ca5cb91dee9b2ba340b6f1513a1"}},{"ruleId":"D2","level":"warning","message":{"text":"generateDrawLine (cognitive 20): generateDrawLine has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 8 (9 pts) (nesting depth added 5). Most of this is not in the body itself: 3 of the 20 points are its own statements and the rest belongs to 4 function items inside it that branch ((anonymous), xValue, yValue, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":11631}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9a314c8edacc2ff0b3a0090a094eced8cdfa3933f0f88d08dcbbb5da3d714b"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::getXDomain (cognitive 19): (anonymous)::getXDomain has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 5 (6 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":"c3.js"},"region":{"startLine":7424}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a18677a5c40d059199591bbcba7cd90345f0c2e944503bfaee8676db94b1ae"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::getHorizontalAxisHeight (cognitive 19): (anonymous)::getHorizontalAxisHeight has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, if/else 6, ternaries 4 (6 pts) (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":"c3.js"},"region":{"startLine":9899}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1a4047bcb2672ea89b743ef793083ef37630a887c7894a33f01144d65c19b2"}},{"ruleId":"D2","level":"warning","message":{"text":"getXDomain (cognitive 19): getXDomain has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 5 (6 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":"c3.esm.js"},"region":{"startLine":9225}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b07a9f68171707f890bf797aa33ddd635b8d2a8c5bb5c76eb17045d718c65ab"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.getYForText (cognitive 18): c3.ChartInternal.getYForText has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5 (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":"c3.js"},"region":{"startLine":10360}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6da2b692a41ea845a77811261479b811aabb8937564674d6df3c8bdce7b10e"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.updateSizes (cognitive 18): c3.esm.ChartInternal.updateSizes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, boolean chains 5, ternaries 5. 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":"docs/js/c3.esm.js"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0cd8efa45fa08a002edb67027fd8bb5409e607f3d99f8d7faba3393f29f854"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.getYForText (cognitive 18): c3.esm.ChartInternal.getYForText has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5 (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":"docs/js/c3.esm.js"},"region":{"startLine":12816}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fd64866eab57ee583d5e0be8b06dd60a77ffd0ca47fcecbbbc4ff933e6b9a3"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.getYForText (cognitive 18): c3.ChartInternal.getYForText has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5 (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":"docs/js/c3.js"},"region":{"startLine":10360}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db242119a899506c40a3ea191cab21d66c89129298954bf3f45e66c7650239f"}},{"ruleId":"D2","level":"warning","message":{"text":"text.ChartInternal.getYForText (cognitive 18): text.ChartInternal.getYForText has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5 (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/text.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"51659915d473a95951cee8be7d75635b688975a0c4a5ccfe481a8595db382b3e"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::getTooltipSortFunction (cognitive 18): (anonymous)::getTooltipSortFunction has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4 (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":"c3.js"},"region":{"startLine":10852}}}],"partialFingerprints":{"codehealthFindingId/v1":"88513eccb5b4271c6a27b8833c7b50bf5b34b68d478d51c0f15602655671d7d9"}},{"ruleId":"D2","level":"warning","message":{"text":"splitTickText (cognitive 18): splitTickText has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 4 (6 pts), boolean chains 1, loops 1 (nesting depth added 8). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (split). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd69773a9ffde80b103abbe5609d2da593d0b050b89574ea8a5f1498cca9451"}},{"ruleId":"D2","level":"warning","message":{"text":"initBrush (cognitive 18): initBrush has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, ternaries 1 (nesting depth added 3). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 9 function items inside it that branch (selectionAsValue, (anonymous), (anonymous), \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":12290}}}],"partialFingerprints":{"codehealthFindingId/v1":"428123b959909e24997d952cf91fa2ff1be07d795ac43328a7fdf1605fc3d895"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.generateDrawLine (cognitive 17): c3.ChartInternal.generateDrawLine has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 6 (nesting depth added 4). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 9420, 9405, 9407). 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":"c3.js"},"region":{"startLine":9404}}}],"partialFingerprints":{"codehealthFindingId/v1":"44910bc3ad390ba17f058c79c370bc25c064ccfa60f203e679f426d4b638c3be"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.generateDrawLine (cognitive 17): c3.esm.ChartInternal.generateDrawLine has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 6 (nesting depth added 4). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 11654, 11637, 11640). 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":"docs/js/c3.esm.js"},"region":{"startLine":11631}}}],"partialFingerprints":{"codehealthFindingId/v1":"647537d1393476bbd8f2ec8a9619e2f1348d93265ff2c946d27873c5d1b74a4e"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.generateDrawLine (cognitive 17): c3.ChartInternal.generateDrawLine has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 6 (nesting depth added 4). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 9420, 9405, 9407). 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":"docs/js/c3.js"},"region":{"startLine":9404}}}],"partialFingerprints":{"codehealthFindingId/v1":"987346a75f792dc65acba755240681e20f240701e364c332610381ef30c35b3b"}},{"ruleId":"D2","level":"warning","message":{"text":"shape.line.ChartInternal.generateDrawLine (cognitive 17): shape.line.ChartInternal.generateDrawLine has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 6 (nesting depth added 4). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 120, 103, 106). 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/shape.line.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b964a11a4bf4f9434c5045fa499467fb7d255b0a653e021c7e2ad17ca6a0c2ed"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::getYDomainMin (cognitive 17): (anonymous)::getYDomainMin has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":7192}}}],"partialFingerprints":{"codehealthFindingId/v1":"719dd31d01ede77a7e74d7146a4d1b2c3ccace1fc02eb52abad336c8ffd49840"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::getYDomainMax (cognitive 17): (anonymous)::getYDomainMax has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":7231}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a856f7fd7721054c0ea18db2adf55299c85083f0b6677a35058839b36d0aa7"}},{"ruleId":"D2","level":"warning","message":{"text":"generateDrawArea (cognitive 17): generateDrawArea has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 9 (10 pts), if/else 5 (7 pts) (nesting depth added 3). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 5 function items inside it that branch ((anonymous), xValue, value0, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":11898}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1346c821081d8ae710158d8d9825b71962b905847e10a5bf24656e8e1362334"}},{"ruleId":"D2","level":"warning","message":{"text":"getHorizontalAxisHeight (cognitive 17): getHorizontalAxisHeight has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 6, ternaries 3 (4 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":12253}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd32de654049f7815934d2532b4766f11ab4f6c146f05f52036ff7104bf07f9"}},{"ruleId":"D2","level":"warning","message":{"text":"generate (cognitive 17): generate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5 (nesting depth added 2). Of this number, 10 points are the body\u0027s own statements and 7 belong to 13 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/js/c3ext.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"151dfe62c9f21dc667648536cad93019f61d678384d546bbb1e2e358f4519c09"}},{"ruleId":"D2","level":"warning","message":{"text":"generate (cognitive 17): generate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5 (nesting depth added 2). Of this number, 10 points are the body\u0027s own statements and 7 belong to 13 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"htdocs/js/extensions/c3ext.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d1a73964c9dc46e6b5e6e239b5fdeba2055f028735233ccd49e9a4e2e32d39"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.transformMain (cognitive 16): c3.esm.ChartInternal.transformMain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":2405}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b533ac3fa65b3a886450a8ed0259cba6924acef4235f659a2652a7b25912ec"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.load (cognitive 16): c3.esm.ChartInternal.load has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 8805, 8799). 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":"c3.esm.js"},"region":{"startLine":8790}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d73c9b549b8ca27d000b6a6a4b0d2569b14d766652fe16d040ad4441078164"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.transformMain (cognitive 16): c3.ChartInternal.transformMain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":1983}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdf790a0accb7db8477d55ea1cdf76688a53f939183d5cf1671f4183f430f39"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.load (cognitive 16): c3.ChartInternal.load has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 7106, 7100). 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":"c3.js"},"region":{"startLine":7091}}}],"partialFingerprints":{"codehealthFindingId/v1":"146fc72e9129be8d108bacc130aa8fc05acb44af0615116dff972d2383db66ea"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.getHorizontalAxisHeight (cognitive 16): c3.ChartInternal.getHorizontalAxisHeight has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 6, ternaries 1 (2 pts) (nesting depth added 1). 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":"c3.js"},"region":{"startLine":9899}}}],"partialFingerprints":{"codehealthFindingId/v1":"c703f91cf3c52c6e2709c35ed5ef7620894336c36922a7fe1ca2c83b765c39f8"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.transformMain (cognitive 16): c3.esm.ChartInternal.transformMain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.esm.js"},"region":{"startLine":2405}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f58581fef47058ca375d36a34410d613a2b2ff488fe744a8c5ec931bc5d962"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.esm.ChartInternal.load (cognitive 16): c3.esm.ChartInternal.load has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 8805, 8799). 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":"docs/js/c3.esm.js"},"region":{"startLine":8790}}}],"partialFingerprints":{"codehealthFindingId/v1":"253d8413a6bcb5cff929dd4cace953c9046f51e0494470ee1adadb175d1595a7"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.transformMain (cognitive 16): c3.ChartInternal.transformMain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/c3.js"},"region":{"startLine":1983}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8044dcfb6bc87dbb4daca821957251a4a12ec70d2fc4a99526bca5afa723aa8"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.load (cognitive 16): c3.ChartInternal.load has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 7106, 7100). 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":"docs/js/c3.js"},"region":{"startLine":7091}}}],"partialFingerprints":{"codehealthFindingId/v1":"49df30df61d3466ccd6c3c6f87faea38dca04c03f3e112254d829dad6c7ba68f"}},{"ruleId":"D2","level":"warning","message":{"text":"c3.ChartInternal.getHorizontalAxisHeight (cognitive 16): c3.ChartInternal.getHorizontalAxisHeight has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 6, ternaries 1 (2 pts) (nesting depth added 1). 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":"docs/js/c3.js"},"region":{"startLine":9899}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1caa49d437e0da7a8da637663becdb4c6ea6bfda3167ba81c3b5421a35741b"}},{"ruleId":"D2","level":"warning","message":{"text":"core.ChartInternal.transformMain (cognitive 16): core.ChartInternal.transformMain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core.ts"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"6193ef0671f8abcb764cd2dc92fc0a74222a99209eac76a758faa47405a11a21"}},{"ruleId":"D2","level":"warning","message":{"text":"data.load.ChartInternal.load (cognitive 16): data.load.ChartInternal.load has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 19, 13). 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/data.load.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa7a5087a4d5380441df59c04dbf563d65877913c2474c14c6d8f1616329027"}},{"ruleId":"D2","level":"warning","message":{"text":"size.ChartInternal.getHorizontalAxisHeight (cognitive 16): size.ChartInternal.getHorizontalAxisHeight has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 6, ternaries 1 (2 pts) (nesting depth added 1). 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/size.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"519b9ac49f6c90aa8984f58a97f422da48548d105848a113e8ce085bbadd3a51"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::initParams (cognitive 16): (anonymous)::initParams has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 13, boolean chains 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":"c3.js"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49fa93768b40151f06e380067b4a648d0ea2f453638bdc732d23f3b822e721c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::transformMain (cognitive 16): (anonymous)::transformMain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":1983}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b4275e3a8eaffb840858f5eff6d5dbb6d1246c291083b7aff72d08b60a472f"}},{"ruleId":"D2","level":"warning","message":{"text":"bindResize (cognitive 16): bindResize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2 (nesting depth added 4). Of this number, 8 points are the body\u0027s own statements and 8 belong to 6 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":"c3.esm.js"},"region":{"startLine":2550}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae041e36732661c29420023f6e14c6bc04dcbc06b590f9eb604b9af9c82d014"}},{"ruleId":"D2","level":"warning","message":{"text":"updateScales (cognitive 16): updateScales has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 12, if/else 3 (4 pts) (nesting depth added 1). Of this number, 15 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":10995}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97af37c89af197c2aea6afc17c9acda1987497c368fd07aa2816d1a8b161722"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./c3.esm.js: FileTooLong \u2014 10061 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 9561 over it, 20.12\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":"c3.esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e6f232fcf1839c1e48b1b0f5d83a47de2423ea98b3203c20af2513c4aa649e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/c3.esm.js: FileTooLong \u2014 10061 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 9561 over it, 20.12\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":"docs/js/c3.esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"819b211c7e57c93d5a1f82acf1c9d95dd219cdce36a927314bceba05242f0086"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./c3.js: FileTooLong \u2014 8309 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 1500 significant lines; this is 6809 over it, 5.54\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":"c3.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57212581fe6c1b3da36b5a4815271fc09bd56af3edc9c5a8fd53a1629a8d536f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/c3.js: FileTooLong \u2014 8309 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 7809 over it, 16.62\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":"docs/js/c3.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb219c72b5ae2c98b37a77ec8d1ec206e86fd338d4739d339327d27cc16de2f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/core.ts: FileTooLong \u2014 902 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 402 over it, 1.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7700c21508a4aadacfdff80e87144fd39e7953ae11d90900814c41ffaba03cde"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/arc.ts: FileTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 121 over it, 1.24\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/arc.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3eb76ba989430fe72b46147fb496c3bd98ffca0538ab31320dc380c042c06b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: dynamically change brushY/brushX according to axis_rotated. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/subchart.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad6ef27bcae2cc2e14019c73e6b7fcc720293146c10058b2b89db0b57697431"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Draw with region // TODO: Fix for horizotal charts \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shape.line.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93b68682ab3bfaea2be2be3eff1580df0f24cfb598dec2a80fcb9d60ed77871"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: how to select step chart? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/selection.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4007da90e382adc985ebf53e454c4243c1b04a0c534a7b5d61e605e526874429"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The following are not implemented and simply return window.SVGPathElement.pathSegList. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/polyfill.ts"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc0e1efa50e7ec745d0780ce6ef7d07b9cfe43bd07c999f165c16639fe1d982"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Optimize this to just append to the existing attribute. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/polyfill.ts"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aef5b8a1a2b34f22f3b62ed7eac5e7a98a48d61604c00e9a799b870f5a2d8f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: x1, x2, y1, y2, opacity need to be set here maybe \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/grid.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c50da7627452c05215cb778c6037230a976cd072729150373297a22989a39d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: binary search when multiple xs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/drag.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c9fb6d291a728cd49f598905768c2f75cd46250d540510b2de474a84e74784"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: included/unincluded callback here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/drag.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"45635246f75934e70b60825e413b0947e2b50284c08f32c6eddab5ef09e5e21e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: currently this must be called after initLegend because of update of sizes, but it should be done in initSubchart. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d612c4eaa2eb54adf4b8a0da4f92c53c3e53a7a5768943c95c21852b518e023"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe we should check that the modification by rollup-plugin-modify \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/chart-internal.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ae01e7768b927e6cb9b42c5633a7500683fe354bf605a600babb2aeecb3bb0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: each attr should be one function and change its behavior by internal.orient, probably \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/axis-internal.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5df30af6fc1dc4d0eafe52955e020f63591c36f368810f778988e96384226e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: rotated tick text \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/axis-internal.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b6bfdd6e3a76fd6a2ffc864beb6b39943e81adab22d120b8a12924aa49afe4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: extends all function \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/arc.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2673b1de6e7136cb619a924460a942cb5c73de82cc9c1fb1c2de2b31a62336"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: get target data by checking the state of focus \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/api.tooltip.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b56a58932d8b01e74ee16121596627ccf773013b21446b7077d3c45c7bb8efb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: do not unload if target will load (included in url/rows/columns) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/api.load.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c47ee6ee1aecbb99cbc101fb01076018d72f718ad74afb44721558b5447f547"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: multiple \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/api.grid.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f25ba8035d70f626aa1dc8d5332f8a0d545d04e8b13b8c643254b6c15d494b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: multiple \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/api.grid.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9c8cf4a7f16c300260b36b1ce6195c9d91d628c286d160faf03f91256dd0df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/api.color.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcb44fd2daa017896ff28cdbe2fe4b750e2fffd46204e79a0fb23ac300c48f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: return some values? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/api.axis.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a69ed8fa9b91b170335adb79b2c0e509d29cc10169121fa6580445a285c38a"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"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":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"f3c5d3262642571eb86fb6dc739cbea7d01bb98f44e21f0cc3f4e745944454d2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"f31733cc815de25a7bae74d164778ec098ea9aa6fcbd8c5cb1ce929451728f28"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"96f88121b035a898a6759141862415469563ae4858d3bd2449d90d5e5ba04a57"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"8f27785e5d32b999b72807ef88edf21f69ff79b11646f22bda6bfe29d2126e22"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"9fdace52517967069682f4d541cf1db103d249850b9ff9e28bca1b7ce09cb58b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"dcfa4da9215284db6a6355a359d46e54ece6d33a8e6548e02570fa88e565fa20"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9488215a7dfe47e32915e9bf0d6c6219e6d762f6bdc45e8963f9e05115a7ed1"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d0b8372b88de86c48c71342da49f7e90005dc9f8a58c5409a8109b5f42dd8800"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b9cff42451f1fdb53f7497e760ac4ec81d1b2df8ba7b5b11babdd82421a840ef"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"954cf96c20487d4296871543af42e704fd75eabac770eb78beb0454f70f92ebd"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"258f48a346bb39e147255d17b66bf1d903bf676f5f19bdf3b62759c9a884bc44"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85047b654ff1f1720324d9920b5595a57688b70bdaf20a6346b0c8fc53c5d0ae"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b71243f6b36bb6feffbd0a0659cb24f8180a5111e5450005cf5d568814c6ccfa"},"properties":{"dependency":{"package":"minimist","version":"0.0.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"112a001f292760ad0d972d6c3cec5c9ab9e94d73c5349c79681e70ec0ae60f71"},"properties":{"dependency":{"package":"minimist","version":"1.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4782cf16effaf6c57fb0737bf89a1c0fea32b00aad222db35c69436af434b88e"},"properties":{"dependency":{"package":"elliptic","version":"6.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"340e8b8f0fee29d6d6cb45ccd0437e64701d655771d019c853915389e8336f74"},"properties":{"dependency":{"package":"minimatch","version":"3.0.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8551343a455849fc5616830b4bf1c4631f2d9b63f581741ea2452b582f417c70"},"properties":{"dependency":{"package":"js-yaml","version":"3.13.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d97316bfedbc8b2c5c5f6e16d30126c2bc5be1716538f33e980bd0d8c6f5c9a"},"properties":{"dependency":{"package":"shelljs","version":"0.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1713870bacfe13433f9af68ef2df4d372284a96dcacdeec3ae15a926072d1e61"},"properties":{"dependency":{"package":"node-static","version":"0.7.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"package.json"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53a8f031795613fde27433af581ff2236d0d4917a4d32cdf3e2212f7b8443ec3"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.16","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b53d9bf196f044c2182982dbe35da3840f4b4607512ab9ccc6be26cf3827b34f"},"properties":{"dependency":{"package":"ansi-regex","version":"4.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"812c8bee67ffbeb5932f233aa5971fa61e03d1b555cfaa530074a693515c53bd"},"properties":{"dependency":{"package":"ansi-regex","version":"5.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3109fe12da6c70d79185eb39354b9d91447102db38ac52ce8247c411d12173b8"},"properties":{"dependency":{"package":"ws","version":"8.17.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e00c26ad99685576a7e2e36876665e2f4845bfbc445aee2d6ad8f95fcb5c8a5e"},"properties":{"dependency":{"package":"engine.io","version":"6.5.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad4707ec101a06114e9d9329d8f37af2e05b9c03c69a5be80556303ca7487534"},"properties":{"dependency":{"package":"braces","version":"2.3.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"529b8bde4dc81cc06d3137034c8d3e0de1d9e50d193da878f866ead0b5ddec0c"},"properties":{"dependency":{"package":"braces","version":"3.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"330a15ae56339582fb30f322dbaf3c180ec7ea3b2c8580445f5acb89f50db699"},"properties":{"dependency":{"package":"tmp","version":"0.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1809c398ff77c0f97e9b1d0d0ad98c4b241299ed4e6d6de4957bd5a2fca22b3e"},"properties":{"dependency":{"package":"tmp","version":"0.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"558479de21ced125565e0bad73ab6478ffb2fa2311867a0e793a1f91bf53ee2a"},"properties":{"dependency":{"package":"normalize-url","version":"4.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8ef33557430c0008e8fa29fa05b9f724a788f90c2ea64127655150f7863ba7f9"},"properties":{"dependency":{"package":"lodash","version":"4.17.23","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aca4d4652d4b127a70d9f96306057d07e89bf73c990ffbe5be5071b9a301d9f0"},"properties":{"dependency":{"package":"node-fetch","version":"1.7.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"166a0da794f53d3d3bc1b23200de129dcac31cb71fa1e0ce595bdb8f6da3ed1e"},"properties":{"dependency":{"package":"node-fetch","version":"2.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"082afafa66ed92bc4e66c7d264dc928dac98544f036e9500af1a4aba5de28cf7"},"properties":{"dependency":{"package":"d3-color","version":"1.4.1","advisory":"[GHSA redacted]","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5af9c48bad7ac3c3c5ebae8d7ecad663a32d9e1a627f1a40ddb8ab70a9042eae"},"properties":{"dependency":{"package":"bn.js","version":"4.12.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9bc03957ef3ac80b2171b2ace61fd76bcb3d261104e1623025b45c76176fe0c"},"properties":{"dependency":{"package":"bn.js","version":"5.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a5ef63c4a2705d824d287d97171f5f5f0eac8d17fcc8c23faf57199841212706"},"properties":{"dependency":{"package":"qs","version":"6.13.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e2349dff77f96e0bc39f97a9ccb5f23acdc83b46b3a4c595422c0f9b1efec07e"},"properties":{"dependency":{"package":"micromatch","version":"3.1.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8554efdfc767e922dd512839c7b65b89d1214466aae4064855b570e4f1ce1276"},"properties":{"dependency":{"package":"got","version":"9.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f8c52d3c29fcc9d20c1ffc6f4e496f2988970c6bdf56b244925346acba478b8"},"properties":{"dependency":{"package":"decode-uri-component","version":"0.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9a0f7eac430276be11b5a7bbf60e285ea7568fad6a3cb007b01c97b7a1a466cf"},"properties":{"dependency":{"package":"uuid","version":"3.4.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3335d307a116927fc3ff5e5909e8d2dc362bea0948ed03704d61c9e9a6b879da"},"properties":{"dependency":{"package":"diff","version":"4.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54379fc6cd99ea23d318d85e7359fae7364b41f6e37b94fe82c752f176c2fd12"},"properties":{"dependency":{"package":"debug","version":"3.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0bffe0cc91a315194efb1d7c60e7b05b550d01d11db3553832d555f4fdee8512"},"properties":{"dependency":{"package":"cookie","version":"0.4.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c9a251b062eb5f62d33f36e7f6a945b414239580489e19b05edec63642ad7417"},"properties":{"dependency":{"package":"body-parser","version":"1.20.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f8a3ea6bd5bc95f6c80a6d6760a1a911dee29ed0294dbde28364c6443346d7d2"},"properties":{"dependency":{"package":"@tootallnate/once","version":"1.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 2 of 39 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 39 of the 71 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: src/shape.ts, src/class.ts. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9658270ba49f37ed04e99ab1263b6393cd42aed8bdfb7aafd9fa1070f5491895"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h3: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_sample.haml"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f345a5e9b89ead805b2cadc3d97bf8591e1a3b832a90fa7cfe5f82cfeb25bea5"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h1 to h3: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/_samples_header.haml"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eecb6ab39254c6ede8a2bf4ffbdf435db2aef86ccc98cdf4c1ff208607b145a"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/layouts/layout.haml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"021b46cc2e6e4c0bc1d15ba7db031c7c31b54622636de69b5a2cbaff9dd7a1ed"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/layouts/layout.haml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f062d12899063a0752850d12bdd629dc342a6369685d235e7fd35d447c319b"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"3738c6865975648f9c4be5502e59e0ecfb2e9bd7ec1e04f0beaccef772ed1e16"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae20f50e8ef2ca9d4d449c7fd0076f4d95bacf2954773c2ace9a50cbad334f6"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"510467ea178d9b5c77e4d954052e92a0d2855cdadc582fdc126e98beb2f7e461"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cda6d93aa119451a5e50d2d4b13a848e1bf55adef7dee0219f21fa77989041"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"7586afe3d9654d54f61ffa66f95cdb8644858133ead1c5aa55081043243127ce"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c4fc9a54a03d21f7f2024985bdeaf3c44e841f25264b45341ed7097101f0e6"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6726f0f7c6dfbe6e68867e77c857596189895206055c92c2675d13f99a3dc2"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"2135783b94e697a0a5f26dacd0e01fa0094d28a107237871659a2e8f2db25f4e"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"3954bfa0de431892d40efe632af8d64a068ae5e310c5d81a176e997d4e643758"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c47331b2b45fc85393ddad198d4314341b9c1d17e3d94675484f459faefc91"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9f63e2da13318d362991487dfeff4b4d79df4bd72132df721081059c98cbd5"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2dec338b75a5b921ecd1f59883cb11ed9c4dcf621f49b396cd2c53c868da7f1"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99ac8e3a4543f83f17bdfbad3ff0aefee9831227804f07ab186378466c0ab1f"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"3243b0f9e1ebc7668a4ad6b61549fd5e69a49e28bfc86388809cc232143377f0"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bd9fa10a12fe8679ac876d243a8cf0ac4ae59e3b94e57e6dccf530910ebc74"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"202abce9083e790e33a1d63355cedae1949d3cd9722a6214e480842940171cf4"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"879bbe49539090c381da5658895dc49f8d8cfab5c655042f99f6197c5c766e41"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"49005692de4310366f1a000eaff8169c27527aa893e64dc43484aab2a65bf18c"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b482d9f6f4a80785a4a3ea85d3a7ffc63453974e0589bc8f7023d6c13a9549"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf9ee9acde873357e7a509b34f3ddee32c99f1ba2ab553d81a062cc2b35101c"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"577f19822f36d149d750bb4f2903e934dbab74cc8a3626aa1f31b4b517f97d09"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7f27b41386fbf0bdfc1f15a339a6f3ac50f0974ca867fc8a962b9bdd1f1635"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"df31ae76bf7b9a348ef7c646d6d163cbb6e90fe92300fab71803e2b8c8c7b82a"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea037023664ee7f3ca11b1e906b8d527df2b9309807ed37f84a9a54fc5895f02"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a086b8e652bf268c14d874ee576931549748ef9522fe02b29475878a50b79c0"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"167ac6af493fdea522521d37eeeb9b2ffaeb10172a5d42f41bce8baecd9eb44c"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17416b525a74bdd0088168d1d614a5569010f299b6a02292412b0435ac65d9e"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba881016588cde164d2d468588d68dfa2ce747585d63df011a4c4344ae78b0fa"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdfeb911f57111f711c45e17f8b4d7202026ba1095975f6d74005b7a049768a"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b245f6a224648f4b551efbd0f5311823c10960c72593e8465d26256d2ba3f46"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2a378fe302cceb94c00d1da340dc7052b72c2c4ff0bac5bd1fc45ea38ec009"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"259cf55dd891c467174ecdb8c8e2e63f431cd040d4d4cb97222378a2618c9742"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"53feb57d5b409048a57eb12e7b4a3335f1d807648e2d50864fd3f760d949b52f"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"547c59f35587aee45ced2008811e497b6bee170de54bae120ef80e10fba0c134"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"394ee0e88aae34afe4a9f27c05c8dfe2eb11c0845eb9d970de959dd98bfa7e5f"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h3 to h5: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference.html.haml"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4ccffb214ccd19950859290e8473c0cb60dc926cb350efd6ce1e2db0070c6e"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/index.html.haml"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4ec4cfa019118752acedf40a297159b50b7dc486250ff262d740bfd4ef09c7"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/index.js"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1934dc4c7102aec3acda40a06936ade823dd5e1958f5e1f0ed3a868b9ee56fb"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (2.3:1): \u0060.c3-tooltip th\u0060 sets color: #FFF on background-color: #aaa \u2014 2.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.css"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"809e2841f70216b1344da0e97022d5f13cd18d86928ec43b6bfbd84e123dce68"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (2.3:1): \u0060.c3-tooltip th\u0060 sets color: #FFF on background-color: #aaa \u2014 2.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/chart-bubble/c3.css"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"1108299cbf37910c623fd1250a471475e476216feb59ddec75d5a5ec6425c8b0"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (2.3:1): \u0060.c3-tooltip th\u0060 sets color: #FFF on background-color: #aaa \u2014 2.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/css/c3.css"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"2963a1ad39c33157e82a3706e23cb84e1de79c9df4804e1c9ea71a5c6524358f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (2.9:1): \u0060button.success, .button.success\u0060 sets color: white on background-color: #43ac6a \u2014 2.9:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/css/foundation.css"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7e167e4c6e762901d0a4d212a3438a7a91cba1d3e5a795fb6a19ff07b09532"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no a11y linter (an accessibility check that can read your UI \u2014 no component framework was detected and your pages are rendered by server-side templates, which neither the JSX/Vue ESLint plugins nor the HTML-template linters can parse; run axe/pa11y over the rendered pages, or assert the accessibility invariants over that rendered HTML in the test suite you already have) and no axe/pa11y/Lighthouse in tests or CI. Start by running that check over your rendered pages in CI. What was searched, so you can tell an absence from a miss: the 16 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"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":"M4","level":"note","message":{"text":"README/code drift: README claims a dependency on D3.js but the package.json manifest lists no d3 dependency \u2014 searched for: \u0060D3.js\u0060. Each was matched case- and separator-insensitively against file and directory NAMES anywhere in the tree, and against the CONTENTS of manifest files (package.json, *.csproj, *.props, *.slnx, *.yml, Dockerfile); the README\u0027s own prose never counts, so a claim is never refuted by merely being made. Nothing outside that search was read \u2014 a footprint living only in a submodule, in a file type not listed here, or under a name none of those terms matches is not seen, and this row is then wrong."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"343bbbd51ceb8de7a9ff88d79f7c797abf9b5921f8727b67b4d0f4f8a22c5e49"}},{"ruleId":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add CodeQL\u0027s javascript-typescript pack, \u0060semgrep --config=p/typescript\u0060, or eslint-plugin-security as a CI step. What was searched, so you can tell an absence from a miss: the 1138 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":"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":"R1","level":"warning","message":{"text":"Type Safety: 96 typed \u00B7 7 plain JS \u2014 the untyped files are c3.esm.js, c3.js, extensions/chart-bubble/bubble.js, extensions/exporter/phantom-exporter.js, extensions/js/c3ext.js, htdocs/js/extensions/c3ext.js (\u002B1 more). tsconfig.json switches off noImplicitAny, strictNullChecks, noImplicitThis, so the typed files are only partly type-checked. 1 production file(s) opt out entirely with @ts-nocheck \u00B7 0 @ts-ignore suppression(s); the opted-out files are src/polyfill.ts."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (558 matched lines \u00D7 2 locations): c3.esm.js:12425 \u00B7 c3.js:10050 \u2014 the two spans are one implementation copied and then locally edited \u2014 4669 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":"c3.esm.js"},"region":{"startLine":12425}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13d6b7cdde0ffbea215e06f6156ebce3a19628dcbf8f74fa61af913a91a706d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (225 lines \u00D7 2 locations): c3.esm.js:1956 \u00B7 c3.js:1625 \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":"c3.esm.js"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d326309d9957f252af492f0d8b8b6e4d81b73143bc807e0c1d236fa2583d1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (164 lines \u00D7 2 locations): c3.esm.js:2403 \u00B7 c3.js:1982 \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":"c3.esm.js"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9cded12dfd7f7962d3a4978b72097a15a331c12d6e931ee372cabce16ba7b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (155 matched lines \u00D7 2 locations): c3.esm.js:9011 \u00B7 src/domain.ts:108 \u2014 the two spans are one implementation copied and then locally edited \u2014 932 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":"c3.esm.js"},"region":{"startLine":9011}}}],"partialFingerprints":{"codehealthFindingId/v1":"c615f363db13fe2ada4bdc1e43bb43820b50407e28c0e9a806253de4f521ce7c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (147 lines \u00D7 2 locations): c3.esm.js:5310 \u00B7 c3.js:4137 \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":"c3.esm.js"},"region":{"startLine":5310}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e54e2aa7a8a335080dc834b4e5dd92d4eccd56b24b464de984a1ea3841cef7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (120 lines \u00D7 2 locations): c3.esm.js:1513 \u00B7 c3.js:1270 \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":"c3.esm.js"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1c585ff1519c803fab11e1093024857e02ca313ca6032bdfdcd3801cbf1444"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (118 lines \u00D7 2 locations): c3.esm.js:5517 \u00B7 c3.js:4294 \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":"c3.esm.js"},"region":{"startLine":5517}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb2e0b1d30f7eb5732a19a66d77170331ac7dba3f61ea4d579a6a2ab9bc5a22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (118 matched lines \u00D7 2 locations): c3.esm.js:13268 \u00B7 src/stanfordelements.ts:64 \u2014 the two spans are one implementation copied and then locally edited \u2014 852 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":"c3.esm.js"},"region":{"startLine":13268}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6897e0035bef3e9a7f61edf88fcd6bb803cfd47846a5a8477556895e40d42b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (99 lines \u00D7 2 locations): c3.esm.js:1824 \u00B7 c3.js:1517 \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":"c3.esm.js"},"region":{"startLine":1824}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e0dc5167d21670a1c1d8558773605a199d81502699953377ae71a2ccff1167"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (89 lines \u00D7 2 locations): c3.esm.js:7400 \u00B7 src/config.ts:4 \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":"c3.esm.js"},"region":{"startLine":7400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76e48067e66e8528162b2b5e1ff4a7df240b6c966a2ec104b49a3e8c74525f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (89 lines \u00D7 2 locations): c3.esm.js:10526 \u00B7 c3.js:8485 \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":"c3.esm.js"},"region":{"startLine":10526}}}],"partialFingerprints":{"codehealthFindingId/v1":"23da79594f2411eb0480e03674895a2a91eedf9873d38f1c1fd7f9d7ccf5e4d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (87 lines \u00D7 2 locations): c3.esm.js:10138 \u00B7 c3.js:8179 \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":"c3.esm.js"},"region":{"startLine":10138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2487f9604fc7cc3e4fe7825633d525fe52a7e6afd0058f06b3b6304034eb00d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (83 lines \u00D7 2 locations): c3.esm.js:5786 \u00B7 c3.js:4519 \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":"c3.esm.js"},"region":{"startLine":5786}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2c277a0c005648697d2b0373995b803b608d01d4b35e6417f246bf2b36fd6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (80 matched lines \u00D7 2 locations): src/shape.line.ts:78 \u00B7 src/shape.line.ts:345 \u2014 the two spans are one implementation copied and then locally edited \u2014 547 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shape.line.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d69fd406d70ee37b1b6c53cb22d51c5fc3d9a576a6fbf904327144b52621e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (75 matched lines \u00D7 2 locations): c3.esm.js:13465 \u00B7 src/tooltip.ts:44 \u2014 the two spans are one implementation copied and then locally edited \u2014 243 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":"c3.esm.js"},"region":{"startLine":13465}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bbd3bfa6182d45de8fc132c7dc52921794d714fda7b48bd437e4c218c2c87d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (72 lines \u00D7 2 locations): src/polyfill.ts:656 \u00B7 src/polyfill.ts:789 \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/polyfill.ts"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d60ed4094aa2945b931a9500277e2ce19d6c12e624ba671b37c530e13730fd8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (69 matched lines \u00D7 2 locations): c3.esm.js:7831 \u00B7 src/data.convert.ts:123 \u2014 the two spans are one implementation copied and then locally edited \u2014 491 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":"c3.esm.js"},"region":{"startLine":7831}}}],"partialFingerprints":{"codehealthFindingId/v1":"2480fe507a07e5f4403dcc21778ef4c56a2bdad5bb6e76796cf3cdf35cea0c2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (68 lines \u00D7 2 locations): c3.esm.js:10390 \u00B7 c3.js:8360 \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":"c3.esm.js"},"region":{"startLine":10390}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6c963ceb6dd0e52eb464f65352e0978f6fac378b24caa270e290d9379c3246"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (68 lines \u00D7 2 locations): c3.esm.js:13610 \u00B7 c3.js:10965 \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":"c3.esm.js"},"region":{"startLine":13610}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bedb2e5e4c64798d4a73e97d5b70f539f1136bf825238059cde6add307f5aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (67 lines \u00D7 2 locations): src/polyfill.ts:233 \u00B7 src/polyfill.ts:350 \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/polyfill.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dc4daee6708fd22f214a240804e43404d9d6f4c1f2fcef3010327214ed165a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (66 lines \u00D7 2 locations): c3.esm.js:8788 \u00B7 c3.js:7089 \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":"c3.esm.js"},"region":{"startLine":8788}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27b8065f6e222d4a4f717d05f2f52ba183e6e6669a066f16b1a719e694cab4f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (65 lines \u00D7 2 locations): c3.esm.js:10260 \u00B7 c3.js:8275 \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":"c3.esm.js"},"region":{"startLine":10260}}}],"partialFingerprints":{"codehealthFindingId/v1":"918dfd47f48062d78a505ead35436b0359da4c48b94313671fec457e1af14265"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (64 lines \u00D7 2 locations): c3.esm.js:6007 \u00B7 c3.js:4708 \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":"c3.esm.js"},"region":{"startLine":6007}}}],"partialFingerprints":{"codehealthFindingId/v1":"484218f78f81c66adec600630f24f9ce4050533134993485e67da7563351d8d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (63 matched lines \u00D7 2 locations): c3.esm.js:11400 \u00B7 src/shape.ts:12 \u2014 the two spans are one implementation copied and then locally edited \u2014 551 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":"c3.esm.js"},"region":{"startLine":11400}}}],"partialFingerprints":{"codehealthFindingId/v1":"920f1380c47f870772e57ca7b2822d1b6248b3caa9c32686a88a11f0316f63b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (61 matched lines \u00D7 2 locations): c3.esm.js:12709 \u00B7 src/text.ts:46 \u2014 the two spans are one implementation copied and then locally edited \u2014 399 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":"c3.esm.js"},"region":{"startLine":12709}}}],"partialFingerprints":{"codehealthFindingId/v1":"7771eb1b9ca77f4cd2ddedaac113c7336b9de012ab7b487c784c9c790d71a516"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (60 lines \u00D7 2 locations): c3.esm.js:6852 \u00B7 c3.js:5388 \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":"c3.esm.js"},"region":{"startLine":6852}}}],"partialFingerprints":{"codehealthFindingId/v1":"748dffc4e8bfe31c5f7652c87bc9e2c2f458768a7a410400cbe4ad2bd0d20c06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (60 lines \u00D7 2 locations): c3.esm.js:7017 \u00B7 c3.js:5533 \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":"c3.esm.js"},"region":{"startLine":7017}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8438e8003807a5fdab6b7042e065426e80f38a291c38aa29467f6503e8577f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (60 lines \u00D7 4 locations): src/polyfill.ts:466 \u00B7 src/polyfill.ts:560 \u00B7 src/polyfill.ts:1048 \u00B7 src/polyfill.ts:1150 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/polyfill.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"1203823c2c53e355e84279abc6eabad913e111a60d599acdbe516fec92bce6dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (59 lines \u00D7 2 locations): c3.esm.js:9230 \u00B7 c3.js:7425 \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":"c3.esm.js"},"region":{"startLine":9230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d31c95cdfb135acef8e0c041c38921b58401bcad59642cfefc4d7728d28880"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (59 lines \u00D7 2 locations): c3.esm.js:11111 \u00B7 c3.js:8968 \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":"c3.esm.js"},"region":{"startLine":11111}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4e6e4a9585a4c2085bacc578e53e86050ac0eda80f17b959e2328dcaad9cf5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (56 lines \u00D7 2 locations): c3.esm.js:4812 \u00B7 src/polyfill.ts:2085 \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":"c3.esm.js"},"region":{"startLine":4812}}}],"partialFingerprints":{"codehealthFindingId/v1":"7746665a649e44bdb8ea2add8e7ef8b849c549200afcb2945ee03941e2e2ba7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (55 lines \u00D7 2 locations): c3.esm.js:4435 \u00B7 c3.js:3455 \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":"c3.esm.js"},"region":{"startLine":4435}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fc7a7aabf470f264ebdaa5c661221fb1c13b29e50e9f788f5e694d23b60a02"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (54 lines \u00D7 2 locations): c3.esm.js:5670 \u00B7 c3.js:4423 \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":"c3.esm.js"},"region":{"startLine":5670}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bd246b8b6483eab73e7da37c7aefd8d92e6406934bc37010d4774958ed723a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (54 lines \u00D7 2 locations): c3.esm.js:6132 \u00B7 c3.js:4804 \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":"c3.esm.js"},"region":{"startLine":6132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0386dc97366598d88ee28e3f3ba5e930c01810bfb07dbe1a353362d9848d49a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2 locations): c3.esm.js:9044 \u00B7 c3.js:7280 \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":"c3.esm.js"},"region":{"startLine":9044}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f8bedacb788c92979c42805ab938115bc15c5862e7d2f8a96b4ca3256da614"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2 locations): c3.esm.js:1221 \u00B7 c3.js:1047 \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":"c3.esm.js"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db80c4adc54dc18d09beb6313bdb63971d18b98f880e28308eede00c68df41e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2 locations): c3.esm.js:410 \u00B7 c3.js:358 \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":"c3.esm.js"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"245e351d5abe33764a901ac65dbdc156aae82780e394673efd2f5aae07177556"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2 locations): c3.esm.js:819 \u00B7 c3.js:737 \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":"c3.esm.js"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfde9cc7537cd80daaacfc089ccbb887b5d8c57c5e083671be6ec30a474a831"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2 locations): c3.esm.js:4692 \u00B7 c3.js:3665 \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":"c3.esm.js"},"region":{"startLine":4692}}}],"partialFingerprints":{"codehealthFindingId/v1":"5468953d4fe4ef142ee5d96f44f76078cb9f600a83177fc13abd959dd3720d8d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2 locations): c3.esm.js:9854 \u00B7 c3.js:7958 \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":"c3.esm.js"},"region":{"startLine":9854}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b75dc0437b465991428238b58eb281fd18ddb01dbb87a608f3402d1144d2ddb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function redraw (cyclomatic 45, cognitive 56): redraw has cyclomatic complexity 45 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"448d62b450e30659f978b51fafc5f2cfc5933468c0a637344dc98d22a9aa793e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function redraw (cyclomatic 45, cognitive 56): redraw has cyclomatic complexity 45 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81bb2c3bc45769cb3bb026f4ca0054226b7fe06b0167304080238f2b3129ba5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function redraw (cyclomatic 45, cognitive 56): redraw has cyclomatic complexity 45 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0721b490be2978a272bf39680448035dc48f4b77d15383f07f605ac084d87a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getYDomain (cyclomatic 45, cognitive 51): getYDomain has cyclomatic complexity 45 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":9011}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa185b42ec64d8c78508380c4c175fdb375f5730ca0a15da5bbf2ef458220be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getYDomain (cyclomatic 45, cognitive 51): getYDomain has cyclomatic complexity 45 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":7270}}}],"partialFingerprints":{"codehealthFindingId/v1":"a775cde2ad18400b17fbfe69202060d38063ed82cbefa22cc2624820940fb2bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getYDomain (cyclomatic 45, cognitive 50): getYDomain has cyclomatic complexity 45 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/domain.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"7418bca4aff462fd5623aad18f0b1b8992cf9bb1edd0db6327bebeb8cfc449c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseNumber (cyclomatic 38, cognitive 43): _parseNumber has cyclomatic complexity 38 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":4656}}}],"partialFingerprints":{"codehealthFindingId/v1":"b960568553c5bb34f99766427e0b0c33b0e0408eb31925eabf2ea2b4d66278b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseNumber (cyclomatic 38, cognitive 43): _parseNumber has cyclomatic complexity 38 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":3640}}}],"partialFingerprints":{"codehealthFindingId/v1":"30361bd15bfa8311815a4e74955ad04de00bc7d9dd86bfe665d6e59d748aff99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _parseNumber (cyclomatic 38, cognitive 43): _parseNumber has cyclomatic complexity 38 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/polyfill.ts"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01be279dff517b462e3e222cdde9810238a54b8bd16fd1012d41e486d5b4762"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateLegend (cyclomatic 34, cognitive 35): updateLegend has cyclomatic complexity 34 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":10324}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4746873de6418009a11807fca6d2d64b85ac5e082aafccb8229e0446c9099c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateLegend (cyclomatic 34, cognitive 35): updateLegend has cyclomatic complexity 34 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":8336}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a9db699cadb90724e8155db495c20e091870aaa046bd03197da80b1447df49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateLegend (cyclomatic 34, cognitive 35): updateLegend has cyclomatic complexity 34 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/legend.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cf1ed961ae0cc9dffe8c1cf6716edd468493141f137f9c3d8ab2581d863295"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateSizes (cyclomatic 31, cognitive 30): updateSizes has cyclomatic complexity 31 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":"c3.js"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"206905a71711a92e1fe42be1fcd1e185a3c452c1a5f0fb34aba23a241e15a93c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateSizes (cyclomatic 31, cognitive 30): updateSizes has cyclomatic complexity 31 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/core.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"db448d99de23ee1b3c49db11d8b513db2821f57d7a359a984cef54b4117693b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateSizes (cyclomatic 29, cognitive 28): updateSizes has cyclomatic complexity 29 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"c3.esm.js"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a35e08bcc64647817e5ebd224146b65ff94d1f0f8264be56fafab5b6840b92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initWithData (cyclomatic 25, cognitive 27): initWithData has cyclomatic complexity 25 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"1817f4e9cdbb27e9666c8f4f25d9e50f80850be050e3c25f9b8bc1a7a6d699b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initWithData (cyclomatic 25, cognitive 27): initWithData has cyclomatic complexity 25 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.js"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e49f1d18d9612dac8d71bdee8d6ad9a7dc82af1c767a2bc635e3ec306c23256"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initWithData (cyclomatic 25, cognitive 27): initWithData has cyclomatic complexity 25 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/core.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"8142f80bcbc27d4c9ee5654cd60cd754a2f2d3b0091d594de5743079fb22d7df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSegment (cyclomatic 23, cognitive 7): parseSegment has cyclomatic complexity 23 and cognitive complexity 7; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"c3.esm.js"},"region":{"startLine":4797}}}],"partialFingerprints":{"codehealthFindingId/v1":"090ae42d3b925e64dec258fd7f8f80734782ac00fa5dd5c2feaab9ca050b7853"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSegment (cyclomatic 23, cognitive 7): parseSegment has cyclomatic complexity 23 and cognitive complexity 7; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"c3.js"},"region":{"startLine":3748}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5156ae118b24b549de0fe99f5be91a93024117f0b55ad6886e983e9de98255"}},{"ruleId":"R3","level":"warning","message":{"text":"Large Files: 17 file(s) over 400 lines (counted as significant lines \u2014 blank lines excluded \u2014 over production source only, tests excluded), largest first: c3.esm.js (13191), c3.js (11256), src/polyfill.ts (2250), spec/data-spec.ts (1425), src/core.ts (1194), spec/axis-spec.ts (1104) (\u002B11 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cecee31b569df4f07e06db732f1ca037af27b5afef9023da51f9673d931a142f"}},{"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":"c3.esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d3d0831a992fa730c7b65a43a34f4f7d17b459cdee6972b56debeee536f932"}},{"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":"c3.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2bbe303095038fb771791b4c47bbe541e669e1d9df1cd4b7bf690d553ed0bc"}},{"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":"extensions/js/c3ext.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"776fd7344d0256c99303dcf93ef61ae32f8332dfc8d170971c86ad1dde4cb6c6"}},{"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":"extensions/chart-bubble/bubble.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b0a6522fbcaf36577466c8090840b15e384ecc65c1f3e27c826166963f7141"}},{"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":"extensions/exporter/phantom-exporter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3355562e37f4c95d48f23008210488a8e40aeeb023bd999a49095f1daa72ee"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14027 LoC): no import path from any entry point (67 application, 2 tooling, 33 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":"c3.esm.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98802aa918bd028a719eb312442e8c53aa877a2bcab2a75841d8797af1e011ba"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~360 LoC): no import path from any entry point (67 application, 2 tooling, 33 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":"extensions/js/c3ext.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18974f8a5613d8bf084939650c231e6ca052762fe0a663b30f53f2fb8af2337"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~144 LoC): no import path from any entry point (67 application, 2 tooling, 33 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":"extensions/exporter/phantom-exporter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bfd5fd0346fa53c5db4ae01ece483d6adf0fcafac8992c78997b0d410b1cf0"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027clean-css-cli\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fa541c18326fd2b0a8448802c7d6577cef01bd4c7e50202b791e3e96f8ae3e69"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027jshint-stylish\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d74a066c92afc3c1a0abe14a79aba0d94a608a5c58ed5ee93b6f14441d8ae890"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027node-static\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0168dab39b85a0f135d4e4e9a48cd53d53afbabb54a932ec86bf357ad1a8f10e"}},{"ruleId":"S1","level":"warning","message":{"text":"Third-party script without Subresource Integrity: \u0060http://d3js.org/d3.v4.min.js\u0060 is executed by this page with no Subresource Integrity. Whoever can answer that request \u2014 the CDN, anyone who compromises it, anyone on the network path \u2014 runs arbitrary script in this page\u0027s origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time \u2014 the executed bytes can change with nobody touching this repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/chart-bubble/index.html"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20eabe0330f7db790bb48f8967c294e9be4a835e600096ea327d6d1a600fce9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!$$.hasType(\u0027gauge\u0027) \u0026\u0026 !$$.meetsArcLabelThreshold(ratio)\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":6537}}}],"partialFingerprints":{"codehealthFindingId/v1":"d925992dea96981119ef845294228b0f97b058a3687724eb85821d7e8e1fd7d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!config.data_types[id] || [\u0027line\u0027, \u0027spline\u0027, \u0027area\u0027, \u0027area-spline\u0027, \u0027step\u0027, \u0027area-step\u0027].indexOf( config.data_types[id] ) \u003E= 0\u0060 appears character-identically in 3 files \u2014 c3.esm.js, docs/js/c3.esm.js, src/type.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"c3.esm.js"},"region":{"startLine":13768}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b4864f4d080986f62c06c70d84b46afa4798365287b5c4cc37b525ebab1f9f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!config.data_types[id] || [\u0027line\u0027, \u0027spline\u0027, \u0027area\u0027, \u0027area-spline\u0027, \u0027step\u0027, \u0027area-step\u0027].indexOf(config.data_types[id]) \u003E= 0\u0060 appears character-identically in 2 files \u2014 c3.js, docs/js/c3.js. 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":"c3.js"},"region":{"startLine":11096}}}],"partialFingerprints":{"codehealthFindingId/v1":"da390e67603eae6978edd7cf157f0a484247c7b9bf50024a0f39776f3fc8379f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!config.tooltip_grouped || $$.hasType(\u0027stanford\u0027, targetsToShow)\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":9997}}}],"partialFingerprints":{"codehealthFindingId/v1":"325147884062368483c91e8f2a21a8c20d94f51ff079118b9722219ab11e5bbc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$$.brush.empty() \u0026\u0026 event \u0026\u0026 event.type !== \u0027end\u0027\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":12307}}}],"partialFingerprints":{"codehealthFindingId/v1":"36348e16bf024aacee4ff199fade2c87a4dba78f481bfe6ea13fb68e09e968b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$$.hasType(\u0027donut\u0027) \u0026\u0026 config.donut_label_ratio\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":6477}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9ca7e6a7efd1e1f681caa2d74716e9d6f0c48a4fe70f5f790be3f65e4b15bb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$$.hasType(\u0027donut\u0027) || $$.hasType(\u0027gauge\u0027)\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":6331}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f3c12e3ccf52c884a2963b145561980e10e09d57703bace1db604207151848"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$$.hasType(\u0027gauge\u0027) \u0026\u0026 !config.gauge_fullCircle\u0060 appears character-identically in 6 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3f48369eddb5144ef3969e041c7ac88187a88e8874227b89dc7a4e1d374e01"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$$.hasType(\u0027pie\u0027) \u0026\u0026 config.pie_label_ratio\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":6481}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d3f31497ccb900cc3ba666a3a8c4216d510166540b563b903a8fdb55bef75a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$$.hasType(\u0027stanford\u0027) || $$.hasArcType()\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":9778}}}],"partialFingerprints":{"codehealthFindingId/v1":"90162a785ad4157c0eade9f646c22e6a4d241f901205f7233188dee976fa9b96"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$$.isCategorized() \u0026\u0026 typeof d.value === \u0027string\u0027\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":2375}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7494a8dcceac19ae24246221a4ac5caf95b9699c82bbe7a494d3ae0dd349f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060$$.isTimeSeries() \u0026\u0026 tickValues \u0026\u0026 typeof tickValues !== \u0027function\u0027\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed2e2ee32a3488ec727cc2600a385a293be3b14c656b920ecc6f073e2bb0c53"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0027cacheIds\u0027 in args \u0026\u0026 $$.hasCaches(args.cacheIds)\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":5834}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb2c449d2c0a998b872a36594f8fc927803a4f29cc51ccb61840dddd9f549be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0027categories\u0027 in args \u0026\u0026 $$.isCategorized()\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":5818}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e82e76b07161fffb15b5c2f7900b8370ceb1b3577a3a5e7e61ee0ffe0cf71b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0027data\u0027 in d \u0026\u0026 this.hasTarget(this.data.targets, d.data.id)\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":8569}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6bfa6368a3a8426f94ad3988a3ec8de6a57802edd890b6c73f9fecfe9dbc44"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060($$.hasType(\u0027bar\u0027, yTargets) \u0026\u0026 config.bar_zerobased) || ($$.hasType(\u0027area\u0027, yTargets) \u0026\u0026 config.area_zerobased)\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":9041}}}],"partialFingerprints":{"codehealthFindingId/v1":"379ebe0ba2460665139912df0f19c00b8685ac877910167718b25358503782c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(brush.size() \u0026\u0026 brush.attr(\u0027height\u0027)) || 0\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":2483}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6324bfcaf944bccb592e0d5cc236c6363e9e00d106bbd890e33bb7ed7935c37"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060axisId === \u0027y\u0027 \u0026\u0026 notEmpty(config.axis_y_padding)\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":9126}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc2306a32b4ba25239b763d11a4419d40b7a6ef4b0a33e91270452b2a347faf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060axisId === \u0027y2\u0027 \u0026\u0026 notEmpty(config.axis_y2_padding)\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":9140}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc34d9899ad907f42a885ab138f4421fb36c1995352cc17723aeef117afd34f9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isString(order) \u0026\u0026 order.toLowerCase() === \u0027asc\u0027\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":13483}}}],"partialFingerprints":{"codehealthFindingId/v1":"739c16579dcca2fce2966a144a98cb897db37f483c9032120446d1f25580889b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isString(order) \u0026\u0026 order.toLowerCase() === \u0027desc\u0027\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":13487}}}],"partialFingerprints":{"codehealthFindingId/v1":"85183a03fd6c87ac6dd4a606aecfb43fedcd19ca6f79d8d687cbbf302697e81c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this._currentIndex != startIndex \u0026\u0026 this._currentIndex \u002B 1 \u003C this._endIndex \u0026\u0026 (this._string.charAt(this._currentIndex) == \u0027e\u0027 || this._stri\u2026\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":4737}}}],"partialFingerprints":{"codehealthFindingId/v1":"251ca6e4cf05f1eaa923c73835a10f1278a6ec724bd6f4e665a67fab1bb3fffa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this._currentIndex \u003C this._endIndex \u0026\u0026 !this._isCurrentSpace() \u0026\u0026 this._string.charAt(this._currentIndex) != \u0027,\u0027\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":4550}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d41f165f852e7710952127eeab72d22c43dd361ae0c3c0e9e059eeb5eb8bd81"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this._currentIndex \u003C this._endIndex \u0026\u0026 this._string.charAt(this._currentIndex) == \u0027\u002B\u0027\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":4670}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e67ccfc136f7870717a2e440749a1b9976251527e63c9f76d25c29b035886ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this._currentIndex \u003C this._endIndex \u0026\u0026 this._string.charAt(this._currentIndex) == \u0027,\u0027\u0060 appears character-identically in 5 files \u2014 c3.esm.js, c3.js, docs/js/c3.esm.js, docs/js/c3.js. 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":"c3.esm.js"},"region":{"startLine":4557}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a191250b1f50e6fd22f1bd007a7822844a03ae4e6012ffbdaca7411abeee979"}}],"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-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"CWE-319","shortDescription":{"text":"CWE-319"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-457","guid":"b62874fe-6222-8b5b-8ade-9527ad1cbb4a","name":"CWE-457","shortDescription":{"text":"CWE-457"},"helpUri":"https://cwe.mitre.org/data/definitions/457.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"CWE-522","shortDescription":{"text":"CWE-522"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"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":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"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":53,"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."]}]}