{"$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":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"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":"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":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"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":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"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":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"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":"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":"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":"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":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"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":"usvg::writer::write_span (cyclomatic 57): usvg::writer::write_span has cyclomatic complexity 57 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: crates/usvg/src/writer.rs holds 3 of the 21 functions over the threshold \u2014 including the worst \u2014 and 85 of the 197 points over it (43%), 3.9\u00D7 the next-largest file (crates/usvg/src/parser/svgtree/parse.rs at 22). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/writer.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea0fe0091789738240a67490afda81a94cffe678f3fcba25a688a084f7747c5"}},{"ruleId":"D1","level":"warning","message":{"text":"usvg::writer::write_filters (cyclomatic 44): usvg::writer::write_filters has cyclomatic complexity 44 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: crates/usvg/src/writer.rs holds 3 of the 21 functions over the threshold \u2014 including the worst \u2014 and 85 of the 197 points over it (43%), 3.9\u00D7 the next-largest file (crates/usvg/src/parser/svgtree/parse.rs at 22). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/writer.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32100a20eafb411c8bc0a03cca83875740e00f2fe00294bcb798e8c2fabe490"}},{"ruleId":"D1","level":"warning","message":{"text":"usvg::parser::svgtree::text::trim_text_nodes (cyclomatic 35): usvg::parser::svgtree::text::trim_text_nodes 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":"crates/usvg/src/parser/svgtree/text.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"6812d4aa7d5bafaacb352261e11a88fcaba4a468e5959ad4845cd12f0fa1a321"}},{"ruleId":"D1","level":"warning","message":{"text":"resvg::filter::apply_inner (cyclomatic 29): resvg::filter::apply_inner 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":"crates/resvg/src/filter/mod.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"41592b82cfe8a976292955225852519e0cde7306d62c1c658da6fd0604639df1"}},{"ruleId":"D1","level":"warning","message":{"text":"usvg::writer::write_element (cyclomatic 29): usvg::writer::write_element has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: crates/usvg/src/writer.rs holds 3 of the 21 functions over the threshold \u2014 including the worst \u2014 and 85 of the 197 points over it (43%), 3.9\u00D7 the next-largest file (crates/usvg/src/parser/svgtree/parse.rs at 22). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/writer.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"a592d531df5c9e7610fe48aac7a0e13618770ff74455282bfb73431fcb292534"}},{"ruleId":"D1","level":"warning","message":{"text":"usvg::text::layout::layout_text (cyclomatic 26): usvg::text::layout::layout_text 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":"crates/usvg/src/text/layout.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"df11ad239fbc92b27f948edaf900c342954c755d5d1fc76a13828668b7af937d"}},{"ruleId":"D1","level":"warning","message":{"text":"usvg::parser::svgtree::parse::parse_svg_element (cyclomatic 25): usvg::parser::svgtree::parse::parse_svg_element 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":"crates/usvg/src/parser/svgtree/parse.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7dcdb9fcf0eccb5a17af818087d1e0421f345251f5fab1209a8fd42d530b96"}},{"ruleId":"D1","level":"warning","message":{"text":"usvg::parser::svgtree::parse::resolve_inherit (cyclomatic 25): usvg::parser::svgtree::parse::resolve_inherit has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/svgtree/parse.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"849653e2f229856ae0f1bf0bb002067e396e75e4c61b6219e52313f136585525"}},{"ruleId":"D1","level":"warning","message":{"text":"resvg::parse_args (cyclomatic 24): resvg::parse_args has cyclomatic complexity 24 (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":"crates/resvg/src/main.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c6c0c49f8915dce9b08e131d5a35a1649be687faad7658d7d72202d692b2f0"}},{"ruleId":"D1","level":"warning","message":{"text":"usvg::parser::filter::collect_children (cyclomatic 23): usvg::parser::filter::collect_children has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/filter.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db680e5e6f080059a284559efe88efcd868be444dcae1ffd45b933a276cb27a"}},{"ruleId":"D1","level":"warning","message":{"text":"usvg::parser::text::collect_text_chunks_impl (cyclomatic 22): usvg::parser::text::collect_text_chunks_impl 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":"crates/usvg/src/parser/text.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f02e18b2e15635793254b2b96d173fbde305d4bf33c7a780aa9c4f773d6634"}},{"ruleId":"D1","level":"warning","message":{"text":"usvg::parser::filter::convert (cyclomatic 21): usvg::parser::filter::convert has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/filter.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a59be912916c0ca932fc4ec96b2b73554d48c0b203ad85465677bd62e0c60b"}},{"ruleId":"D1","level":"warning","message":{"text":"Document::fmt (cyclomatic 18): Document::fmt has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (print_children). 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":"crates/usvg/src/parser/svgtree/mod.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd0112da652261075993068775da3ebba80909be280b481a779a875b2fa2b78"}},{"ruleId":"D1","level":"warning","message":{"text":"usvg::parser::text::convert_font (cyclomatic 18): usvg::parser::text::convert_font has cyclomatic complexity 18 (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":"crates/usvg/src/parser/text.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"2881ae6bc76ec12c30b0dcef063fa0483d90f2a250382ec17b989b7e860eb8bf"}},{"ruleId":"D1","level":"warning","message":{"text":"usvg::parser::converter::convert_group (cyclomatic 17): usvg::parser::converter::convert_group 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":"crates/usvg/src/parser/converter.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"853e4ec3d0e26ab9564801640027d602f4b5fc552960e85d472459c58d405b89"}},{"ruleId":"D1","level":"warning","message":{"text":"usvg::parser::mask::convert (cyclomatic 17): usvg::parser::mask::convert has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/mask.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26f667dc6f003146cadf5423672dcc5a44a127981ba8ab967ee3707d97326ca"}},{"ruleId":"D1","level":"warning","message":{"text":"usvg::parser::svgtree::parse::push_references (cyclomatic 17): usvg::parser::svgtree::parse::push_references 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":"crates/usvg/src/parser/svgtree/parse.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"41004d4a7ae5aa56ef729df4e0ca964ff819a950013147dabc8e0fcf1b0c3e14"}},{"ruleId":"D1","level":"warning","message":{"text":"usvg::parser::text::resolve_font_weight (cyclomatic 17): usvg::parser::text::resolve_font_weight has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/text.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aad55f7a9f077e7867a689718403c29af8fdd602928d7537fd918a99aac76ae"}},{"ruleId":"D1","level":"warning","message":{"text":"usvg::process (cyclomatic 16): usvg::process has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/main.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"009b5df816f34f25f0da23fbd2b391cb1270a064e0274f8e421f92cff7fb26ef"}},{"ruleId":"D1","level":"warning","message":{"text":"usvg::parser::paint_server::convert_stops (cyclomatic 16): usvg::parser::paint_server::convert_stops has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/paint_server.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aab2145fd054dc5f102d5b3125bbb0ceafc7fb54640d440ea1cbc6a8a043f11"}},{"ruleId":"D1","level":"warning","message":{"text":"usvg::parser::style::convert_paint (cyclomatic 16): usvg::parser::style::convert_paint has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/style.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fe019886684f8e1aad0dabbd4f0ea10c22c6baa296dc1278ab8dcdd5d4f583"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::svgtree::text::trim_text_nodes (cognitive 112): usvg::parser::svgtree::text::trim_text_nodes has cognitive complexity 112 (threshold 15). Drivers by points: if/else 28 (100 pts), boolean chains 6, match/switch 1 (4 pts), loops 1 (2 pts) (nesting depth added 76). 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":"crates/usvg/src/parser/svgtree/text.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d50f062fb8179672e17f41e98e9404c2ce81c39493840873ce64466253ea99"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::text::layout::layout_text (cognitive 66): usvg::text::layout::layout_text has cognitive complexity 66 (threshold 15). Drivers by points: if/else 16 (49 pts), match/switch 5 (11 pts), loops 4 (6 pts) (nesting depth added 41). 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":"crates/usvg/src/text/layout.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df75c23a043f3eee4f0d01271bcb350453eb6c2f01a6f347132327716cf3049"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::writer::write_filters (cognitive 65): usvg::writer::write_filters has cognitive complexity 65 (threshold 15). Drivers by points: match/switch 8 (31 pts), if/else 7 (25 pts), loops 4 (9 pts) (nesting depth added 46). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/writer.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab191e6dbd56e280918c50dbff7ea1703768908a57286238ad13ba1cbee7c12"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::writer::write_element (cognitive 64): usvg::writer::write_element has cognitive complexity 64 (threshold 15). Drivers by points: if/else 12 (34 pts), loops 4 (17 pts), match/switch 5 (13 pts) (nesting depth added 43). 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":"crates/usvg/src/writer.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24b377cd296d51333dd051c988e87271f32cd0b175d69bbac1d59f69e0ba08c"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::text::collect_text_chunks_impl (cognitive 54): usvg::parser::text::collect_text_chunks_impl has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (42 pts), match/switch 3 (8 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/text.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d27c2aa2694b727d1797b8b3665150c554cd8e4044aba2800039a170adbd73"}},{"ruleId":"D2","level":"warning","message":{"text":"Document::fmt::print_children (cognitive 47): Document::fmt::print_children has cognitive complexity 47 (threshold 15). Drivers by points: loops 11 (38 pts), if/else 4 (9 pts) (nesting depth added 32). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/svgtree/mod.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44e39a7bd16d55c09299b76a38738dcfd56091f7a59c858b0792ad97ac99b7e"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::svgtree::parse::parse_svg_element (cognitive 44): usvg::parser::svgtree::parse::parse_svg_element has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (29 pts), match/switch 3 (6 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/svgtree/parse.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8b4f00267f1c93bcac17fb3ec0249ae70f33c12c9b60073feb871c4d6ff3e1"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::svgtree::parse::push_references (cognitive 42): usvg::parser::svgtree::parse::push_references has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (36 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 26). 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":"crates/usvg/src/parser/svgtree/parse.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f4e2b73e3b66ab2a42d287395e1e48e743df7691397a74f3f5db6b05217159"}},{"ruleId":"D2","level":"warning","message":{"text":"resvg::filter::convolve_matrix::apply (cognitive 38): resvg::filter::convolve_matrix::apply has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 5 (16 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/convolve_matrix.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1a49bd8363b5583e6c7266afac16efe9445d04bdb926195def98a50f6e3e90"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::text::resolve_positions_list (cognitive 35): usvg::parser::text::resolve_positions_list has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 5 (17 pts) (nesting depth added 23). 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":"crates/usvg/src/parser/text.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa2556c12d9c2fc5ce48006afcfdb6e57b4d56abc015df36afb5379c237c3a8"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::writer::has_xlink (cognitive 34): usvg::writer::has_xlink has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (28 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 23). 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":"crates/usvg/src/writer.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"432fe414ac649583169649683f4b7943f069d469ab40aeab7eafb75d6c0811c5"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::text::layout::process_chunk (cognitive 33): usvg::text::layout::process_chunk has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 5 (12 pts), match/switch 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/layout.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"71465ae17a23cf671b6c268c077b91c99bb1214280029b9ee85917fde219d32b"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::text::layout::apply_length_adjust (cognitive 32): usvg::text::layout::apply_length_adjust has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 5 (11 pts), match/switch 1 (2 pts) (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":"crates/usvg/src/text/layout.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e89b25ebc4d103971398afb85dfd54a68843e170091e99c614912716376df7b"}},{"ruleId":"D2","level":"warning","message":{"text":"resvg::filter::iir_blur::gaussianiir2d (cognitive 30): resvg::filter::iir_blur::gaussianiir2d has cognitive complexity 30 (threshold 15). Drivers by points: loops 8 (26 pts), if/else 4 (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/iir_blur.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"174d1182dbe4c2db3aca33a3d20ea4c413f66f28cb20003003474f2577ef60e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Paint::to_user_coordinates (cognitive 30): Paint::to_user_coordinates has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 2, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/paint_server.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82fab354fee69b87e31938182e52a4e12d1b99a65124d672b50fb27f128e6f3"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::use_node::convert (cognitive 30): usvg::parser::use_node::convert has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 1, match/switch 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":"crates/usvg/src/parser/use_node.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b333f78dba80a149fbac28cc546b58688f8334087603ec8aadcf9a544af7b7"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::writer::write_span (cognitive 30): usvg::writer::write_span has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (16 pts), match/switch 7 (12 pts), loops 2 (nesting depth added 7). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/writer.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bc65e0af1fe2ef37efbd2a675b099fb50dfa8c2523638c5a985828f56703aa"}},{"ruleId":"D2","level":"warning","message":{"text":"resvg::parse_args (cognitive 29): resvg::parse_args has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (21 pts), boolean chains 5, match/switch 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/main.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"5102ebf695c89993f17011d4e13c6bb6126b7c2c94986a3f4eddb9102c9b2d0a"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::text::layout::shape_text (cognitive 29): usvg::text::layout::shape_text has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 4 (7 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/layout.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff61d8839ebf1760bef2a6b425839acfebe20ee72732906605c61a1afa2f0b2"}},{"ruleId":"D2","level":"warning","message":{"text":"resvg::filter::apply_inner (cognitive 28): resvg::filter::apply_inner has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/mod.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6e5702792fcd756438b87a6800a000640944063d3b0c450552375c6d34a2bc"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::converter::convert_group (cognitive 27): usvg::parser::converter::convert_group has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/converter.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6e46c6a86290f580ea8441552c569aa71536642dd2c5c6ad735a9fc5179bfb"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::text::flatten::flatten (cognitive 25): usvg::text::flatten::flatten has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (4 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":"crates/usvg/src/text/flatten.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0532a088dbc27d99fc29e866b60c27b592bf5d9e54d953fe6fae2518b366d6b8"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::filter::convert (cognitive 24): usvg::parser::filter::convert has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 5 (7 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/filter.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe994675b437e6aba8205267fdf77eab8a1d4b0015bc4219c413a2616d5a32c"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::paint_server::convert_stops (cognitive 24): usvg::parser::paint_server::convert_stops has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (6 pts), boolean chains 3, match/switch 1 (2 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":"crates/usvg/src/parser/paint_server.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54d87c7c74a551f0ba97c52612e0f71810811319f964c655c8c9af7122a0ad6"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::style::convert_paint (cognitive 24): usvg::parser::style::convert_paint has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/style.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da67fa638c06edf1a49f8787a18a1568abda737e6ab628cf33fec7b1de9382f"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::process (cognitive 22): usvg::process has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 5 (6 pts), loops 3 (4 pts) (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":"crates/usvg/src/main.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afd045670325b05730b44bed21e647f2e8bfb88f9cffd795ca384d585a2a98c"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::mask::convert (cognitive 22): usvg::parser::mask::convert has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/mask.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e895444818763787a36c4e28e652d478f19aaf1f540528810a707b875253be2d"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::svgtree::text::parse_svg_text_element_impl (cognitive 22): usvg::parser::svgtree::text::parse_svg_text_element_impl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (2 pts), boolean chains 1, 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":"crates/usvg/src/parser/svgtree/text.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd28bcb03923f456caa4f8d1efc682ce46fd0f92eaa0f40c0b3d34fa127b864"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::text::parse_font_variation_settings (cognitive 22): usvg::parser::text::parse_font_variation_settings has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (7 pts), match/switch 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":"crates/usvg/src/parser/text.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5728bcfa4679ee8085384f9214e1506575078894354559d4755040a7ebb7da"}},{"ruleId":"D2","level":"warning","message":{"text":"resvg::render_svg (cognitive 21): resvg::render_svg has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 1 (2 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":"crates/resvg/src/main.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ae379b4cbdec8f0c0afdfc768f3aebaed3a00b33fd33f9855ac82238da123a"}},{"ruleId":"D2","level":"warning","message":{"text":"Group::collect_clip_paths (cognitive 21): Group::collect_clip_paths has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (Group::collect_masks) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/tree/mod.rs"},"region":{"startLine":1849}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd13971104a96e8483a1b59e175bebf0bdc19050f59a52ce9d96a60a95cf132"}},{"ruleId":"D2","level":"warning","message":{"text":"Group::collect_masks (cognitive 21): Group::collect_masks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (Group::collect_clip_paths) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/tree/mod.rs"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"05552f147ca63c031870ff2b79a39ccc01d5937cdddfd9e57557c1eec6940bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"resvg::filter::box_blur::box_blur_vert (cognitive 20): resvg::filter::box_blur::box_blur_vert has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 5 (9 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (resvg::filter::box_blur::box_blur_horz) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/box_blur.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"310b04da18c54c20d8385348969ca239f90325d0dbb5229c58effdb658065068"}},{"ruleId":"D2","level":"warning","message":{"text":"resvg::filter::box_blur::box_blur_horz (cognitive 20): resvg::filter::box_blur::box_blur_horz has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 5 (9 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (resvg::filter::box_blur::box_blur_vert) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/box_blur.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7e313d5d98f3f70fd174614e438dd42b6e79d5e4ecd523798b9808573a553f"}},{"ruleId":"D2","level":"warning","message":{"text":"resvg::filter::turbulence::turbulence (cognitive 20): resvg::filter::turbulence::turbulence has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/turbulence.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6a7a8a65507a1f3d0f8b99db37b51b43c33d2c6847aea0b2484dc914cb6f39"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::paint_server::node_to_user_coordinates (cognitive 20): usvg::parser::paint_server::node_to_user_coordinates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/paint_server.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c8136ea9e95ab265bf2c67ab11c65038c80d8cfa39e7eab95ba765ef9476bb"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::writer::has_text_paths (cognitive 19): usvg::writer::has_text_paths has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/writer.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"817579dbfbbe1ad0302453745b7ec1056130aa7b1b4f4168384e35d78587556f"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::converter::resolve_svg_size (cognitive 18): usvg::parser::converter::resolve_svg_size has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, match/switch 1 (2 pts) (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":"crates/usvg/src/parser/converter.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"5838b9fa09120608ce167d202cb2a27d2f8bd4c82bdc55176516fef325bbbbd3"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::filter::convert_color_matrix_kind (cognitive 18): usvg::parser::filter::convert_color_matrix_kind has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/filter.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4621b57bf722bd87c489f85b6fb30faa12b4f4251bcd120eac530a899a55375"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::filter::convert_morphology (cognitive 17): usvg::parser::filter::convert_morphology has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, match/switch 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":"crates/usvg/src/parser/filter.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"329f183c25c9d06945a91a1123c2bcc6e27055a4c08e03ed3e5e5665a9117bac"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::marker::calc_vertex_angles (cognitive 17): usvg::parser::marker::calc_vertex_angles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (5 pts), match/switch 1 (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":"crates/usvg/src/parser/marker.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"e513b7c82031e7d028d4bdc66caf86ea7dc57af6fcd9ebd018e06a8bdf860a22"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::svgtree::parse::write_declaration (cognitive 17): usvg::parser::svgtree::parse::write_declaration has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/svgtree/parse.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5996c0da2b7034202c65b16235de87db084ae0b36cce59c4c1dba656c0a0c0"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::text::resolve_rotate_list (cognitive 17): usvg::parser::text::resolve_rotate_list has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/text.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7e530965eeffbd3cd1066c34638bb95da0fd1df9c7f8afe63f2ad420cc6cd3"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::text::layout::collect_normals (cognitive 17): usvg::text::layout::collect_normals has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/layout.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"353944c550fc3ad6333bc01b49ac903955b3eaaf6dc5c797049c09d9e8976e92"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::filter::convert_image_inner (cognitive 16): usvg::parser::filter::convert_image_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 1 (5 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/filter.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"6befda2a94269484f7e53c6739cb7a1416c6bbebf586059973e1656a1aef5fb0"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::parser::svgtree::parse::references (cognitive 16): usvg::parser::svgtree::parse::references has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/svgtree/parse.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a345cd5c030ba177d71e7e99ff9f459d8af54445dfcc4b70461b2a6487fa0a"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::text::layout::shape_text_with_font (cognitive 16): usvg::text::layout::shape_text_with_font has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/layout.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"af19de7079fa4ff90799dfd361a34abcce6dcfcc5fd58f1ce4285f47c618a5ed"}},{"ruleId":"D2","level":"warning","message":{"text":"usvg::writer::write_group_element (cognitive 16): usvg::writer::write_group_element has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/writer.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3c2ebdd80f85dc7444c63c4f4c51220e4362664065a7e53c420db65700fbfc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: usvg::writer::write_filters: FunctionTooLong \u2014 usvg::writer::write_filters runs 243 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 143 over it, 2.43\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":"crates/usvg/src/writer.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"da63e0b8a05a2a9d1fd7610ac621e8254b8852317ece09f6bf80e3397a74b094"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: text/layout.rs: FileTooLong \u2014 1035 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 535 over it, 2.07\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":"crates/usvg/src/text/layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe1cfa63303dc286ff0bae5dc12cd4bed1bdf4bbb13afd77cc118c2eef0327a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/writer.rs: FileTooLong \u2014 978 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 478 over it, 1.96\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":"crates/usvg/src/writer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74420c21dad20af2222657fda41a6d5925b8188409215497e3f8285db5968005"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tree/mod.rs: FileTooLong \u2014 963 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 463 over it, 1.93\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":"crates/usvg/src/tree/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88db25312ac23c62c0980c08249c5800ea457fe9806854e9609c1fe50a50b7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/filter.rs: FileTooLong \u2014 837 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 42 free functions. The bar is 500 significant lines; this is 337 over it, 1.67\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":"crates/usvg/src/parser/filter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1a3d6e9a34ef3fb7c1423e7caefd679c8d27588cd15460ffff13702a3f61ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: filter/mod.rs: FileTooLong \u2014 752 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 252 over it, 1.50\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":"crates/resvg/src/filter/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84175ec69ba409adfc86c926186af7d24a615d3aa1a6c18455849ba5b1496605"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: svgtree/mod.rs: FileTooLong \u2014 723 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 223 over it, 1.45\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":"crates/usvg/src/parser/svgtree/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2545d2bc9a275e52b0d512ea778082eb492417b66121748f840ef4693412e6a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/paint_server.rs: FileTooLong \u2014 721 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 221 over it, 1.44\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":"crates/usvg/src/parser/paint_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9e99f25711ec53592a3d26947715e665620c4269939a92fd845002f826c164"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/converter.rs: FileTooLong \u2014 654 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 154 over it, 1.31\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":"crates/usvg/src/parser/converter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c950612b6c15519e327f544214f95fcd08d41ecf63a263d81c14c44226cb96"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: resvg_capi: TooManyFunctions \u2014 38 free functions. The bar is 30 free functions; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/c-api/lib.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee2ccf526f67ae36c48ab30a7b515b5dc62859652ee8d0f5c498c368f68f181"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: svgtree/parse.rs: FileTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 120 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/svgtree/parse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3b275fe2ca6fdd769b446e50c3c61a97f7eec65d394f01d582a48e7bac73b1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SvgNode: TooManyMethods \u2014 37 methods, declared across 2 files: svgtree/mod.rs (28), parser/converter.rs (9). The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/svgtree/mod.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"9527cae32c62b063b69237e894d2ed4b699595510790b916022590fda7086324"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 605 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 105 over it, 1.21\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":"crates/resvg/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d108c27cde3fb9574b071c44312485dde81716461f9ee98098f68a9d2a08ff74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: usvg::parser::text::collect_text_chunks_impl: FunctionTooLong \u2014 usvg::parser::text::collect_text_chunks_impl runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\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":"crates/usvg/src/parser/text.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad75b0e7bb7b17ac0162c59463aa42d6aa60c1503e160d384b10588c77d96b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: resvg::filter::apply_inner: FunctionTooLong \u2014 resvg::filter::apply_inner runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\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":"crates/resvg/src/filter/mod.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64e858dd8b245881c4ae1e14bfc57c21d9d597c0b5aa8ba837b55a315c4c1a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/text.rs: FileTooLong \u2014 570 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 70 over it, 1.14\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":"crates/usvg/src/parser/text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c91f443cd3814ec2094d843049deb1c5451c43ba7aa2363580158a54d559fe5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: usvg::text::layout::layout_text: FunctionTooLong \u2014 usvg::text::layout::layout_text runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/layout.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"11eb6538fd297f5182b16bf37f8416c1866ec59c01481c54913490e3e4c22948"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: usvg::writer::write_span: FunctionTooLong \u2014 usvg::writer::write_span runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\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":"crates/usvg/src/writer.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87a3ef8324cd236bc79c7b20e8b4b263bc3e5f29037fb2181248b068a3bbc61"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: usvg::process: FunctionTooLong \u2014 usvg::process runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\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":"crates/usvg/src/main.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a60c26419dc67b440ffa9932192360a30d718a88c03d20b0614b0d2b3d7c1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: usvg::parser::paint_server::node_to_user_coordinates: FunctionTooLong \u2014 usvg::parser::paint_server::node_to_user_coordinates runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/paint_server.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"486ba7e6309c143c32b365ab0ebefd8af68cc833a35d6141775994db43f8ae1a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CliArgs: TooManyFields \u2014 31 stored fields. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/main.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8495668dbdaa2da5b9d9234240489d8a4d7400c67f49d9934e9f68c17fd5805"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (78 shared lines): crates/resvg/src/filter/box_blur.rs:85-199 | crates/resvg/src/filter/box_blur.rs:202-320 \u2014 These two members are variants of one another: 78 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/box_blur.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb269255a6519cdcf4dc10029a19c8778f798ea47525c0ca33dabafc4bf7caaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/usvg/src/parser/filter.rs:1041-1068 | crates/usvg/src/parser/filter.rs:1071-1098 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/filter.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"877f8cdd7ead17c7974fea2a9677634d50ee1f3eb709fd98e8c7c547f243892b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/resvg/src/path.rs:32-75 | crates/resvg/src/path.rs:83-116 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/path.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e4792101fb1b143c69d99f292a8094fbaf1fb4bfd9feee0063eb2a1c589e21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/usvg/src/text/colr.rs:172-198 | crates/usvg/src/text/colr.rs:208-241 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/colr.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf7e01bd9c0888f3dac4217d3f1814c3e44c7312eb9911711c5acf4a0efa872"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/c-api/lib.rs:959-978 | crates/resvg/src/main.rs:848-867 | crates/usvg/src/main.rs:493-512 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/c-api/lib.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f349641a270cd6ed6e214a77283fe5abb3eacb3f61a24f8da337db37c34176"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/usvg/src/parser/paint_server.rs:438-469 | crates/usvg/src/parser/paint_server.rs:474-507 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/paint_server.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce41cb45dc5117478ddc9fdbb622b32abc8f2f1da532da84c021c8ad1cbe59c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/usvg/src/tree/mod.rs:1849-1871 | crates/usvg/src/tree/mod.rs:1873-1895 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/tree/mod.rs"},"region":{"startLine":1849}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5bb00fa89b60370d6c34fa3509a57c6037b96d2ba27152f9be738eb34565f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/resvg/src/geom.rs:8-30 | crates/resvg/src/main.rs:812-834 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/geom.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb6ce839e470019d3985bef620fee1d8cba06a461f315b63312cd20a1b4c1f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/resvg/src/filter/lighting.rs:428-442 | crates/resvg/src/filter/lighting.rs:444-458 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/lighting.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"deceb65b4aaa6df1c1964a71eddbc193284c17011a8a8e4575422b2027c84450"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/resvg/src/filter/lighting.rs:396-410 | crates/resvg/src/filter/lighting.rs:412-426 | crates/resvg/src/filter/lighting.rs:460-476 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/lighting.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee5ddee5f1d250c5af114606cb0c80144c806915c86913721c752ea99f083ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/usvg/src/parser/marker.rs:345-357 | crates/usvg/src/parser/marker.rs:359-370 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/marker.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa9869ce33523d38f6f757b4cb0190d6995198596d4ab5a3d206c358df69e93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/resvg/src/filter/lighting.rs:368-380 | crates/resvg/src/filter/lighting.rs:382-394 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/lighting.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd1249b808135172aeac183cbad965607b1876e6b412437771724558b19fbe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/usvg/src/parser/shapes.rs:229-243 | crates/usvg/src/parser/shapes.rs:245-267 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/shapes.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f6bfbe9b83eebbd10f1e8b84b1f6faef962428d580c26b5e7d5e16010641ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/c-api/lib.rs:628-653 | crates/c-api/lib.rs:668-688 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/c-api/lib.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aaee6f293ee131dfc701a5e839e12918e9412675d72486afc64e4e9fb2c0b69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/resvg/src/filter/lighting.rs:340-352 | crates/resvg/src/filter/lighting.rs:354-366 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/lighting.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d0622d6feb82456d2de596b41a54c8125c46fa72cf9f0dd4552ef30f60c3d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/usvg/src/parser/converter.rs:237-260 | crates/usvg/src/parser/svgtree/mod.rs:940-960 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/converter.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4b4852fbab073be0ee5a2a21a732749ee252d38ae933b471cec9795252ecaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/resvg/src/filter/mod.rs:1043-1056 | crates/resvg/src/filter/mod.rs:1064-1077 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/mod.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"be03dea3a1140eb047e6b38f46402e774d0978796e0b138b1959d6e75fc08716"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/usvg/src/parser/filter.rs:1142-1160 | crates/usvg/src/parser/filter.rs:1163-1181 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/filter.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bce37225905e1d13c024f8530c251e23a2b4bc24a47e63d77b51bb83ac527d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/resvg/src/path.rs:121-133 | crates/resvg/src/path.rs:138-152 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/path.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e0df2e06245d82a757daffec1b67a81d1c6e38ff30b54b38bf2afedb785bd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/usvg/src/parser/svgtree/mod.rs:345-354 | crates/usvg/src/parser/svgtree/mod.rs:1141-1149 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/svgtree/mod.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"888d248ae34651bda509a914f4e69b122e5b9a8fbc39e5e8f55432ff5db5d830"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/resvg/src/filter/mod.rs:129-136 | crates/resvg/src/filter/mod.rs:139-146 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/mod.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"972434241230651db8733b9d04f8a9b20ece7e9d3fb7f5b950a85aeb296c6195"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/resvg/src/filter/mod.rs:909-917 | crates/resvg/src/filter/mod.rs:923-931 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/mod.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e710f145d64aff2186f5ec9d9a580300fdd4c84ee3e2fe9fa20d56011908b96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/usvg/src/parser/filter.rs:267-284 | crates/usvg/src/parser/paint_server.rs:268-285 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/filter.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec055717f322c689d95f6499397253a76ed9f409e75e1da3d89792e97e46f88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/usvg/src/parser/paint_server.rs:512-529 | crates/usvg/src/parser/paint_server.rs:534-551 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/paint_server.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f29f330dc140dd383dedaf148f8f1b3b263260c4c0a0a06168891d1e5b7424"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/usvg/src/tree/mod.rs:951-958 | crates/usvg/src/tree/mod.rs:971-979 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/tree/mod.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdbf92275201e2331305ceaa798e3bbb9ca2a7988448ef56cb7b6681e2c13ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/usvg/src/tree/mod.rs:961-968 | crates/usvg/src/tree/mod.rs:982-990 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/tree/mod.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"c847dd05d38f30f9537711f20e3ab6825f1896f531ebf2898e7ed0c0d1f85873"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/resvg/src/main.rs:331-339 | crates/usvg/src/main.rs:278-286 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/main.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe41d774b386b62d410e53c9b8f83829551280a3ded1ca1d05b7a9eda4c2124a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/resvg/src/path.rs:45-71 | crates/resvg/src/path.rs:85-111 \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":"crates/resvg/src/path.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a054fa49fdc8cdf51ed2aeb3166507298e0bc7358abc85694c5fec0da136cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/resvg/src/filter/box_blur.rs:105-125 | crates/resvg/src/filter/box_blur.rs:222-242 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/resvg/src/filter/box_blur.rs:105\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/box_blur.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"73848f6f6c4ddf57eeb2d49233f04e5d8e77cf66584223eded9abe22a7100c59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): crates/resvg/src/geom.rs:9-29 | crates/resvg/src/main.rs:813-831 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/geom.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1345c2671ce9939000591b8b9def4566b252d44fa5aead434d83aa752f6abe88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/resvg/src/main.rs:446-463 | crates/usvg/src/main.rs:372-389 \u2014 before extracting anything, compare \u0060crates/resvg/src/main.rs\u0060 and \u0060crates/usvg/src/main.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/resvg/src/main.rs:446\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/main.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31d61b147d00d5322d7d9d3e61db9c68a167135ac7bac8f6d5053f30ef20386"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/usvg/src/parser/paint_server.rs:794-811 | crates/usvg/src/parser/paint_server.rs:821-838 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/paint_server.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6d705443ecc9d667db4789089dc40117d4819790f74b40ae115ec71751c61f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/usvg/src/parser/converter.rs:848-863 | crates/usvg/src/parser/converter.rs:865-880 \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":"crates/usvg/src/parser/converter.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"406900d19e7417b4f3e495568c15e6071ce80bddec76ebe301a4206b59a5ae99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/usvg/src/parser/paint_server.rs:454-469 | crates/usvg/src/parser/paint_server.rs:492-507 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/usvg/src/parser/paint_server.rs:454\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/paint_server.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8acba6466e737563e92f8b0d427a71f527ea7ecf4893dfec5499022fcc98c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/usvg/src/parser/svgtree/parse.rs:506-521 | crates/usvg/src/parser/svgtree/parse.rs:524-539 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/usvg/src/parser/svgtree/parse.rs:506\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/svgtree/parse.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"640816409884aef82388dee2682d735a9a21a61e350c78ee7fbf19142178af59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/resvg/src/filter/box_blur.rs:127-140 | crates/resvg/src/filter/box_blur.rs:244-258 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/resvg/src/filter/box_blur.rs:127\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/box_blur.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"84be821dbddb34b38965146b98ad446749fb5189ff6f6a62ecb548d80fd3863c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/usvg/src/parser/filter.rs:1054-1068 | crates/usvg/src/parser/filter.rs:1084-1098 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/usvg/src/parser/filter.rs:1054\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/filter.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"522e840e3cd3e4a7fc6bde02a07730a104f11a2326f6c109727e27122a8c65e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/usvg/src/text/colr.rs:184-198 | crates/usvg/src/text/colr.rs:227-241 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/usvg/src/text/colr.rs:184\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/colr.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb63608d5a5edb875bb4e4b8a8586606e7ae3c42d17b2eb1bf433384694d9c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/resvg/src/main.rs:614-626 | crates/usvg/src/main.rs:344-357 \u2014 before extracting anything, compare \u0060crates/resvg/src/main.rs\u0060 and \u0060crates/usvg/src/main.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060args\u0060 to \u0060\u0026CliArgs\u0060 in one and \u0060Args\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/main.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11d280187060f9b389cdb681abb1c9a64b3fb87f9c96dd2de9f691a62d1f27b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/resvg/src/filter/box_blur.rs:86-98 | crates/resvg/src/filter/box_blur.rs:203-215 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/resvg/src/filter/box_blur.rs:86\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/box_blur.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"175ec72854eef77ef2685eb6a1d6e6ee4aa8ad4ebfb2ec3c90d05e31484d2998"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/resvg/src/main.rs:730-742 | crates/resvg/src/main.rs:757-769 \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":"crates/resvg/src/main.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc3efad087a9d69a93a54c44af6a2dd892e443dad5d9caf8da6b130f3132882"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 2): crates/usvg/src/writer.rs:1237-1245 | crates/usvg/src/writer.rs:1248-1260 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/usvg/src/writer.rs:1237\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/writer.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"00de1efee9967c52b11aed068cc52ffc445aa5af7f0ea8136c25975df4184300"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/c-api/lib.rs:525-536 | crates/c-api/lib.rs:563-574 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/c-api/lib.rs:525\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/c-api/lib.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f533f89d1d0373f3a4604b3a91b756f697f5c02a6c6f5127b4855941673555"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/usvg/src/parser/text.rs:960-971 | crates/usvg/src/text/layout.rs:791-802 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/usvg/src/parser/text.rs:960\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/text.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"631dc0ca4e20c44f20234a07ce48fa4fbc1270c18eb973c3050b8abcb69475a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/c-api/lib.rs:962-978 | crates/resvg/src/main.rs:851-867 | crates/usvg/src/main.rs:496-512 \u2014 before extracting anything, compare \u0060crates/resvg/src/main.rs\u0060 and \u0060crates/usvg/src/main.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/c-api/lib.rs:962\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/c-api/lib.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b11f4c10849a7505c2ceab3b26655e6a7a58be5cfc5a55dd4af75072d289bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/resvg/src/main.rs:372-382 | crates/usvg/src/main.rs:241-251 \u2014 before extracting anything, compare \u0060crates/resvg/src/main.rs\u0060 and \u0060crates/usvg/src/main.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/main.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c83f67472f9b4ec8f0bd72cf7b040e9eab8f11d545217800f1ca062e847853a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/usvg/src/parser/text.rs:945-955 | crates/usvg/src/text/layout.rs:771-781 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/usvg/src/parser/text.rs:945\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/usvg/src/parser/text.rs:943\u0060 calls \u0060path_length\u0060 and \u0060crates/usvg/src/text/layout.rs:768\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/text.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb7f217d4960c9a6dc4d9ad475f39f710b7ba6b3ee8931daf92300fbfee046f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): crates/resvg/src/filter/box_blur.rs:143-152 | crates/resvg/src/filter/box_blur.rs:168-177 | crates/resvg/src/filter/box_blur.rs:186-195 | crates/resvg/src/filter/box_blur.rs:261-270 | crates/resvg/src/filter/box_blur.rs:288-297 | crates/resvg/src/filter/box_blur.rs:307-316 \u2014 all 6 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":"crates/resvg/src/filter/box_blur.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"e823ce4fd72c0e896a0e324256bc4ff83de688054c1548896037dfab5cf155ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/resvg/src/main.rs:707-715 | crates/resvg/src/main.rs:730-738 | crates/resvg/src/main.rs:757-765 \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":"crates/resvg/src/main.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"6818e04476d1fce0635a090aad6b23a84fda71f4188b7a288c8f73ea28e9a88e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/resvg/src/filter/turbulence.rs:162-170 | crates/resvg/src/filter/turbulence.rs:172-180 \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":"crates/resvg/src/filter/turbulence.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"811f3fd7f149f91a6af811cfe66ade5f86d1081ca3811d346cefc206bfbeb8ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/usvg/src/parser/filter.rs:947-955 | crates/usvg/src/parser/filter.rs:1004-1012 \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":"crates/usvg/src/parser/filter.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bff3c3aeeda60db97c75b8f3e454e0b155f2270e7e424fb73a44ee02082a251"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/usvg/src/text/layout.rs:267-275 | crates/usvg/src/text/layout.rs:281-289 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/usvg/src/text/layout.rs:267\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/layout.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a882ecc18afc0f0e85fc4c4442715eb60881acefb98960fc1b4e0804b01d83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/usvg/src/parser/filter.rs:1042-1049 | crates/usvg/src/parser/filter.rs:1072-1079 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/usvg/src/parser/filter.rs:1042\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/filter.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"68557e36a4089601ecd4e3908c1982ead9af63daf051ab4370ada74f9f916785"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/usvg/src/parser/paint_server.rs:48-55 | crates/usvg/src/parser/paint_server.rs:87-94 \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":"crates/usvg/src/parser/paint_server.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11b8d2dd097c12547dd96ddc53c42e420d8eaaacb9cdeee88410f28c33c35e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/resvg/src/filter/color_matrix.rs:40-53 | crates/resvg/src/filter/color_matrix.rs:68-81 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/resvg/src/filter/color_matrix.rs:40\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/color_matrix.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"57722f6718d9d7c61ea7bd1a16138e18ac02a91bd556a454a8c942bf72c2e152"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/resvg/src/main.rs:569-574 | crates/usvg/src/main.rs:409-414 \u2014 before extracting anything, compare \u0060crates/resvg/src/main.rs\u0060 and \u0060crates/usvg/src/main.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/resvg/src/main.rs:569\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/main.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ed8ca448280bd7ac495b2deb833f834d719494a705d8c14304a149a0bfe5bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/usvg/src/parser/paint_server.rs:332-336 | crates/usvg/src/parser/paint_server.rs:359-363 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/usvg/src/parser/paint_server.rs:332\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/paint_server.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d58dc956c6eade69ab4ea96ea75d6d73c5cbec1c8a867488c479faffce535b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/usvg/src/parser/paint_server.rs:987-991 | crates/usvg/src/parser/paint_server.rs:1009-1013 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/usvg/src/parser/paint_server.rs:987\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/paint_server.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cd94692435ecac89cf22ca42519ab2d4010160f6564e5f2de4f9adb44787f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/usvg/src/parser/svgtree/mod.rs:347-351 | crates/usvg/src/parser/svgtree/mod.rs:1142-1146 \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":"crates/usvg/src/parser/svgtree/mod.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f68e8dfb0be9ed0e43922be90a41408ed912f65a60fbb36378cd9be8909fe20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/usvg/src/writer.rs:193-198 | crates/usvg/src/writer.rs:208-213 \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":"crates/usvg/src/writer.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7d0f5ec1249b4939c62bf9a51bf51908c8b4e0da5761f5b2db6bedeb07d6b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/resvg/src/filter/mod.rs:242-254 | crates/usvg/src/parser/mod.rs:198-210 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/mod.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0934351f33405aedf5080060c7a8846f668a85d004a4dcfadfc3f947029a89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/resvg/src/main.rs:341-349 | crates/usvg/src/main.rs:268-276 \u2014 before extracting anything, compare \u0060crates/resvg/src/main.rs\u0060 and \u0060crates/usvg/src/main.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/main.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"600ecbd6d632a492be5b61234eea83979e85d2961f9dbc5a6856bbcdae62d031"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/resvg/src/main.rs:361-369 | crates/usvg/src/main.rs:230-238 \u2014 before extracting anything, compare \u0060crates/resvg/src/main.rs\u0060 and \u0060crates/usvg/src/main.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 84 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/main.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e9b18f948cfa3b043170e8dbf272607ba2d6ba473e647a1d97108a4725dc38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/resvg/src/filter/lighting.rs:261-265 | crates/resvg/src/filter/lighting.rs:267-271 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/lighting.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7bac3dfd885002db80ed17392be874633315938a64fcc8ac6e57c80850503a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/resvg/src/filter/turbulence.rs:274-278 | crates/resvg/src/filter/turbulence.rs:279-283 \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":"crates/resvg/src/filter/turbulence.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d313a9e01a5999ee0e3c38f8a46df307342ead0abec6e8d7159a9c8c86700e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/c-api/lib.rs: 0.0% line coverage (0/422)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/c-api/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6993f098c17488a074876753c1dea1cc50f75c324183232ec94f39b43850139"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/resvg/src/main.rs: 0.0% line coverage (0/487)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7375282b4986ea326a2a7d0e1eb944726f4ae17f6519891305223499f88e3bd1"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/usvg/codegen/main.rs: 0.0% line coverage (0/103)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/codegen/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8e9734a99abfaa5275ff8b67bd40ad3c446aad0aa5dee836cc0cca09cd5285"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/usvg/src/main.rs: 0.0% line coverage (0/259)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"999fd7b85a2b46528b8721ebdabdaeaf3e491890371967e3faf150f887ebd7e0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/usvg/src/tree/text.rs: 17.5% line coverage (40/229)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/tree/text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dca833020ecdcf5dbea615d7fd13acb93499b0b9b002c737be80cfd7246d84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/usvg/src/text/layout.rs: crates/usvg/src/text/layout.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in usvg::text::layout::layout_text at line 181. 2 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:46:20 \u002B01:00\u0027 --until=\u00272026-11-14 13:46:20 \u002B01:00\u0027 --full-history --no-merges -- crates/usvg/src/text/layout.rs\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":"crates/usvg/src/text/layout.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"560cf1419fa223bcd2d38f57709066c089bef8d044ec0520634884113724dcc4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/usvg/src/parser/converter.rs: crates/usvg/src/parser/converter.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in usvg::parser::converter::convert_group at line 690. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:46:20 \u002B01:00\u0027 --until=\u00272026-11-14 13:46:20 \u002B01:00\u0027 --full-history --no-merges -- crates/usvg/src/parser/converter.rs\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":"crates/usvg/src/parser/converter.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a9a89ca75cd88af2c7868bf672cadbd63c1382f655744ad53cc6e4bfd49044"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/resvg/src/main.rs: crates/resvg/src/main.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in resvg::parse_args at line 481. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:46:20 \u002B01:00\u0027 --until=\u00272026-11-14 13:46:20 \u002B01:00\u0027 --full-history --no-merges -- crates/resvg/src/main.rs\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":"crates/resvg/src/main.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44c3b460800d8b9f6a4a91779bd6c27b47ea87032f4c2a2491067009558a542"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/usvg/src/parser/mask.rs: crates/usvg/src/parser/mask.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in usvg::parser::mask::convert at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 13:46:20 \u002B01:00\u0027 --until=\u00272026-11-14 13:46:20 \u002B01:00\u0027 --full-history --no-merges -- crates/usvg/src/parser/mask.rs\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":"crates/usvg/src/parser/mask.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b3a6792c268ae3287e2ac0c235b09bc5c587a2570c2be41b7ea9981a1586b5"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 1 significant file(s) lose their only recent owner: crates/resvg/src/filter/iir_blur.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e31145c1b975b6d3286791ecee5b650cc7d0819dd2deac6b161ef2bd4ceed1ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use system language \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/main.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"496d17b0c41c93896fb4ebe22d1e4a1cb583d5d594d12b55bbe50c3ea0eca9bd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use system language \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/main.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"485e21349aeec73d3c72b554604327cafe0f0d5ccf6ff836ede673c4290d5052"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: only when needed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/main.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4f24dd98e2c41bdd8dcab5ec5f88bd5620cb44deb20fdddfa9bc6963e01319"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: only when needed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/mask.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d21c9af0022bab8d872299befcb6fbbfce1bababa23b981574a916f6c0c2cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: probably not needed? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/tree/mod.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2614e7db8e8f97f5f44fa0cc631934ef7abf3d75a45b69a9a7f7554df334048"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find a better name \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/tree/mod.rs"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1d8dda36fae631bb29059f1559d71692ea7c1bec15076d25ec9d232356d9fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid for round and bevel caps \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/tree/mod.rs"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d92129b05ee7588a2d24b9569d1f9f01eb0c9ce1222de1f52ae7f2439afd5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement other bitmap formats \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/cache.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1cbd49c091f42d6fc47e367c87bb7c6eae7ea509f06203f18732ec49a57953"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Technically not 100% accurate because the SVG format in a OTF font \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/cache.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"f601487ba50609f543210537ea42caffeee2757c34070acc62b3d32d9f74bfc6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Glyph records can contain the data for multiple glyphs. We should \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/cache.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a666b7e2df413cc711f40c7a979c7074a7fe22e7827ad1c46c54d903f43ed38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Normalizing the stops into the 0..1 range moves the circles onto the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/colr.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8265654370be49e23885b5c25260f7e98c0eb08cada2c9472489e05a8ff2ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: surface warning without printing to stdout \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/colr.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af044dc0ef90286e438954dc527e7d2b9dc72b3792c5b04feea79def8f9836c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: surface warning without printing to stdout \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/colr.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"f972f02bc0616d98c579973ba67b4243ac1614bbe1e0f23154afe134bfd5d611"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Need to figure out how to represent the other blend modes in SVG. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/colr.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc10de37a96eb846ba8638ae0d7e988ff5d91654d443bb70750d274b9638744"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support other blend modes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/colr.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcc6c2043f6f53aac07160d36b84a9442dcbbf3be012bcc515ca48c96b9188f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Probably need to update abs_transform of children? Same \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/flatten.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3c69087251efc8c8770ac7869a719ae23cc17f65b95a034488dc1f64bed752"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: No idea what offset should be used for top-to-bottom layout. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/layout.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b85be1e1f40fafc412a2114271ed2adab23fa9af9840f4c6428500679d5f47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support vertical layout as well \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/layout.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"e877021e386795da6c644b0f61b08efd76a8edb1513ecccf4c4f6ece8a2698e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should be done only inside a single text span \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/layout.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ade441b1a423a39d54759bface1d33ff8c25ef37300aa2e4c34d9d6b271ac7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace clusters and not glyphs. This should be more accurate. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/layout.rs"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"6077ff7b79dc943990fff2d3f61dc31fccdf7f65c8e8e641dabbbab13ce3327b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: print a full grapheme \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/layout.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eccfdd316dc13cdebce6c4bd301611f0380b46b51f92d887be6d5d1b0571a34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: explicitly set language? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/layout.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"07966355b3c0ec6ae3ad9d0395fbc01b988a0cd3a8cb616f73a0244940ebb2c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: can fail? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/layout.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5890ea083a5d13160a0615fd861b54d306c7f7e9ef3265421098093cb13a9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Cache the charmaps of fallback candidates, building one for every lookup is expensive. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/text/mod.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e3c1028420df1a683c269c426f04efcae241c4dd7c11f3555eea97cd0508db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: macros? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/converter.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cd7c24fb4aa2c48359c13f2b38a65ee16af6b6353b82ce559fe81f8d91fb7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: explain \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/converter.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a75baa9833b1bb154b9735af0398fb8da17fcf2d9cb3bd264d51467071eb4a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: explain \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/mod.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"36de17671b59d2622be1ed3082efd621ccc0bb82d2f32bb46743757d05e8be38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle \u0060markers\u0060 before \u0060stroke\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/converter.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b06d72a974d288cbe317cb8cd5b484a6442fac9a010c06366e58c888784e37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should be fixed eventually. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/filter.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0deff88eb9fcda5860303e116e035bb3b55dfb630e75509b3825b6e93844c6d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove primitives which results are not used \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/filter.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"6012fb2226d7380a4ab1a77844a63417eddc7bfbf5b3468e4dd083f346c18174"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should probably split scale to scale_x and scale_y \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/filter.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6078e7e08fd3bffd9c7362a624766a7f35f009963da8d78fd0e7175a121e297"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid allocation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/marker.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d983d018a52c6b345cf6da7ce7e322b43b8da779bd0d10953961cc0ba70faf14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: do not create a group when no clipPath \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/marker.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f47ff4f220aafbae98509ffdb2c3ee2eb3a1ec737c86714ea4cb39d596d5a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we should update abs_transform in all descendants as well \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/paint_server.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"021334f99a082e6e67505791461f7977caec1d634d0f81b221b9527224f97d78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: what to do when \u003C= 0? UB? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/text.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"25025d1b84f40f4ba9cc2a628c4a7c2c1a08df9ab489a9311aa725d7bc9c5dac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: properly resolve narrower/wider \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/text.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d92d320f710e0ee3751226d78dd364faf1b932030338954269da905d839309"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: show position in XML \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/svgtree/mod.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"f554ece31a1026f97d529a7e60cef1ac1f2c7ae3398b0d0841f5b23f682d783e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: is there a way yo make it less ugly? Too many lifetimes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/svgtree/mod.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8471ab6c053c081ecb54faffb22ae8f88f06d4a96d9c9b0a4cb4dcc20e51c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: to svgtypes? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/svgtree/mod.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc0c87c97146fb59df94905b44f387a940ed55a1125f300a30420c6a409d2d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Let svgtypes parse \u0060currentColor\u0060 as part of a \u0060\u003Ccolor\u003E\u0060 type that \u0060Paint\u0060 and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/svgtree/mod.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be061a70a72ffcfadca01dd02f8cec59d4e03e21db9580973f6962da5cbc81d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/svgtree/parse.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55377473883a29254deadfbb1259ee63fb19a6ec961ebcfa93dea8bd13e7ca1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: perform XML attribute normalization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/svgtree/parse.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45148a7f9f3b77ea8bc94a41263a9b64d6e03ac6d53bce8cc571da31204a3d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: lang \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/svgtree/parse.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcaaefce2f745878f21fc9d33d84c8b816d50c8ef55718870c1e76af11755ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: allocate only once \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/svgtree/text.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08ecfc137a7bc8f6c13c461c64af7f49a5064f7c9015c0847e1c0ff371385f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find a way to remove all empty text nodes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/svgtree/text.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67de0ac817d9e24d29f5718ae66e669f9ed81e4421ec6851199d3cc8bc40a2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find a better way \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/main.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bc866d31f7715d4dfc4077d12e2944738c7be4061780ce661a9ac4e21b7a41"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add offset support to render_node() so we would not need an additional pixmap \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/main.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"968a63732565355eabf8d23b5b51a9630fdcd8a2fa2b83bc91fbbd1e3a1020ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we should use some kind of anti-aliasing when offset is on a pixel border \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/displacement_map.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32ebd390d3e62b50f8ab48a36dce6c2417eb3fe5d7f835532c555e15243fe0b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Blurs right and bottom sides twice for some reason. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/iir_blur.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9e730f2d6994cd26d2a9e688e69710e44c92c87341ebab173f9ecc2d0ff984"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: apply single primitive filters in-place \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/mod.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c360bf74c572d5938b3a0b3cadcb3a1741d4e0336ac7b8144d8e611712a4a81f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: https://github.com/rust-lang/rust/issues/44095"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/mod.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"e440505783ebe7e8ad08172bfb7e5f70609f5d7b58b448df3b27cdb076a5166f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid copying? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/mod.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48cb15d3f1f9c76727d33a76a982aa0c15792ee7721943f4972b0c77ba064db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: do not modify LightSource \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/mod.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada64bdd85dc9f068d06394a3a7fb06f33756ec7067da4b659c0c505cc6c3460"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use resvg::Tree \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/c-api/lib.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"331ca0e80a6d563db98bd2720e85bd7619e5ed7d82f55d55a6f3c02649fe6c96"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: the repository holds project manifests and neither \u0060README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33a5992d4bd6ac1ea4b853ae69753fcd7e0410099c58731c86be53325ba8c96"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060crates/usvg/Cargo.toml\u0060 makes this repository a deployable product (line 16)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/Cargo.toml"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d333c499cdc8426578a2ef4c3a3b0debdde41656d42af200607ac0a9f3d594f"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 6 project(s) overshoot their size bounds, lowering Project Cohesion to 6.7/10. The most over is \u0060crates/usvg\u0060 (16628 LoC, 127 module-visible types across 5 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6cd7dd8ce2cb5c04a2c1d6ebe0d105c0ff37322563dcca85e129c8d762d0c027"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f2321d34b69b906146cf17448b78b90950e950c1a30d022863c72ee60abea03"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4fe457cf29b954daddbff8bf3a3735a797cb6afb51475f1f1ab4ab8e03f3f71a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"349641e1b2205bc453a23a91bca5e01d5e24bcfcf71fc368b12fb976088f55c7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d88e9fa70502fb0bc0853f3147e88b7c4f245ce4d564d01b2d0d6fc6d5a73731"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0d69e3beab226c373b7bd1d84dd05efb1dfab99c067a123e2df341897ba4f5b0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"553c10b3b6abdcb709494a6590e1592160d25f463d47de8dc2de29250c318478"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc797211cb0681bb48bf30af9d054f4108eba53add4971368f61e465c8cb38c8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5b65e723de8641b913e698882c967c1d9df48e2ae03fd3850eef6448b60beed7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4fe3c5e7074b052d7f2ddd26e16264061a9272458ec8c9b3e57dd43459367633"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"877027151e4e428b2790dcbce73df54471027816bda3a7b83a25a6b64b87965e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ecb07af15927c28c699ed4fa60d3035848d8acac0e379f5bf0a166527f23cd08"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"121b603ff289101d91cb17767cf79fb656ee6adbed3987d6a50fc22264f9fb98"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5f2d979a21dc8f2b50b89e55d8fd150f01efa34d9c6690009bb3e60b904d9a6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0f77a244a3d247bffd07d139261f6dfa938f0c8526f11d8c66db6044f3395409"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45349f6239e2400cb362ee004dcad31b5c521c173147d133f03693899a2d262c"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"02f23d22faedb4b2699d96dfc73d0616ba5c934702bb67e6fa9d5e2ffcb1b76e"},"properties":{"dependency":{"package":"rand_os","version":"0.1.3","advisory":"RUSTSEC-2025-0124","reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 14 of 47 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 47 of the 58 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: crates/usvg/src/parser/svgtree/text.rs, crates/resvg/src/filter/box_blur.rs, crates/usvg/src/parser/style.rs, crates/resvg/src/filter/turbulence.rs, crates/resvg/src/image.rs, crates/usvg/codegen/main.rs, crates/usvg/src/parser/switch.rs, crates/usvg/src/tree/geom.rs (and 6 more). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/svgtree/text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5799b60548be577a5de9b57b6bf244dcb6c5c84d2fee236d37083fc02d9cac4c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/box_blur.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c08c106db81133fdb98bed152543901e8e1c5db5c15569b0d5c33e64f1a5a4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/style.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe791b6ca6b7655b125ef19b04197a7b8241a2e417f24d4de90bd7935a433271"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/turbulence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e4b7294a0819b0f0864147b6f4de132393192c3d0c568c69b6d852675139d3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/image.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee061df511da67fe8faf5621699bef15e9e7032da1f3299c0bb4ea1895f2a980"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/codegen/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c005a3223e3046cd81a7558faad988b8fff8973f0b79d76c5d57777ad12f83"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/switch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e142e654fdfcf7fda7d6d2a5905ab4d385785862d7ecd9741dbfc700f38206"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/tree/geom.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3dcedf0e5e8872af0016250bdd315da5c41302d93cb2fe0f241aa03577721d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/units.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"107ecd1f4c04fb8d4f2636537289ecd2a9f73aa5a9d9559e48d73dd01d7d2bef"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/color_matrix.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16531c002fe95a0813c77ff5c9b3f3f4e839da56232a14ab23e18cec87565c3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/usvg/src/parser/clippath.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6d4a8366203665a0a324f276153683370ac2cead3fbec75e4d205ed69734f3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/resvg/src/filter/convolve_matrix.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d46d8e5b78bce8274220cda8f8103531c267348d26a75683dbd67d8e8acbd1f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/explorer-thumbnailer/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa45d1b8c941d73b584a9f6ace5de9f195fd7dbcbf6ed93fbae45188e1eb008"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/explorer-thumbnailer/src/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8fd2a4398a2aef4131aaf01e8b48608a93b8d9cc0f4762dc9ad088147ec0a1"}},{"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":"759dca709f1a032fb6f624ce672e6afb5558fce53ecf01fb73618c4d33923164"},"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":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76302cd13f20580a528f72d66fbf2e2e8b7cc5f2ffff7e9573267c9cdab0864e"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/resvg/README.md links to \u0060./.github/chart.svg\u0060, but \u0060crates/resvg/.github/chart.svg\u0060 does not exist. 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":"crates/resvg/README.md"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9776e34b7556773d291b816c44c1b22767a326ada2b7ff32606e65cb42e9b3"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: crates/resvg/README.md links to \u0060./.github/chart-svg2.svg\u0060, but \u0060crates/resvg/.github/chart-svg2.svg\u0060 does not exist. 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":"crates/resvg/README.md"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa65b4289f28c9770b86c4efd2399193051ec694f23277521e7f53662ee6678"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 3/4 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060crates/usvg/codegen\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add cargo-audit / cargo-deny (or clippy) (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 2 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/main.yml"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"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"}}],"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-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"Reliance on Component That is Not Updateable","shortDescription":{"text":"Reliance on Component That is Not Updateable"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"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."]}]}