{"$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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"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":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"convertPathData.filters (cyclomatic 156): convertPathData.filters has cyclomatic complexity 156 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 103 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/convertPathData.js"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"404fcb363d5f91149f97e451d6c540249739db3c4e846f1d6639c0b9b7546bbe"}},{"ruleId":"D1","level":"warning","message":{"text":"removeHiddenElems.fn (cyclomatic 90): removeHiddenElems.fn has cyclomatic complexity 90 (threshold 15). Most of this is not in the body itself: 1 of the 90 points is its own statement and the rest belongs to 5 function items inside it that branch (a function literal at line 164, a function literal at line 431, a function literal at line 136, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/removeHiddenElems.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9410e13190576d2d12901513c7ecd510ea9920111a9afeb5ff88d054d9ee2a2"}},{"ruleId":"D1","level":"warning","message":{"text":"fn::enter (cyclomatic 68): fn::enter has cyclomatic complexity 68 (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":"plugins/removeHiddenElems.js"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"2047bf93d31a2b8e3b8f39b5396d228690694ef62d079a059df08acaf723a4d1"}},{"ruleId":"D1","level":"warning","message":{"text":"inlineStyles.fn (cyclomatic 61): inlineStyles.fn has cyclomatic complexity 61 (threshold 15). Most of this is not in the body itself: 1 of the 61 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 182, 74, 131, \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":"plugins/inlineStyles.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9e3901e706b46f5211ba47032dc133ab91996348187e3a635859fb85a6b5dc"}},{"ruleId":"D1","level":"warning","message":{"text":"coa.action (cyclomatic 52): coa.action has cyclomatic complexity 52 (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":"lib/svgo/coa.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"befb2b49016738310cc7029ab0807b396a6f26c56a60463d7fcc5907071ea7e0"}},{"ruleId":"D1","level":"warning","message":{"text":"removeUselessStrokeAndFill.fn (cyclomatic 46): removeUselessStrokeAndFill.fn has cyclomatic complexity 46 (threshold 15). Most of this is not in the body itself: 2 of the 46 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 51, 36). 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":"plugins/removeUselessStrokeAndFill.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6f59026f3ea3e17b7b28f1e2202ba7935ade3086f9453ea6b6dbcb868e23c4"}},{"ruleId":"D1","level":"warning","message":{"text":"_path.gatherPoints (cyclomatic 43): _path.gatherPoints has cyclomatic complexity 43 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 13 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_path.js"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"01eae2dd174eb2628ebf8a047b6ce55d9019a6030deaba1c5845cea929bad2c2"}},{"ruleId":"D1","level":"warning","message":{"text":"fn::enter (cyclomatic 43): fn::enter has cyclomatic complexity 43 (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":"plugins/removeUselessStrokeAndFill.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"682bed7d222982465e8fec59e13c144ba9d1912c0b0ffb340b68153eab7f648c"}},{"ruleId":"D1","level":"warning","message":{"text":"reusePaths.fn (cyclomatic 38): reusePaths.fn has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 1 of the 38 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 77, 43). 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":"plugins/reusePaths.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb48dbe9d195f84e848d1182314eae1cf8e1685bc3b27ad66ee59bba4ceafa6"}},{"ruleId":"D1","level":"warning","message":{"text":"removeUnknownsAndDefaults.fn (cyclomatic 37): removeUnknownsAndDefaults.fn has cyclomatic complexity 37 (threshold 15). Most of this is not in the body itself: 1 of the 37 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 126, 119). 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":"plugins/removeUnknownsAndDefaults.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3cdefb37f9abf0d315e721a821888a807ea699e846aa47860191a62b5b6f3e"}},{"ruleId":"D1","level":"warning","message":{"text":"convertShapeToPath.fn (cyclomatic 36): convertShapeToPath.fn has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 1 of the 36 points is its own statement and the rest belongs to one function literal inside it that branches (line 31). 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":"plugins/convertShapeToPath.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5495f8972d254576970a1498434301327dcc22db58cdcce19e4cc851d1cc2676"}},{"ruleId":"D1","level":"warning","message":{"text":"mergePaths.fn (cyclomatic 36): mergePaths.fn has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 1 of the 36 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 48, 126). 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":"plugins/mergePaths.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b8b199a808b5335c1d68aee736669b5bd3ae97b1d2b26e89e34deb68a5a891"}},{"ruleId":"D1","level":"warning","message":{"text":"fn::enter (cyclomatic 36): fn::enter has cyclomatic complexity 36 (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":"plugins/convertShapeToPath.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edef603ad0c09f9abc3684a5dc13c04d39912b2225c35ffdad2b6fee34711b8"}},{"ruleId":"D1","level":"warning","message":{"text":"fn::enter (cyclomatic 36): fn::enter has cyclomatic complexity 36 (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":"plugins/removeUnknownsAndDefaults.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd906ae42571ab51847730e98ed74be01b55c4217828dce27d9145d2c57d184"}},{"ruleId":"D1","level":"warning","message":{"text":"fn::enter (cyclomatic 35): fn::enter has cyclomatic complexity 35 (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":"plugins/mergePaths.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6362384dec93233f0e073929d8b89a1d971a038f59868eea2c7a3cafddb743d"}},{"ruleId":"D1","level":"warning","message":{"text":"convertOneStopGradients.fn (cyclomatic 34): convertOneStopGradients.fn has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 1 of the 34 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 43, 135, 57, \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":"plugins/convertOneStopGradients.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f5af967896ffda2f58c58e46550f536a4f6be13763a2ea5d5c4de1ce95c4be"}},{"ruleId":"D1","level":"warning","message":{"text":"fn (cyclomatic 34): fn has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 5 of the 34 points are its own statements and the rest belongs to 3 function items inside it that branch (enter, exit, exit::isIdPreserved). 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":"plugins/cleanupIds.js"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42af256108f4837c2ec896ac54fd750ee1ba84a97343ef5b06283501f35d071"}},{"ruleId":"D1","level":"warning","message":{"text":"fn::exit (cyclomatic 34): fn::exit has cyclomatic complexity 34 (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":"plugins/inlineStyles.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed2d2d7387fe02d2d1f88abf6598add5fea6dfd8e3466e5c0ab353197418ecc"}},{"ruleId":"D1","level":"warning","message":{"text":"prefixIds.fn (cyclomatic 33): prefixIds.fn has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 1 of the 33 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 143, 175, 261, \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":"plugins/prefixIds.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb65b3e0902460d53b2c379ed04f5df3f29d1eddbe8877c3c0de0e9531ed32d"}},{"ruleId":"D1","level":"warning","message":{"text":"path.parsePathData (cyclomatic 31): path.parsePathData has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/path.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d72ab5be497fbe5d36065287c75c9a6719722649734c187a27d9524b696507"}},{"ruleId":"D1","level":"warning","message":{"text":"collapseGroups.fn (cyclomatic 29): collapseGroups.fn has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to one function literal inside it that branches (line 57). 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":"plugins/collapseGroups.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8525bb6a2e4987b1d1b64c52a03a72fc648591f71a817ac82ca0d4a83a15d7"}},{"ruleId":"D1","level":"warning","message":{"text":"fn::exit (cyclomatic 29): fn::exit has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/collapseGroups.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd00c72906cf3abe85aeb555bfe363db59afdd2489cdeaf9a07805482ba099ec"}},{"ruleId":"D1","level":"warning","message":{"text":"convertPathData.fn (cyclomatic 27): convertPathData.fn has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 2 of the 27 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 135, 165, 184). 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":"plugins/convertPathData.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fcdb9e88d838d93cc1c214597f4c98e7472f06bb8fe687cc0106465f8ca0a6"}},{"ruleId":"D1","level":"warning","message":{"text":"removeXlink.fn (cyclomatic 27): removeXlink.fn has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 94, 197, 141). 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":"plugins/removeXlink.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d980b5e842e7dd62116c01b5579cc5a916f6f494e510ae043523c2f600df7f2"}},{"ruleId":"D1","level":"warning","message":{"text":"applyTransforms.applyTransforms (cyclomatic 26): applyTransforms.applyTransforms has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to one function literal inside it that branches (line 26). 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":"plugins/applyTransforms.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2980871f57f994fc15e3ec4716dc8ccc81ded50e9136f5690a5c31c3a9c6be6"}},{"ruleId":"D1","level":"warning","message":{"text":"applyTransforms.applyMatrixToPathData (cyclomatic 26): applyTransforms.applyMatrixToPathData has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/applyTransforms.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f77bdcdcebf1b7eeb3b18387156dfbccc2458da410b385d8bb87b4972e72401"}},{"ruleId":"D1","level":"warning","message":{"text":"minifyStyles.fn (cyclomatic 26): minifyStyles.fn has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 7 of the 26 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 103, 77). 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":"plugins/minifyStyles.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6329ca7ff2d05eee2fb4e0a612aaf24016d37cd698b0062786ed8f920404910"}},{"ruleId":"D1","level":"warning","message":{"text":"convertColors.fn (cyclomatic 25): convertColors.fn 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 3 function literals inside it that branch (lines 95, 130, 176). 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":"plugins/convertColors.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5215acbbd2edd42009c6405366117d8920e757f7304c52eb2a1b7fa607e75b9d"}},{"ruleId":"D1","level":"warning","message":{"text":"path.readNumber (cyclomatic 25): path.readNumber has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/path.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2345dea2b7c8587a6f6c2d42f2e1c1688574598c2d6c796a002e32075f24237f"}},{"ruleId":"D1","level":"warning","message":{"text":"applyTransforms::enter (cyclomatic 25): applyTransforms::enter has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/applyTransforms.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"280f9b3f99a03cfdf29659941e4c0897152f724e8f8a4f89d21c12887d5bbd16"}},{"ruleId":"D1","level":"warning","message":{"text":"fn::enter (cyclomatic 25): fn::enter has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/convertOneStopGradients.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"097a3e157c57c43dc383e3b1ea5c9f3d89b11d25149278b0f521fdeec3d95144"}},{"ruleId":"D1","level":"warning","message":{"text":"removeScripts.fn (cyclomatic 24): removeScripts.fn has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 77, 127). 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":"plugins/removeScripts.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6119a41a89b13ea07891074e8ef73182291309f9048f5aa6d18f9acb9509e5d8"}},{"ruleId":"D1","level":"warning","message":{"text":"convertToMixed (cyclomatic 24): convertToMixed has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to one function literal inside it that branches (line 955). 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":"plugins/convertPathData.js"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3275d004edef34078bad12235fd7bc03f548d2a2714b010518cf420548675f9"}},{"ruleId":"D1","level":"warning","message":{"text":"fn::exit (cyclomatic 24): fn::exit has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/reusePaths.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"470525221be1267420f9b9a90f19c142fa996344daeed9866a70c3416a64fe46"}},{"ruleId":"D1","level":"warning","message":{"text":"_transforms.optimize (cyclomatic 23): _transforms.optimize has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_transforms.js"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbf3a6b9b3e3345ddb0fd83bc81c00557e6bfd4f92d0a4e031083bdfb40df35"}},{"ruleId":"D1","level":"warning","message":{"text":"convertPathData.convertToRelative (cyclomatic 23): convertPathData.convertToRelative has cyclomatic complexity 23 (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: convertPathData.convertToMixed (cyclomatic 24) 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":"plugins/convertPathData.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddebffa6e51799b1e6c25290b16ed9f2a49374dbb23dd8ac21114bd61ceb337"}},{"ruleId":"D1","level":"warning","message":{"text":"moveElemsAttrsToGroup.fn (cyclomatic 23): moveElemsAttrsToGroup.fn has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 46, 36). 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":"plugins/moveElemsAttrsToGroup.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"93856bb5cae6cb81b1c2f38898a6b28b49b2c409ee87bd0507ab9005c0d368f9"}},{"ruleId":"D1","level":"warning","message":{"text":"fn::enter (cyclomatic 23): fn::enter has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/convertColors.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"334c186f53a1123d683d054ab2de63965e06da3458ab5ea840720a174853af58"}},{"ruleId":"D1","level":"warning","message":{"text":"fn::enter (cyclomatic 23): fn::enter has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/prefixIds.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"246bd9067b37e38a09eba69590c3937a6055f3a3bc67d27069872fd5a2b4a5b7"}},{"ruleId":"D1","level":"warning","message":{"text":"_path.convertRelativeToAbsolute (cyclomatic 22): _path.convertRelativeToAbsolute has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_path.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa85c18cee17d4fb885cb89beb3c1bdb49b42d5bbd0a44dfc37778443a229da"}},{"ruleId":"D1","level":"warning","message":{"text":"cleanupEnableBackground.fn (cyclomatic 22): cleanupEnableBackground.fn has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 39, 54, 29). 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":"plugins/cleanupEnableBackground.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4a18bd98d81413bd96f02b06ffb582e100f72aa3fb28ed0441ea44957f4046"}},{"ruleId":"D1","level":"warning","message":{"text":"fn::enter (cyclomatic 22): fn::enter has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/convertPathData.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6724fea394454a13d4bc399a74c357b986006f2e56548bb3508c5ce63cd8c415"}},{"ruleId":"D1","level":"warning","message":{"text":"fn::exit (cyclomatic 22): fn::exit has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/moveElemsAttrsToGroup.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"623d84fea44c67799f6a688f9b75b47eb3d8e797aa4d6a5252cde5daed319a45"}},{"ruleId":"D1","level":"warning","message":{"text":"cleanupListOfValues.fn (cyclomatic 21): cleanupListOfValues.fn has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 2 function items inside it that branch (roundValues, a function literal at line 112). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/cleanupListOfValues.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac86bf02d3c0579734bb7c7aab5a15efb8651e2d5a996e3613e2731709bbb5f1"}},{"ruleId":"D1","level":"warning","message":{"text":"removeEmptyContainers.fn (cyclomatic 21): removeEmptyContainers.fn has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 54, 38, 96). 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":"plugins/removeEmptyContainers.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc3088fba902e74b253e79ed0beb89ae41a159bca918c43cf3e2ae742a974ae"}},{"ruleId":"D1","level":"warning","message":{"text":"_path.intersects (cyclomatic 20): _path.intersects has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 7 of the 20 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 258, supportPoint, a function literal at line 235, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_path.js"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"48342e1872a889324c597a458e9c2b63c82dc918842fdd593f508a4312962a27"}},{"ruleId":"D1","level":"warning","message":{"text":"style.computeOwnStyle (cyclomatic 20): style.computeOwnStyle 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":"lib/style.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"11593a9d251faab9c51b971175ec17f70aa028e3d6a22e86e005d92beacabd6b"}},{"ruleId":"D1","level":"warning","message":{"text":"removeOffCanvasPaths.fn (cyclomatic 20): removeOffCanvasPaths.fn has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to one function literal inside it that branches (line 33). 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":"plugins/removeOffCanvasPaths.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18a8a803c8d7a0d5a643b3cfa516fd8a34fd95a2c9799630289f38eab0dd1b2"}},{"ruleId":"D1","level":"warning","message":{"text":"fn::enter (cyclomatic 20): fn::enter 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":"plugins/removeOffCanvasPaths.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51870b8c35e5cf7eddcfa71ac2649c4d4910a3e2af16833a074c404298d3bcb"}},{"ruleId":"D1","level":"warning","message":{"text":"_path.a2c (cyclomatic 19): _path.a2c has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_path.js"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bf59b8d71703cbd5b3c39f5504c1b362bbc83eaf7d26b4cf743d95d3cbf778"}},{"ruleId":"D1","level":"warning","message":{"text":"convertTransform.convertToShorts (cyclomatic 19): convertTransform.convertToShorts has cyclomatic complexity 19 (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":"plugins/convertTransform.js"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e583e15fb62f6cbffa56e2cc14764c56a3f767304c12381d6ccd87f60ac54721"}},{"ruleId":"D1","level":"warning","message":{"text":"convertTransform.removeUseless (cyclomatic 19): convertTransform.removeUseless has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to one function literal inside it that branches (line 280). 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":"plugins/convertTransform.js"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37ef3f56cabc29d48607d2949bcfa3148c18baba53ebd475e69ec10fa253971"}},{"ruleId":"D1","level":"warning","message":{"text":"removeAttrs.fn (cyclomatic 19): removeAttrs.fn has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 131, 109, 120). 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":"plugins/removeAttrs.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d69375434d99ef4d9d07cd768ebfc24bb4412a01c535abe57a80a147a693412"}},{"ruleId":"D1","level":"warning","message":{"text":"fn::enter (cyclomatic 19): fn::enter has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/cleanupEnableBackground.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bca97803f2e333146afa9c76742ce76281ee6c1c81e4b900bc712be9df778a"}},{"ruleId":"D1","level":"warning","message":{"text":"fn::enter (cyclomatic 17): fn::enter has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/removeXlink.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"456a7534bf323677aaa4358ab7550f076e2ecdca025ac5f2c1b896ab514747cb"}},{"ruleId":"D2","level":"warning","message":{"text":"filters (cognitive 250): filters has cognitive complexity 250 (threshold 15). Drivers by points: if/else 69 (175 pts), boolean chains 56, loops 3 (10 pts), ternaries 3 (9 pts) (nesting depth added 119). None of this is in the body itself: all 250 points belong to 2 function literals inside it that branch (lines 406, 866). 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":"plugins/convertPathData.js"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"8233344ca54b60ab626670a8dc07d349445e491394de302d73e86c9af5badf4e"}},{"ruleId":"D2","level":"warning","message":{"text":"inlineStyles.fn (cognitive 103): inlineStyles.fn has cognitive complexity 103 (threshold 15). Drivers by points: if/else 33 (67 pts), loops 8 (16 pts), boolean chains 14, error handling 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 45). None of this is in the body itself: all 103 points belong to 6 function literals inside it that branch (lines 182, 74, 131, \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":"plugins/inlineStyles.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3348aa2651ebd6d4c907d614ac885c2a263c19a97b6480b889f6e09436006ea"}},{"ruleId":"D2","level":"warning","message":{"text":"reusePaths.fn (cognitive 102): reusePaths.fn has cognitive complexity 102 (threshold 15). Drivers by points: if/else 19 (66 pts), loops 6 (27 pts), boolean chains 9 (nesting depth added 68). None of this is in the body itself: all 102 points belong to 2 function literals inside it that branch (lines 77, 43). 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":"plugins/reusePaths.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a30357d53760949a9af13ad5698906e5aee77d3d05088ba98e96886c7a5924"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::exit (cognitive 87): fn::exit has cognitive complexity 87 (threshold 15). Drivers by points: if/else 14 (58 pts), loops 5 (25 pts), boolean chains 4 (nesting depth added 64). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/reusePaths.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2465a3988bdb305fe605eade03c56b6b7b37c53c36feb75664c10e0cc186cf5"}},{"ruleId":"D2","level":"warning","message":{"text":"removeHiddenElems.fn (cognitive 79): removeHiddenElems.fn has cognitive complexity 79 (threshold 15). Drivers by points: if/else 32 (45 pts), boolean chains 21, loops 8 (13 pts) (nesting depth added 18). None of this is in the body itself: all 79 points belong to 5 function items inside it that branch (a function literal at line 164, a function literal at line 431, canRemoveNonRenderingNode, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/removeHiddenElems.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9eb8a509b0fb279bf4e1ceabe080a9008daaeec043d4ba81075e1441492d1a"}},{"ruleId":"D2","level":"warning","message":{"text":"cleanupIds.fn (cognitive 70): cleanupIds.fn has cognitive complexity 70 (threshold 15). Drivers by points: if/else 17 (39 pts), loops 7 (18 pts), boolean chains 7, ternaries 4 (6 pts) (nesting depth added 35). Most of this is not in the body itself: 6 of the 70 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 157, 208, 216). 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":"plugins/cleanupIds.js"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbc55835e4cf89547148c48c9eebcdf7c5bfb609565c571e7171bc705c181f6"}},{"ruleId":"D2","level":"warning","message":{"text":"action (cognitive 65): action has cognitive complexity 65 (threshold 15). Drivers by points: if/else 33 (42 pts), boolean chains 13, ternaries 2 (6 pts), loops 1 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/svgo/coa.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4748fca030fedd82ad37015e06fa77a8ca607c1124f706f0955f5ede160aeb3c"}},{"ruleId":"D2","level":"warning","message":{"text":"convertColors.fn (cognitive 62): convertColors.fn has cognitive complexity 62 (threshold 15). Drivers by points: if/else 21 (59 pts), boolean chains 2, loops 1 (nesting depth added 38). None of this is in the body itself: all 62 points belong to 3 function literals inside it that branch (lines 95, 130, 176). 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":"plugins/convertColors.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0e08f79411b475a2d3e5bac98bf8e47b35a7da50383416680cae8512b2b0bc"}},{"ruleId":"D2","level":"warning","message":{"text":"path.parsePathData (cognitive 62): path.parsePathData has cognitive complexity 62 (threshold 15). Drivers by points: if/else 21 (55 pts), boolean chains 6, loops 1 (nesting depth added 34). 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":"lib/path.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5422c9e524ed8685a55fe1fc1d4c3b1a225b3f8539ed1c5c311c4bc329fd8574"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::exit (cognitive 62): fn::exit has cognitive complexity 62 (threshold 15). Drivers by points: if/else 17 (38 pts), loops 7 (12 pts), boolean chains 6, ternaries 1 (3 pts), error handling 1 (2 pts), other 1 (nesting depth added 29). 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":"plugins/inlineStyles.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee4dc9a1a37127b29e82e09626c8b5105edb8e8897392ad6839bb56ef7bbefa"}},{"ruleId":"D2","level":"warning","message":{"text":"_path.gatherPoints (cognitive 58): _path.gatherPoints has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (37 pts), boolean chains 8, ternaries 3 (6 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 30). Of this number, 50 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_path.js"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d379d2cee0e95cad8f983b85004938740d9200702a71463ca37faabc0eb454"}},{"ruleId":"D2","level":"warning","message":{"text":"removeUselessStrokeAndFill.fn (cognitive 58): removeUselessStrokeAndFill.fn has cognitive complexity 58 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 17, loops 2 (7 pts), ternaries 2 (nesting depth added 22). Most of this is not in the body itself: 1 of the 58 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 51, 36). 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":"plugins/removeUselessStrokeAndFill.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b66ffb64b37361e25627f515aa5cf9bfcc8fb0e9a797bed2c1033f3d253ec7"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::enter (cognitive 57): fn::enter has cognitive complexity 57 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 18, loops 2 (7 pts), ternaries 2 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/removeUselessStrokeAndFill.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2217ac10db1a723f524c37fd19cb5f038496168a53d7d563ce99b355c4f2158b"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::enter (cognitive 55): fn::enter has cognitive complexity 55 (threshold 15). Drivers by points: if/else 18 (52 pts), boolean chains 2, loops 1 (nesting depth added 34). 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":"plugins/convertColors.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bab4f63bf3a1f004baec3c8617dabde3382ef547929fb52978e5babc14ebee"}},{"ruleId":"D2","level":"warning","message":{"text":"applyMatrixToPathData (cognitive 54): applyMatrixToPathData has cognitive complexity 54 (threshold 15). Drivers by points: if/else 21 (44 pts), ternaries 2 (8 pts), boolean chains 1, loops 1 (nesting depth added 29). 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":"plugins/applyTransforms.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffa255626fa27f7f9a68f231892dc9be54679550a3b21096181ad3062103326"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::enter (cognitive 53): fn::enter has cognitive complexity 53 (threshold 15). Drivers by points: if/else 22 (29 pts), boolean chains 19, loops 3 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/removeHiddenElems.js"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7829e8f305ab9ee1e517407e8d4f938dd19608d95fecb045f195591af332495"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::enter (cognitive 52): fn::enter has cognitive complexity 52 (threshold 15). Drivers by points: if/else 18 (37 pts), boolean chains 13, loops 1, ternaries 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/removeUnknownsAndDefaults.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b716b5eb96f4aec112b480cf682d7c523a6c6c6ea0170c45815c3f8ac054364"}},{"ruleId":"D2","level":"warning","message":{"text":"removeUnknownsAndDefaults.fn (cognitive 51): removeUnknownsAndDefaults.fn has cognitive complexity 51 (threshold 15). Drivers by points: if/else 19 (38 pts), boolean chains 11, loops 1, ternaries 1 (nesting depth added 19). None of this is in the body itself: all 51 points belong to 2 function literals inside it that branch (lines 126, 119). 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":"plugins/removeUnknownsAndDefaults.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8d6c861cea057effbfd7b55954fb78d2a18a81e7afe1cf7e5fb837210f6e15"}},{"ruleId":"D2","level":"warning","message":{"text":"prefixIds.fn (cognitive 49): prefixIds.fn has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 11, loops 4 (5 pts), error handling 1 (3 pts) (nesting depth added 20). None of this is in the body itself: all 49 points belong to 4 function literals inside it that branch (lines 143, 175, 261, \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":"plugins/prefixIds.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b130ef38fd35d2407203028e2209eb76e35dc99a69884bba170d3ecde7a5ca19"}},{"ruleId":"D2","level":"warning","message":{"text":"moveElemsAttrsToGroup.fn (cognitive 49): moveElemsAttrsToGroup.fn has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (33 pts), loops 6 (14 pts), boolean chains 2 (nesting depth added 25). None of this is in the body itself: all 49 points belong to 2 function literals inside it that branch (lines 46, 36). 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":"plugins/moveElemsAttrsToGroup.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b29cad604cfadeb20a77abb52af5604db8aaa98910b64b407e4debba24ba7b"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::exit (cognitive 49): fn::exit has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 6 (14 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/moveElemsAttrsToGroup.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a60f1079d72cfa5c5f19b09db28a860265c3e41407d81f39a5270ef68e81ae"}},{"ruleId":"D2","level":"warning","message":{"text":"convertOneStopGradients.fn (cognitive 47): convertOneStopGradients.fn has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 11, loops 5 (8 pts), ternaries 1 (nesting depth added 14). None of this is in the body itself: all 47 points belong to 4 function literals inside it that branch (lines 43, 135, 57, \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":"plugins/convertOneStopGradients.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f96565a07e3b449b16c49428a21584ae6f45e01b7f8be130cc13f1d6b6373b"}},{"ruleId":"D2","level":"warning","message":{"text":"mergePaths.fn (cognitive 44): mergePaths.fn has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (34 pts), boolean chains 9, loops 1 (nesting depth added 19). None of this is in the body itself: all 44 points belong to 2 function literals inside it that branch (lines 48, 126). 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":"plugins/mergePaths.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d964b1d87b2bff482ac5c60269d839ceaa6887a79eed9ef0eeac9d0195c882a"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::enter (cognitive 44): fn::enter has cognitive complexity 44 (threshold 15). Drivers by points: boolean chains 22, if/else 11 (17 pts), ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/convertShapeToPath.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d167dab6f95c221a7096875a5fc2f4b8c8a1d62cd09b9a0c7d79f0d16b5517"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::enter (cognitive 44): fn::enter has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (34 pts), boolean chains 8, loops 1, other 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/mergePaths.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b6f270c6f52cfac4c43d25551c6349c89eb1d696d6b010b560ad38bf18fa23"}},{"ruleId":"D2","level":"warning","message":{"text":"convertShapeToPath.fn (cognitive 41): convertShapeToPath.fn has cognitive complexity 41 (threshold 15). Drivers by points: boolean chains 19, if/else 11 (17 pts), ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 9). None of this is in the body itself: all 41 points belong to one function literal inside it that branches (line 31). 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":"plugins/convertShapeToPath.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"83120d33562e91aab3351d84ae7954f5260f0c766680eeda042d6ca36c3a2ea8"}},{"ruleId":"D2","level":"warning","message":{"text":"_path.convertRelativeToAbsolute (cognitive 40): _path.convertRelativeToAbsolute has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (38 pts), boolean chains 1, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_path.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c7e6d76646def83323e45af891689f63327b8201dff74930b146b5e0867c55"}},{"ruleId":"D2","level":"warning","message":{"text":"path.readNumber (cognitive 39): path.readNumber has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (31 pts), boolean chains 7, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/path.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd70dfbee473591f925b72c209bc5b7240a7350559ed76190f1eca95b8f12a9"}},{"ruleId":"D2","level":"warning","message":{"text":"cleanupEnableBackground.fn (cognitive 39): cleanupEnableBackground.fn has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (31 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 15). None of this is in the body itself: all 39 points belong to 3 function literals inside it that branch (lines 39, 54, 29). 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":"plugins/cleanupEnableBackground.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ddcd59dce5d94e36448d63b143663cdf3a8d5c27382075445c9a7752348061"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::exit (cognitive 39): fn::exit has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 14, loops 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/collapseGroups.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e9aa45543cc0e8f6b84b2d4020e740aa930ac50211aad7d0aa928dde29214a"}},{"ruleId":"D2","level":"warning","message":{"text":"removeXlink.fn (cognitive 38): removeXlink.fn has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 5, loops 5 (nesting depth added 15). None of this is in the body itself: all 38 points belong to 3 function literals inside it that branch (lines 94, 197, 141). 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":"plugins/removeXlink.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1144b1f3ad730edc53eb657430e42209b03770e924f9efd5dbd2843d69876f37"}},{"ruleId":"D2","level":"warning","message":{"text":"collapseGroups.fn (cognitive 36): collapseGroups.fn has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 11, loops 2 (5 pts) (nesting depth added 12). None of this is in the body itself: all 36 points belong to one function literal inside it that branches (line 57). 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":"plugins/collapseGroups.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e06f616171917ab9de9c0ca970b14fe8a7330bee7a98e6a89e0e2ab16f4e6f5"}},{"ruleId":"D2","level":"warning","message":{"text":"computeOwnStyle (cognitive 36): computeOwnStyle has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 6, loops 4 (6 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/style.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"201dbe1ceeab6dd1db2a2f6c7574bc315f609987a3c9705d0843f8f2faee0825"}},{"ruleId":"D2","level":"warning","message":{"text":"applyTransforms.applyTransforms (cognitive 34): applyTransforms.applyTransforms has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 9, ternaries 2 (nesting depth added 11). None of this is in the body itself: all 34 points belong to one function literal inside it that branches (line 26). 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":"plugins/applyTransforms.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"40473a84078626ed4cf9e6362f989f51903466803c01306934fd8184fc742b65"}},{"ruleId":"D2","level":"warning","message":{"text":"applyTransforms::enter (cognitive 34): applyTransforms::enter has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 9, ternaries 2 (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":"plugins/applyTransforms.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"955576ae21a9fe34e3295befa8cff2bfe8145b42e912f7955e97d3072bd02553"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::enter (cognitive 34): fn::enter has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/cleanupEnableBackground.js"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10b59fc382039fbdc071acc8e7e653dde6e87af159127eae98e540123e9ab1e"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::exit (cognitive 34): fn::exit has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 5 (15 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/cleanupIds.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc627caa4b5d6d6731c91213aaddc13400c05beccf44607fd0961a3d5d3b6887"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::enter (cognitive 33): fn::enter has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/cleanupIds.js"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc46baa5b877f37cff7afe47894a6652433b4257af48f45d011335558271ae22"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::enter (cognitive 33): fn::enter has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 8, loops 4 (5 pts), error handling 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/prefixIds.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95d5885b6cf4e7b71e39fd85d82c15f0ae15a789311e08dfb97ed94e6a8a2d4"}},{"ruleId":"D2","level":"warning","message":{"text":"removeScripts.fn (cognitive 32): removeScripts.fn has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 7, loops 4 (5 pts) (nesting depth added 10). None of this is in the body itself: all 32 points belong to 2 function literals inside it that branch (lines 77, 127). 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":"plugins/removeScripts.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"626971e7bc80a382363c49263f53706f5bb3c2ef26684a1fb8bda790eadb26dd"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::enter (cognitive 32): fn::enter has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 9, loops 3 (4 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/convertOneStopGradients.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0119c0a0c674f549d35366a19968c3c31a64ceaddca2e172c0cf661842a091a1"}},{"ruleId":"D2","level":"warning","message":{"text":"minifyStyles.fn (cognitive 31): minifyStyles.fn has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 9). Most of this is not in the body itself: 2 of the 31 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 103, 77). 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":"plugins/minifyStyles.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b150c0ca30ef5750d6a169d6b5c4000ec20da92388121f7ffea95ce631323a"}},{"ruleId":"D2","level":"warning","message":{"text":"convertPathData.fn (cognitive 30): convertPathData.fn has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 11, ternaries 1 (2 pts) (nesting depth added 9). Most of this is not in the body itself: 1 of the 30 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 135, 165, 184). 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":"plugins/convertPathData.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4073adf4a8ef791f616930a34090365dc9a712f2721b44d084844037a86af36"}},{"ruleId":"D2","level":"warning","message":{"text":"a2c (cognitive 30): a2c has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 5 (11 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_path.js"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a56ca84fdf4d28231d28a5a2a420d771411553361dd9cf585313de3c5c8ef03"}},{"ruleId":"D2","level":"warning","message":{"text":"fn (cognitive 29): fn has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (21 pts), ternaries 2 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 16). None of this is in the body itself: all 29 points belong to 4 function items inside it that branch (enter, a function literal at line 113, a function literal at line 96, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/convertStyleToAttrs.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9b5bb2ac6a7895c7f08583c448e2067fc64a2988243c41c3bc8050b77f8c9f"}},{"ruleId":"D2","level":"warning","message":{"text":"removeEmptyContainers.fn (cognitive 28): removeEmptyContainers.fn has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 4 (9 pts), boolean chains 6 (nesting depth added 9). None of this is in the body itself: all 28 points belong to 3 function literals inside it that branch (lines 54, 38, 96). 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":"plugins/removeEmptyContainers.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99b7ef8979ea21bedfb2184a3875854c3aaa90286218fccf6d98e6b0a2cf9f7"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::enter (cognitive 28): fn::enter has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/removeOffCanvasPaths.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa88293820895fe4d7e56be0308f4f87dec5bc345cd0686c8a34a9b6c02579da"}},{"ruleId":"D2","level":"warning","message":{"text":"sortDefsChildren.fn (cognitive 27): sortDefsChildren.fn has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (20 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 14). None of this is in the body itself: all 27 points belong to 2 function literals inside it that branch (lines 17, 31). 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":"plugins/sortDefsChildren.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bb9145d691b11dcab14045956496b3f942d1319bcd683a4eb66298679422e2"}},{"ruleId":"D2","level":"warning","message":{"text":"removeOffCanvasPaths.fn (cognitive 27): removeOffCanvasPaths.fn has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 11). None of this is in the body itself: all 27 points belong to one function literal inside it that branches (line 33). 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":"plugins/removeOffCanvasPaths.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd0a3c1d8614fdee8b951076d61f5ef728494b8d51f3d3ac7ae0d10e4ca6f7d"}},{"ruleId":"D2","level":"warning","message":{"text":"addAttributesToSVGElement.fn (cognitive 26): addAttributesToSVGElement.fn has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 15). Most of this is not in the body itself: 3 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 65). 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":"plugins/addAttributesToSVGElement.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d0710e07806c9fc707093067ced5bff879795f32f8d8324f381aed38f583c5"}},{"ruleId":"D2","level":"warning","message":{"text":"_transforms.optimize (cognitive 26): _transforms.optimize has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 3 (7 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_transforms.js"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d2c5325021e289cf1e780b4fb5cfcd8e8d25c3857310f792969f7232a26118"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::enter (cognitive 26): fn::enter has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 9, ternaries 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/convertPathData.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d50df56103d64fafa3a1f0c221a4d351a9ffddab824ed7c7644d62bd9660196"}},{"ruleId":"D2","level":"warning","message":{"text":"convertPathData.convertToRelative (cognitive 25): convertPathData.convertToRelative has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 1, loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/convertPathData.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef8500df3fe57700b6fe81009097b1428810682e2f03b9e18906ff8ed8e124f"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::enter (cognitive 24): fn::enter has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 4, boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/removeXlink.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3feae6e4ed884179dcdafa3efa2f562fe55f42f2b8217be53987965569b04d98"}},{"ruleId":"D2","level":"warning","message":{"text":"cleanupNumericValues.fn (cognitive 23): cleanupNumericValues.fn has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 3, loops 1 (nesting depth added 11). None of this is in the body itself: all 23 points belong to 2 function literals inside it that branch (lines 46, 52). 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":"plugins/cleanupNumericValues.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5257ba0acd532dda974bfd8ea4325f53833706676ba4083631446abef3855e"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::enter (cognitive 23): fn::enter has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/addAttributesToSVGElement.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d697e68059161bff4d605ce19c881d8328652676512b34009d3e2e54ac476a9"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::enter (cognitive 23): fn::enter has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/cleanupNumericValues.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fe51d2b4b8b9e00b09a41a73df42ff56ffcaa761263e294f86a06d4255321c"}},{"ruleId":"D2","level":"warning","message":{"text":"cleanupListOfValues.fn::roundValues (cognitive 22): cleanupListOfValues.fn::roundValues has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/cleanupListOfValues.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cc0fcfe109ae5be6ace85a63f7440649cdf9a6b6ff7b44105aa0581ea4bf06"}},{"ruleId":"D2","level":"warning","message":{"text":"removeUnusedNS.fn (cognitive 22): removeUnusedNS.fn has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 10). None of this is in the body itself: all 22 points belong to 2 function literals inside it that branch (lines 18, 46). 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":"plugins/removeUnusedNS.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0074399f6e391e8a946df9368b8cd0a1af5231cd12263927834db9f4848a917e"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::exit (cognitive 21): fn::exit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/minifyStyles.js"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b1398d3ddc53cdd8290ccbfc1d3721aaac45976b2321b87136bb54aaf71ae4"}},{"ruleId":"D2","level":"warning","message":{"text":"removeAttributesBySelector.fn (cognitive 20): removeAttributesBySelector.fn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (8 pts), boolean chains 2, ternaries 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":"plugins/removeAttributesBySelector.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a572b59f98f38faff8c17b8917d0db5aa51b122a9637c7d8d16e6a3209f350"}},{"ruleId":"D2","level":"warning","message":{"text":"removeAttrs.fn (cognitive 20): removeAttrs.fn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (4 pts), boolean chains 3, ternaries 3 (nesting depth added 6). Most of this is not in the body itself: 4 of the 20 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 131, 109, 120). 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":"plugins/removeAttrs.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"120e43da4426a6b9af0de792a0c68f10c09ab39f6a24bed0f71a3b4345c9abf3"}},{"ruleId":"D2","level":"warning","message":{"text":"_path.intersects (cognitive 19): _path.intersects has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 3 (5 pts), boolean chains 3, loops 2 (nesting depth added 5). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 258, supportPoint, a function literal at line 253, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_path.js"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e38e80fb955332b24f4b67521dcf595fa028e7947ccc486580f8a4cf7c21141"}},{"ruleId":"D2","level":"warning","message":{"text":"sortAttrs.fn (cognitive 19): sortAttrs.fn has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 3 (5 pts), boolean chains 1, loops 1 (nesting depth added 6). None of this is in the body itself: all 19 points belong to 3 function items inside it that branch (compareAttrs, getNsPriority, a function literal at line 102). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/sortAttrs.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c770ca4b571aac2e87462585c454d5a4b35170fabb2ce1d08c3b3c0a56e4aa1"}},{"ruleId":"D2","level":"warning","message":{"text":"stringifyPathData (cognitive 19): stringifyPathData has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/path.js"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8d7cc992dbb5c5285c6afc958efced739178f9072aebb13fef97bf05f429a4"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::enter (cognitive 18): fn::enter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/removeUnusedNS.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4027f4b9cf931643c97e737be1bb9f172d21a6a65f3fdee9aec5480b65727e17"}},{"ruleId":"D2","level":"warning","message":{"text":"addClassesToSVGElement.fn (cognitive 17): addClassesToSVGElement.fn has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 2 (6 pts), if/else 3 (5 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 70). 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":"plugins/addClassesToSVGElement.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"401716cd132267af428a30557343fff1deee4b492ece9c309b8c68ba80b0fa54"}},{"ruleId":"D2","level":"warning","message":{"text":"_path.processSimplex (cognitive 17): _path.processSimplex has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (17 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":"plugins/_path.js"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f7a455f3246f117148737e594800d347683b147d8e81e574e0b746e790a61f"}},{"ruleId":"D2","level":"warning","message":{"text":"style.includesAttrSelector (cognitive 17): style.includesAttrSelector has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 8). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 321). 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":"lib/style.js"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f2411984d3a76fb8f758a7523bde9915d74a0566d2ef511725b63fa1b5d765"}},{"ruleId":"D2","level":"warning","message":{"text":"removeEditorsNSData.fn (cognitive 17): removeEditorsNSData.fn has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 35). 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":"plugins/removeEditorsNSData.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbc656de5a02263821cd18de342e73a4562ac2a7a77cba29cf0cf15538ecd0f"}},{"ruleId":"D2","level":"warning","message":{"text":"removeElementsByAttr.fn (cognitive 17): removeElementsByAttr.fn has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 4 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 57). 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":"plugins/removeElementsByAttr.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c788444089913cc871ada83e72f684f4871a69d785a6b338f95bafeb0e6dc858"}},{"ruleId":"D2","level":"warning","message":{"text":"convertTransform.convertToShorts (cognitive 16): convertTransform.convertToShorts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/convertTransform.js"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"94821de7973752408178f1f86d52b024f67b12a118e79f3b670010986c984d94"}},{"ruleId":"D2","level":"warning","message":{"text":"svgo.optimize (cognitive 16): svgo.optimize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/svgo.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ad99d1e5cbec7c32ddc7d7368fa8a7ba27850f98ffca46275e2bf41fc1df2e"}},{"ruleId":"D2","level":"warning","message":{"text":"gatherPoints::addPoint (cognitive 16): gatherPoints::addPoint has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (8 pts), boolean chains 4, if/else 4 (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":"plugins/_path.js"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"785be501318ca4ad2427cfc486532d23617c56ed8f68c1dde22abf4e2c28e9d4"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::enter (cognitive 16): fn::enter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/removeEditorsNSData.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1624a54102a8e9563332d58b7498e216ac0d71e1357ffa3e5c459cda1d28447"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::enter (cognitive 16): fn::enter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/removeScripts.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9778266b37a80a21ac6683a1b22381c49752d11d2a791516c5d07ef2961d9b83"}},{"ruleId":"D2","level":"warning","message":{"text":"fn::exit (cognitive 16): fn::exit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/removeScripts.js"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"878ec70f58f71c6e1b873012a6780e3c44af6c1520d3c17e00056302b5176074"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugins/_collections.js: FileTooLong \u2014 2078 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 67% of them inside a single declaration: elems (419-2074). The bar is 1500 significant lines; this is 578 over it, 1.39\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_collections.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19361791449dfb0f9fde86c53c5f04596d96a9fa616f618c3e03271bb74f88b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: convertPathData.filters: FunctionTooLong \u2014 filters runs 344 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 244 over it, 3.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/convertPathData.js"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"4825c911bebff413be6631eb50ff90372c6c5e8b9da41bf5f9e309669fc3b654"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: removeHiddenElems.fn: FunctionTooLong \u2014 fn runs 201 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/removeHiddenElems.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"70709073b9c83cc4cfde5430dff9a7647b201150f7138988ab86dc339e0108c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: inlineStyles.fn: FunctionTooLong \u2014 fn runs 191 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 91 over it, 1.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/inlineStyles.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e73d97813758ea9bcd67e713e93f1c318512803b5a61e876a7530752469b5d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugins/convertPathData.js: FileTooLong \u2014 773 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 273 over it, 1.55\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":"plugins/convertPathData.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0806249dd20720a00f18ffb97cda875134c586939b4975ffd7afe7cf25f8c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: applyTransforms.applyMatrixToPathData: FunctionTooLong \u2014 applyMatrixToPathData runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/applyTransforms.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c63d926bf29aa0caf2cf40a1dfa9477f6d890c94d98cbb9926ab3fc558aa1e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: _path.gatherPoints: FunctionTooLong \u2014 gatherPoints runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_path.js"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b242fd059bc8c2eca98612dfd604acb7ffc39e258260848923a10f019eacb1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: convertPathData.fn: FunctionTooLong \u2014 fn runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/convertPathData.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"772012e74d315f6157535da5b142dc17a6f94bd4e9ca9d316cd0a453384ec9e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: coa.action: FunctionTooLong \u2014 action runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/svgo/coa.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2bce9013fcd8b20e1df63885edd0343266473a7afe6fd9097649f3ea42e48a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: convertPathData.convertToRelative: FunctionTooLong \u2014 convertToRelative runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/convertPathData.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d6a63774987a9ca261ad0a1d9bab995888160ac8bc95e81f0207d3b84cea67"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 the repository root runs vitest but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060@vitest/coverage-v8\u0060 (or \u0060@vitest/coverage-istanbul\u0060) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: test svgo types: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/types/lib/svgo-node.test-d.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfb2d3a51bb78af8c32466c922161b44243fd60d99f8c7456e87f86ba1cb2fd"}},{"ruleId":"D12","level":"note","message":{"text":"Outdated (npm): commander: commander is pinned at 11.1.0; registry.npmjs.org publishes 15.0.0 as the latest release. Upgrading is a judgement call \u2014 read that package\u0027s changelog for what changed between the two \u2014 but a direct production dependency several releases behind is where security and compatibility debt accumulates silently."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de8eb947d93f873468b253d5c43aca802ad78abe0c05e85656dfbc1b4d03ad4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/removeScripts.js: plugins/removeScripts.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in removeScripts.fn at line 65. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 10:57:23 -07:00\u0027 --until=\u00272026-10-26 10:57:23 -07:00\u0027 --full-history --no-merges -- plugins/removeScripts.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/removeScripts.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e7799e5ef631a8a69040db31b23af3e918e7f4b2431fbd060c83561c8f32ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: test/regression/compare.js: test/regression/compare.js changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is runTests at line 271), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cchore(regression): make screenshots deterministic and stop ignoring files (#2313)\u201D; \u201Cchore: cache regression screenshots (#2267)\u201D; \u201Cchore(regression): migrate comparison workers to Tinypool (#2266)\u201D; \u201Cchore: replace cross-env with regression flag (#2256)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-28..2026-10-26, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-28 10:57:23 -07:00\u0027 --until=\u00272026-10-26 10:57:23 -07:00\u0027 --full-history --no-merges -- test/regression/compare.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/regression/compare.js"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8ce49a5d1e4a4ec077823fc0feed1138ac3ae8ba75f2ff96d7066166a89281"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 4 significant file(s) lose their only recent owner: plugins/removeUnknownsAndDefaults.js, lib/parser.js, plugins/reusePaths.js, plugins/cleanupNumericValues.js. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1c751ec1cfe5ef8b066bc0399f4f78dc4eebebe8ef7c2d695395658599c48e09"}},{"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":"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":"2a89bbcbf5e920d70f43e214ff1b2a982f2eb283ecf0a7875c5401ecafac3846"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63a00451d04dcb6f66f62f980ad3d61ce4111c1903b7b9b647f027587e96acaa"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e366658d8fccb4b5221511d334a88f9364948fea24bf8894333ad23533b07700"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3b94d19cf525997ca39969b84c95972df129c44adb7d1893ab638a1466e16e6"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d789005ef18527e3ab48007088ad1ff71a3a19ddd5f69529317bfd3d95d29a64"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f7e418954a2ea27adbaf392b6e71103d2dfa13d1af5bd600959b5c7c3875b4b8"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53d79a61f983fa046e29c5630fee0621d90e1b70749b759834d66610b0e22464"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0f3a0015ac7b10210e1f3eeba95b706da0b4e1d8894667b40d667d8c9cd5f9d"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a66497d6e3d6efd126adb0a47b6255613261553504bb35760e612272e3acab44"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"26f3e8952997c35ba33d2fd2f97d2fad9d85a853c5c852ece2bbb6a20b1fe66b"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95ce13e791d5976541537bd5897e5c81b20c4ea92bc54c014b6581c3b26b88c2"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"d74aeba34c20ef883320d58ae3a9ebc2ca37676b56ad245f77891a27afcd5d2d"},"properties":{"dependency":{"package":"tinypool","version":"2.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"test/regression/compare.js","line":7}}}},{"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":"523ba84dc3249fe07f4fe67869df9a5033d9faea9f74a6a5ce818cbb8c8aa502"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.9","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":"6b119d517ff16b1edbc441e60662a8065e02e36cc86ecac75b87b22cc76a3fff"},"properties":{"dependency":{"package":"nanoid","version":"3.3.17","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":"0bf997523edcbfd004b0e48079d2d03fc36b5b8058c165442d7b3299bf52fe16"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","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":"7713653c1cd2e524df06e4e81d883565ceb6482ea97f6eea94f00d39b4a4d989"},"properties":{"dependency":{"package":"vite","version":"8.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA 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":"0894c065e4a01760ff59c8f43ddba69f9f1496a578e64e57b4677ed19d7024aa"},"properties":{"dependency":{"package":"@vitest/mocker","version":"4.1.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE 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":"1ccb2b71c39827333962cde8cf6e2fd135c69574713a52a13e810e39974f7b4f"},"properties":{"dependency":{"package":"smol-toml","version":"1.7.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":"ba7c793d0a5a9b5343b3ff4f7bdb6cbe5747496305857198a7f7162b0eeba03e"},"properties":{"dependency":{"package":"vitest","version":"4.1.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"test-or-tooling","file":"lib/parser.test.js","line":1}}}},{"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":"a861b1ab2fd6ac5a0cbbd2d1eaeca38914dcada77f7a5d62bbdd015efb9e974e"},"properties":{"dependency":{"package":"deepmerge","version":"4.3.1","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":"a43e43ed02068a9ff6803259f969b012419dde3e1c98260beec85dac1e857b5f"},"properties":{"dependency":{"package":"serialize-javascript","version":"7.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: CONTRIBUTING.md names Node.js 22, but the repository declares engines \u0060\u003E=16\u0060. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"CONTRIBUTING.md"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe09df08deb1303dbbfb3a87897a46c166913935825a84c8d72a962d801d8cb"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch npm: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060npm\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"da14c5e8fb421b8614b797a2517de829b3c94f3b85263a50e3283dfd26519afe"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"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":"R10","level":"warning","message":{"text":"Duplicated block with local edits (43 matched lines \u00D7 2 locations): plugins/cleanupListOfValues.js:16 \u00B7 plugins/cleanupNumericValues.js:16 \u2014 the two spans are one implementation copied and then locally edited \u2014 238 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":"plugins/cleanupListOfValues.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"148ba1a1eb2e7284e96bff5ffc5cf9dc08b9614d183a91ddc209af54957e7a9c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): plugins/_collections.js:618 \u00B7 plugins/_collections.js:1144 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_collections.js"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9a2211eeaa5b799a16da472a0f5deefe721262de16dca84bd18b9490042fbf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2 locations): plugins/_collections.js:1246 \u00B7 plugins/_collections.js:1512 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_collections.js"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"081c84b632ced0f50b49c01d1ae295840cf1c1c8fe64de5877773c5eb152a392"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): plugins/inlineStyles.js:70 \u00B7 plugins/mergeStyles.js:20 \u2014 the two spans are one implementation copied and then locally edited \u2014 70 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/inlineStyles.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc5d1ce8a82ee5eefa0477002d04a02c73efd15a87d642bc3c9e56bd0309f2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): plugins/_transforms.js:182 \u00B7 plugins/_transforms.js:236 \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":"plugins/_transforms.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"d783b36fd07c3560eacaa6f1cfb56b56bae613eeff31fef5f928da92a161129c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): plugins/removeHiddenElems.js:268 \u00B7 plugins/removeHiddenElems.js:298 \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":"plugins/removeHiddenElems.js"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa398d0d151bd3cfe757a1f86a575d32054fede9222253baa31711665ee2b84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): plugins/applyTransforms.js:230 \u00B7 plugins/applyTransforms.js:318 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/applyTransforms.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ec1df74584cb40753df95d965d5008ec1fc9780b119bcf5a329b1d58127e50"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): plugins/applyTransforms.js:274 \u00B7 plugins/applyTransforms.js:296 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/applyTransforms.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c2699282b9c457d4d3bbb677393fabb750dd3d2e78f02ce492ba1ded5d2cec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): plugins/_transforms.js:226 \u00B7 plugins/_transforms.js:276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_transforms.js"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6fbad2c41b90314e067ea2c9c0b15d753fd7e88c3293515c342320b31ee4b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): plugins/applyTransforms.js:337 \u00B7 plugins/applyTransforms.js:353 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/applyTransforms.js"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cab96b6739ad0137088ac7bcf1375748f80c51626a3a66ee106c283c865fe0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): plugins/convertShapeToPath.js:121 \u00B7 plugins/convertShapeToPath.js:144 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/convertShapeToPath.js"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e75fe90ef07b91fc15e0213a65e322de44bc9892419532dd319bd14e1d4a40d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): plugins/removeEditorsNSData.js:32 \u00B7 plugins/removeUnusedNS.js:15 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 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":"plugins/removeEditorsNSData.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8255075e857b47911ca18bedb3e23971f49c578c707b51e03075ee642be6bc50"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): plugins/removeMetadata.js:3 \u00B7 plugins/removeStyleElement.js:3 \u00B7 plugins/removeTitle.js:3 \u00B7 plugins/removeXMLProcInst.js:3 \u2014 the 4 copies are spread across 4 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/removeMetadata.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37721638f34acd8c250ca169ad424b55885ca4a9f176583add654f0ae7489ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): plugins/_path.js:440 \u00B7 plugins/_path.js:452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_path.js"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9e3944e1b689e3d0765363b3b24be7c8aa19568ae7ca016903a1655195a628"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): plugins/convertPathData.js:296 \u00B7 plugins/convertPathData.js:313 \u00B7 plugins/convertPathData.js:328 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/convertPathData.js"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"e635c6b8b9bada428aa65df9f392c2da25516cb14a64104385ce9b04311926d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): lib/style.js:235 \u00B7 plugins/mergeStyles.js:22 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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":"lib/style.js"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccb5e8caa28948c71f8c617a8b5a22637823883c385be58912ed61ea8509365"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): plugins/_collections.js:733 \u00B7 plugins/_collections.js:894 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_collections.js"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f99eb7a86b6252b75cad06dacd00e1b69610d3c4d69a6498c2c892c97184ca5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): plugins/_path.js:526 \u00B7 plugins/_path.js:559 \u00B7 plugins/_path.js:581 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_path.js"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a151fcbf0806311eff6a426539b360e39c5709c5175522f86aa748fc5a87a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): plugins/applyTransforms.js:253 \u00B7 plugins/applyTransforms.js:278 \u00B7 plugins/applyTransforms.js:300 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/applyTransforms.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd38b78c980cce2c6af6011d3bc82d3c0ec84bcfc255d3ced469b2890cf0cae2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): plugins/cleanupIds.js:180 \u00B7 plugins/removeHiddenElems.js:418 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 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":"plugins/cleanupIds.js"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"9142515bbc4fa016a90726b44097ed527367a97f52914656e5c9632dd9c9e258"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): plugins/convertPathData.js:258 \u00B7 plugins/convertPathData.js:291 \u00B7 plugins/convertPathData.js:308 \u00B7 plugins/convertPathData.js:323 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 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":"plugins/convertPathData.js"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"529008342ab7afb2370c6f1b2d6d7eddc3cf92c5d1d361297bb4b6ed95eb744c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): plugins/convertShapeToPath.js:67 \u00B7 plugins/convertShapeToPath.js:139 \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":"plugins/convertShapeToPath.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6695f5f909eece7fbbeabcfb3d98df50f04a42ad5b5c92dceb9084233814749"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): lib/style.js:32 \u00B7 lib/style.js:118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/style.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d6e0d874e1dbe8bc02c2c4386b8e328b813cd0bc9e405c16e22c1b34e4baeb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): lib/svgo/coa.js:112 \u00B7 lib/svgo/coa.js:180 \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":"lib/svgo/coa.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4324af9424f57dbe4dd2514816def346a797a68c38bce7900c6dd1e75ec826cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6 locations): plugins/_path.js:101 \u00B7 plugins/_path.js:116 \u00B7 plugins/_path.js:129 \u00B7 plugins/_path.js:142 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 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":"plugins/_path.js"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cda625a2dbfcb34d22149443af0541faef5ee1846cea515f2e9a2152911bf23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): plugins/_path.js:114 \u00B7 plugins/_path.js:127 \u00B7 plugins/_path.js:140 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_path.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4965496010715c29c43c19097da906fa78cb3cc3e5701ea2fa6405fa2133d02"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): plugins/_path.js:628 \u00B7 plugins/_path.js:646 \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":"plugins/_path.js"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a4ac5a96ab81642bc59c0bfa51ac16e1f51c19f431ea197d4b41c4b5a63a0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): plugins/addAttributesToSVGElement.js:58 \u00B7 plugins/addClassesToSVGElement.js:61 \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":"plugins/addAttributesToSVGElement.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6439dc5384d974645706cc5f3d039ae6f4d0c6176d34b89a3d57bb40b72fdd81"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): plugins/_collections.js:708 \u00B7 plugins/_collections.js:941 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_collections.js"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e148c867c52a5e2b2896de2f5f77b8dff8db2a99b0990f88af757e25a087e67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): plugins/_collections.js:822 \u00B7 plugins/_collections.js:830 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_collections.js"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"e244ae3ed3d722c12d62c1edcb94e56ead2bf4e02f3b56d58ed5434ff2aa276d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): plugins/_path.js:69 \u00B7 plugins/_path.js:100 \u00B7 plugins/_path.js:152 \u00B7 plugins/_path.js:163 \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":"plugins/_path.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"395868913a253a678609eecade4c2768cbece62a250620f62513547925984c7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): plugins/applyTransforms.js:192 \u00B7 plugins/applyTransforms.js:232 \u00B7 plugins/applyTransforms.js:320 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/applyTransforms.js"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ab82a140343ecbb5f9639e979691d0ff6be520560a4a4e3a2504a1f4863c05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): plugins/convertPathData.js:785 \u00B7 plugins/convertPathData.js:795 \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":"plugins/convertPathData.js"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"f169c2d221517e00af99e2fbbd9de25f06b954bb3fa7fb77e42395fa629e7f0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): plugins/removeXlink.js:118 \u00B7 plugins/removeXlink.js:184 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"plugins/removeXlink.js"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea1d4e6deb77fe23d8023c752381eca9154d50e53f3bd4e6110331f47eacb23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): plugins/convertShapeToPath.js:112 \u00B7 plugins/convertShapeToPath.js:134 \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":"plugins/convertShapeToPath.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf25c8311e0a644c12b8803269e93837160034759a96f8a4bbd60e3b6e60c38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): plugins/_collections.js:1323 \u00B7 plugins/_collections.js:2067 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_collections.js"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"d898560f727f60c89d53c52afe6dba4122e59bb9d40d5f39e30a9a20fd039fee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 156, cognitive 250): (anonymous) has cyclomatic complexity 156 and cognitive complexity 250; 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":"plugins/convertPathData.js"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b865a787af368ff8b580b36f838da84df9bbe9013e07ff6c606711c6be410a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enter (cyclomatic 68, cognitive 53): enter has cyclomatic complexity 68 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/removeHiddenElems.js"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5a721b56189ba0e2ae274adcfb4a5912729e4c1fb7a8422cbcd42a7f87c714"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function action (cyclomatic 52, cognitive 65): action has cyclomatic complexity 52 and cognitive complexity 65; 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":"lib/svgo/coa.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ef3f6561cd80bff0a29f50e914f5c66421a5d56673d09ca1b30b6657ec8bc5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enter (cyclomatic 43, cognitive 57): enter has cyclomatic complexity 43 and cognitive complexity 57; 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":"plugins/removeUselessStrokeAndFill.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"753083014384bda0dc7651a96773edfb4f0bc55cffc96df1c1a16d6bff5578bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enter (cyclomatic 36, cognitive 52): enter has cyclomatic complexity 36 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/removeUnknownsAndDefaults.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed388aa034c221454854077d856e48f6ec9f7ef5b33080972a9965a794312cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enter (cyclomatic 36, cognitive 44): enter has cyclomatic complexity 36 and cognitive complexity 44; 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":"plugins/convertShapeToPath.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b281eb9001febab6fd3bc4808e03975b244e9ea2d62562cba1849cbfde8b8396"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enter (cyclomatic 35, cognitive 44): enter has cyclomatic complexity 35 and cognitive complexity 44; 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":"plugins/mergePaths.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95c1f30c9c22a7b179daa2c151d03bd5cb4e78da125f9bd392b1312e7676359"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exit (cyclomatic 34, cognitive 62): exit has cyclomatic complexity 34 and cognitive complexity 62; 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":"plugins/inlineStyles.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c8dd1ca724e434f58526536328789dfaa463ad4fb4f150e38d22e64cbb8939"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePathData (cyclomatic 31, cognitive 62): parsePathData has cyclomatic complexity 31 and cognitive complexity 62; 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":"lib/path.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"398e1f7862b59603030e8b68336e96626bf0bf42764336ace4503be38aa68718"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gatherPoints (cyclomatic 30, cognitive 52): gatherPoints has cyclomatic complexity 30 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_path.js"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88bc30ec42dddd215fd0e57020fedb9d124100d4359889792fb499429f59fc2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exit (cyclomatic 29, cognitive 39): exit has cyclomatic complexity 29 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/collapseGroups.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6143972541174326fab4ce9939bc576bf08995e1e031ff3d6baf637f1b7be4cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyMatrixToPathData (cyclomatic 26, cognitive 54): applyMatrixToPathData has cyclomatic complexity 26 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/applyTransforms.js"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"11caa550f7c677f2fdc1b1996df0f735619620fd8b9fb3f65c1d785aeb61e02b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readNumber (cyclomatic 25, cognitive 39): readNumber has cyclomatic complexity 25 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/path.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b2b9f16f112af8b87070b1654ba0b1f5753a5ab429fd10f1f4713a17b421a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enter (cyclomatic 25, cognitive 34): enter has cyclomatic complexity 25 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/applyTransforms.js"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e284f60584c43e3b8f2633119bbaa062e78c23a7be16840ef2914824a4ff1aa0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enter (cyclomatic 25, cognitive 32): enter has cyclomatic complexity 25 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/convertOneStopGradients.js"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a651a8b10e17f44640c00bd4d3c10332af6f0cf228fc054509976010bf4985"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exit (cyclomatic 24, cognitive 87): exit has cyclomatic complexity 24 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/reusePaths.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9892489655d6662a0fa019560590ca9062cddb63b5ad6b8ed67a042954a8f316"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 15): (anonymous) has cyclomatic complexity 24 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/convertPathData.js"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cd030baffa5cf0712d88c1427263e74d4a20d3df7a03fe011ed8c38d1be995"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enter (cyclomatic 23, cognitive 55): enter has cyclomatic complexity 23 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/convertColors.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd2ae06b1a46e988d98df009a262cd37a3ac98dbd3b69b8725a07d4eb5e9fa8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enter (cyclomatic 23, cognitive 33): enter has cyclomatic complexity 23 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/prefixIds.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b721809858c5f87fedb2852abfe36d8a7a2b78ec71608a2a3cbf18c1cd58d25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function optimize (cyclomatic 23, cognitive 26): optimize has cyclomatic complexity 23 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_transforms.js"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e102ffd549a54aad6497a922454003c2bf1bfae4293ef3169a6d76476690f5"}},{"ruleId":"R3","level":"warning","message":{"text":"plugins/_collections.js: 2440 lines of code: plugins/_collections.js has 2440 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_collections.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcba93dacd28864fc15dda4606a35244e1c419e6ebbbb9c2ee277d9b2ceb5359"}},{"ruleId":"R3","level":"warning","message":{"text":"plugins/convertPathData.js: 1265 lines of code: plugins/convertPathData.js has 1265 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/convertPathData.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb31134a45410b076f3661f8270b489e9e412c7b508c50ba969bf914e70663d"}},{"ruleId":"R3","level":"warning","message":{"text":"plugins/_path.js: 769 lines of code: plugins/_path.js has 769 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_path.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3486aefc0a4ebda1ae2a24f85373b7fd59072c806f2ab8ae495994a9db0066aa"}},{"ruleId":"R3","level":"warning","message":{"text":"plugins/_transforms.js: 687 lines of code: plugins/_transforms.js has 687 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_transforms.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca70cb1a18a54e20581079a6d16571c35cc2bc56601c73d5f821c55b0deda96c"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/svgo/coa.js: 507 lines of code: lib/svgo/coa.js has 507 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/svgo/coa.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8ad0c44add2f472324b9346b391e3b3d37f3617eefc3363e3c96ae99dae78f"}},{"ruleId":"R3","level":"warning","message":{"text":"plugins/removeHiddenElems.js: 424 lines of code: plugins/removeHiddenElems.js has 424 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/removeHiddenElems.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29610aa0504f9a518d9c12a7f4b0f7505f04ef5464ad3fff9117811e8863722f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sync-version.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4f3144396ccd95a4fa60f1ad5a8c48acb9f56e2fc03d227e2f9f6c5b557d75"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~360 LoC): no import path from any entry point (16 application, 12 tooling, 40 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":"lib/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"322022d0f6a0eacb798aab2bfe630b0d174b03b73dcfdcd6e43b6870fdaed55b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(node.name === \u0027style\u0027 \u0026\u0026 node.children.length !== 0) || hasScripts(node)\u0060 appears character-identically in 2 files \u2014 plugins/cleanupIds.js, plugins/removeHiddenElems.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":"plugins/cleanupIds.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee1cb291c36ac7bd72bdaa2d228372031ab977ec9f5d3ab5ba931317626b0fe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060child.type === \u0027text\u0027 || child.type === \u0027cdata\u0027\u0060 appears character-identically in 2 files \u2014 lib/style.js, plugins/inlineStyles.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":"lib/style.js"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6261e47017ba117e99fbaf1198e62287f81bcb2a9e3847042a52ff5b5f4c3a3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.attributes.type != null \u0026\u0026 node.attributes.type !== \u0027\u0027 \u0026\u0026 node.attributes.type !== \u0027text/css\u0027\u0060 appears character-identically in 2 files \u2014 plugins/inlineStyles.js, plugins/mergeStyles.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":"plugins/inlineStyles.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"662bbb6a3e28f90009a0de06bcc2bb5637081f85ee80fa3faaf07bc49a3a4ba9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.name === \u0027svg\u0027 \u0026\u0026 parentNode.type === \u0027root\u0027\u0060 appears character-identically in 5 files \u2014 plugins/addAttributesToSVGElement.js, plugins/addClassesToSVGElement.js, plugins/removeOffCanvasPaths.js, plugins/removeUnusedNS.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":"plugins/addAttributesToSVGElement.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6323a68962c8734ea3dd1169f68055a081d45e5bd5ae0b7c7ec4ed989f168c38"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060referencesProps.has(name) \u0026\u0026 includesUrlReference(value)\u0060 appears character-identically in 2 files \u2014 plugins/applyTransforms.js, plugins/moveGroupAttrsToElems.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":"plugins/applyTransforms.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"938389ac5a41b4572b483606c852e14ee80fc609b5f2d44b85aa1cbb1d1fec5e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/inlineStyles.js"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d6ef6270fe47375591453073af7444d6c00b4298752f272bf86f291996a910"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/inlineStyles.js"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e76713bd02fafd0eccd5c6158f68b787b3008c666d0ac03fbb94f538d35cbee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/prefixIds.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7112a1d6e5448470c5bdf7501d72c5ad562726fb870169b8f17fd8ce6c7ee479"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"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":24,"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."]}]}