{"$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":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"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":"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":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Flex.layout (cyclomatic 58): Flex.layout has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/flex.dart"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e887f2ee360b580ea6a27ee179b7b760c71851bbf511747289a94fc26d55421"}},{"ruleId":"D1","level":"warning","message":{"text":"RichText.layout (cyclomatic 55): RichText.layout has cyclomatic complexity 55 (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":"pdf/lib/src/widgets/text.dart"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0547995f94cd85f98ec032bc8426bea4b3de7d2cc99eca03ebe7bb1c173d3ce"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiPage.postProcess (cyclomatic 49): MultiPage.postProcess has cyclomatic complexity 49 (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":"pdf/lib/src/widgets/multi_page.dart"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fb8eab21cdadca2715e477660454ab920399caa165dd4a15f021502d2da744"}},{"ruleId":"D1","level":"warning","message":{"text":"Wrap.layout (cyclomatic 43): Wrap.layout has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/wrap.dart"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4490fed959a3adce9e963d050e7477864694e6134b52c7de4a32b119153dcf84"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiPage.generate (cyclomatic 32): MultiPage.generate has cyclomatic complexity 32 (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":"pdf/lib/src/widgets/multi_page.dart"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dc082d30e46df6d527bc33e0124c549c6aaf7712557b20ea014e251a5746e8"}},{"ruleId":"D1","level":"warning","message":{"text":"Table.layout (cyclomatic 31): Table.layout has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/table.dart"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"166af79bd29b56e0db6bd3566cfdc3ed885be9745437825ecb9c46ba35743fd8"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfJpegInfo._readTagValue (cyclomatic 30): PdfJpegInfo._readTagValue has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/pdf/exif.dart"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce3c52dbb7400b156d5fb37c5fce4c9ea3c39108f651e6de75151ce5c35d776"}},{"ruleId":"D1","level":"warning","message":{"text":"BorderRadiusGeometry.toString (cyclomatic 29): BorderRadiusGeometry.toString 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":"pdf/lib/src/widgets/border_radius.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d14a527848164cc58644b885482fbb8f936444d32c1f6e618f8c185e79d08d"}},{"ruleId":"D1","level":"warning","message":{"text":"TtfWriter.withChars (cyclomatic 26): TtfWriter.withChars 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":"pdf/lib/src/pdf/font/ttf_writer.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb0e101f003595b45598fb2e9bc93639bc94e93cfc7ada27e9935532e5ed5b9"}},{"ruleId":"D1","level":"warning","message":{"text":"BoxDecoration.paint (cyclomatic 25): BoxDecoration.paint 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":"pdf/lib/src/widgets/decoration.dart"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f53b12542cc34fff2f5cf72f2f7dbe548802c4c6ef6a1680aacc5d6e9e839da"}},{"ruleId":"D1","level":"warning","message":{"text":"GridView.layout (cyclomatic 23): GridView.layout has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/grid_view.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c675c8b9c0fc25cb2d3ef6778e4b33c003930d7034de31defe4adb5228dccf78"}},{"ruleId":"D1","level":"warning","message":{"text":"Stack.layout (cyclomatic 20): Stack.layout has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/stack.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"209e990d335405ce1df9d79c36741125fb360c13216d39557cfd8a4ecd2ea112"}},{"ruleId":"D1","level":"warning","message":{"text":"SvgPainter.getFont (cyclomatic 19): SvgPainter.getFont has cyclomatic complexity 19 (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":"pdf/lib/src/svg/painter.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"26415c4fa63de62fe2a8441f5e8e62a853169ed0b3fa62fcea70e03e1fb1f7fa"}},{"ruleId":"D1","level":"warning","message":{"text":"Alignment._stringify (cyclomatic 19): Alignment._stringify has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (AlignmentDirectional._stringify) 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":"pdf/lib/src/widgets/geometry.dart"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"843dec6bf00e4fba9f0c0813c237fa819ab0e6eb8bc06b6acc5d165631b538b0"}},{"ruleId":"D1","level":"warning","message":{"text":"AlignmentDirectional._stringify (cyclomatic 19): AlignmentDirectional._stringify has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (Alignment._stringify) 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":"pdf/lib/src/widgets/geometry.dart"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57a900de5c0c6d57973168bf9ed5207d52a922c94ae67480555250e8f79e1d4"}},{"ruleId":"D1","level":"warning","message":{"text":"TableHelper.fromTextArray (cyclomatic 19): TableHelper.fromTextArray has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/table_helper.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb1833191564c2ba1a016c014be2be2d05fb8eb16a8a5ce16086f59f94eff19"}},{"ruleId":"D1","level":"warning","message":{"text":"_Line.realign (cyclomatic 19): _Line.realign has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/text.dart"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a467c0e23575311941d15ad2cb8d556c3079dbd5d34543fc43f5ab0ca5815e4"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfJpegInfo.PdfJpegInfo (cyclomatic 18): PdfJpegInfo.PdfJpegInfo has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/pdf/exif.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"34810d1f13bf0e7fe9b5bbd3d855033feec1aa6f75d3ff939a5f2bc05371f1d2"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfPreviewRaster._raster (cyclomatic 18): PdfPreviewRaster._raster has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"printing/lib/src/preview/raster.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b13b5c33abd2f88c248d05404beb184ce0e171ee76764842c83fbdfc1f9f53"}},{"ruleId":"D1","level":"warning","message":{"text":"PieDataSet.layout (cyclomatic 17): PieDataSet.layout 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":"pdf/lib/src/widgets/chart/pie_chart.dart"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"2150336c6f49afb6546dd849949228041c39736f5e0775ac5689c56d2e5c8298"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodChannelPrinting._handleMethod (cyclomatic 17): MethodChannelPrinting._handleMethod 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":"printing/lib/src/method_channel.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4386c2fea3aadc3d0152b931144b87bab9c58aa3dae6dceedd68c6e062215de"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfPreviewState.build (cyclomatic 17): PdfPreviewState.build 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":"printing/lib/src/preview/pdf_preview.dart"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bde1604de603f8a4764ae7a2cf652d154516db03917e2a8b12bf3f645b51de"}},{"ruleId":"D1","level":"warning","message":{"text":"_PathBBProxy.cubicTo (cyclomatic 16): _PathBBProxy.cubicTo 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":"pdf/lib/src/pdf/graphics.dart"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"20320f9b1e7c6fd5568ccc8c389331c15879b000ef63dd37bf64977789d333cd"}},{"ruleId":"D1","level":"warning","message":{"text":"Table.paint (cyclomatic 16): Table.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":"pdf/lib/src/widgets/table.dart"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"00663b7fed4a91564704aa425a4f3211caeca568ee9ab6f13747c0b1fb40f6de"}},{"ruleId":"D2","level":"warning","message":{"text":"RichText.layout (cognitive 174): RichText.layout has cognitive complexity 174 (threshold 15). Drivers by points: if/else 29 (115 pts), ternaries 9 (26 pts), loops 7 (22 pts), boolean chains 11 (nesting depth added 118). 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":"pdf/lib/src/widgets/text.dart"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb6ad9d918e9526540b5c1ca5e23b4eb796a3ac1ca113cfb30b0e1e38733ed2"}},{"ruleId":"D2","level":"warning","message":{"text":"Flex.layout (cognitive 101): Flex.layout has cognitive complexity 101 (threshold 15). Drivers by points: ternaries 16 (36 pts), if/else 14 (28 pts), match/switch 9 (28 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent 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":"pdf/lib/src/widgets/flex.dart"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a249163250078e6b701cac9af11a37b3f2eec6469ed3e42eea4ba5593c9a191"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiPage.postProcess (cognitive 101): MultiPage.postProcess has cognitive complexity 101 (threshold 15). Drivers by points: ternaries 18 (47 pts), if/else 14 (34 pts), match/switch 3 (10 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 59). To reduce it, split the body into named stages: move each independent 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":"pdf/lib/src/widgets/multi_page.dart"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01a244890e5ee546909121f93a73c6fd4b4919d28a79293036a2e86dbcce5c9"}},{"ruleId":"D2","level":"warning","message":{"text":"BoxDecoration.paint (cognitive 67): BoxDecoration.paint has cognitive complexity 67 (threshold 15). Drivers by points: if/else 14 (38 pts), loops 3 (17 pts), match/switch 3 (9 pts), boolean chains 3 (nesting depth added 44). 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":"pdf/lib/src/widgets/decoration.dart"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3d8027a068b7d976181c3ff843e3c8f93880edd3b9fbdd4fc257b8e1e7c1aa"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiPage.generate (cognitive 59): MultiPage.generate has cognitive complexity 59 (threshold 15). Drivers by points: if/else 13 (33 pts), ternaries 9 (17 pts), boolean chains 8, loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent 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":"pdf/lib/src/widgets/multi_page.dart"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f43cf9fd205bff2d7d938f2b8585447583766983f0d5b84891d1ea7214cb533"}},{"ruleId":"D2","level":"warning","message":{"text":"BorderRadiusGeometry.toString (cognitive 58): BorderRadiusGeometry.toString has cognitive complexity 58 (threshold 15). Drivers by points: if/else 27 (53 pts), boolean chains 5 (nesting depth added 26). To reduce it, split the body into named stages: move each independent 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":"pdf/lib/src/widgets/border_radius.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0834dfc7d4a10bbbec6b01d704e6e7b1971567d51c401c44613daf271b26729c"}},{"ruleId":"D2","level":"warning","message":{"text":"Wrap.layout (cognitive 56): Wrap.layout has cognitive complexity 56 (threshold 15). Drivers by points: if/else 18 (36 pts), ternaries 4 (8 pts), match/switch 4 (5 pts), loops 3 (4 pts), boolean chains 3 (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":"pdf/lib/src/widgets/wrap.dart"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1e3ae4f8ea3cc8151eac9c81fd73b8ae03776a9049c21dfb1abf4512417957"}},{"ruleId":"D2","level":"warning","message":{"text":"Table.layout (cognitive 55): Table.layout has cognitive complexity 55 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 9 (16 pts), boolean chains 4, match/switch 1 (3 pts), ternaries 1 (2 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/table.dart"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fb310f4a36524ee4c24ce46adceba7bf62e9f9bdf11e78d68e6d1c7e965e73"}},{"ruleId":"D2","level":"warning","message":{"text":"TableHelper.fromTextArray (cognitive 49): TableHelper.fromTextArray has cognitive complexity 49 (threshold 15). Drivers by points: ternaries 10 (33 pts), loops 4 (9 pts), if/else 5 (7 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/table_helper.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e498da17100dbd5122996e855596b00c3465ad39f539abdeb723e9f4397613"}},{"ruleId":"D2","level":"warning","message":{"text":"TtfWriter.withChars (cognitive 41): TtfWriter.withChars has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 12 (13 pts), ternaries 2 (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":"pdf/lib/src/pdf/font/ttf_writer.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a20b93d6a8da0438763953d5bbb2177377d1c17ad93fedfbaa20e1a5e138ff9"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfJpegInfo._readTagValue (cognitive 39): PdfJpegInfo._readTagValue has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 8 (16 pts), ternaries 3 (6 pts), match/switch 1 (nesting depth added 19). 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":"pdf/lib/src/pdf/exif.dart"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee7c8ff14c6b38c8f9902750bad1d1e7439231bfa8252ec172918e9025d6b4d"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfPreviewRaster._raster (cognitive 32): PdfPreviewRaster._raster has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 2 (5 pts), boolean chains 2, error handling 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"printing/lib/src/preview/raster.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f8f8b0344a5ba4f62beb567afebda249f6d83524f02cc495ae1e9dae046a80"}},{"ruleId":"D2","level":"warning","message":{"text":"Flex._getIntrinsicSize (cognitive 31): Flex._getIntrinsicSize has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 3 (9 pts), loops 3 (6 pts), match/switch 1 (4 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":"pdf/lib/src/widgets/flex.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"22526d79bca963be809c9db8b8e0b1882f3821d4faf23b791df6995e9619aa0a"}},{"ruleId":"D2","level":"warning","message":{"text":"GridView.layout (cognitive 31): GridView.layout has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 5 (8 pts), ternaries 2 (6 pts), boolean chains 2, 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":"pdf/lib/src/widgets/grid_view.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"790705a044fe6d7ab3a5b2b99ea18d623460aa6fa9dc8bb313fe397996ad75b5"}},{"ruleId":"D2","level":"warning","message":{"text":"Stack.layout (cognitive 31): Stack.layout has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 2, loops 2, match/switch 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":"pdf/lib/src/widgets/stack.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0562ef4cb477b2d7a3a31b3d347b507c9d2bcff29ec35baae9b1e5f5400226b"}},{"ruleId":"D2","level":"warning","message":{"text":"RichText._preProcessSpans (cognitive 31): RichText._preProcessSpans has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 2 (4 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/text.dart"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b7a8c9788bf20ebb62b4545b76f7bb4299170e701576bad372b386cb1715d0"}},{"ruleId":"D2","level":"warning","message":{"text":"_PathBBProxy.cubicTo (cognitive 30): _PathBBProxy.cubicTo has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 4, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/pdf/graphics.dart"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"0488e82fe2268973688d8251a520f091e7fb7cfeb6f0cf1b588b7f03cccf980d"}},{"ruleId":"D2","level":"warning","message":{"text":"PieDataSet.layout (cognitive 30): PieDataSet.layout has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 10 (13 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/chart/pie_chart.dart"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd723cd0a32b048cfaca104da8002c212eec245038d6164ed981daf7b3c41ac"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfJpegInfo.PdfJpegInfo (cognitive 26): PdfJpegInfo.PdfJpegInfo has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/pdf/exif.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2934a3d6a8ee5dba3983804684086406559e627448984b81a56b169719cfa4d"}},{"ruleId":"D2","level":"warning","message":{"text":"Table.paint (cognitive 26): Table.paint has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 5 (10 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/table.dart"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fb30d8861008f31cdc571ca11588034a64abf63a7e4394d133ecf285b77535"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfArray.output (cognitive 24): PdfArray.output has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/pdf/format/array.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ec901df6809dcea523f7c47202f961efc1479ccd9be68e599c80bcecddb4b4"}},{"ruleId":"D2","level":"warning","message":{"text":"PointDataSet.paintForeground (cognitive 24): PointDataSet.paintForeground has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (8 pts), ternaries 1 (4 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/chart/point_chart.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d258145899d72acd7dcb4e23a611a2c669dd5f3231df326d7b92e5d190c024"}},{"ruleId":"D2","level":"warning","message":{"text":"_Line.realign (cognitive 24): _Line.realign has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 3 (5 pts), loops 3 (5 pts), match/switch 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":"pdf/lib/src/widgets/text.dart"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb71d5057f5116f4cc6c424a40ee5d77008db1e06826a86d6f3ce8dc3ece2792"}},{"ruleId":"D2","level":"warning","message":{"text":"Partitions.layout (cognitive 23): Partitions.layout has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (5 pts), ternaries 1 (2 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":"pdf/lib/src/widgets/partitions.dart"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"159e7d79df073888e06d36e4fbf673ddeb020a37afb2dfa2b575c0743464704a"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodChannelPrinting._handleMethod (cognitive 23): MethodChannelPrinting._handleMethod has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 pts), error handling 1 (2 pts), boolean chains 1, match/switch 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":"printing/lib/src/method_channel.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13a0bf6b5b6912f26b8a1eb9acb78bf2ed11f2c68de3cb1891ba3621a14c6c7"}},{"ruleId":"D2","level":"warning","message":{"text":"SvgPainter.getFont (cognitive 20): SvgPainter.getFont has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 10 (19 pts), if/else 1 (nesting depth added 9). 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":"pdf/lib/src/svg/painter.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4af8ca06e3a11f1ca77fdec044c1f332c7209fc48c674eb4fceb497d67e7ec2"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfPreviewState.build (cognitive 19): PdfPreviewState.build has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, if/else 6, ternaries 3 (6 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"printing/lib/src/preview/pdf_preview.dart"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"71352a3b4ded015ef461305a4a35ebe0d88147bf9a3376a6078c5f00c0b1af5f"}},{"ruleId":"D2","level":"warning","message":{"text":"FixedAxis.layout (cognitive 18): FixedAxis.layout has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 8 (16 pts), loops 1, 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":"pdf/lib/src/widgets/chart/grid_axis.dart"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"20509d12a49ef3729fb3184f859df516e33775d27e5c9dd2cbd82e40b69fd1cd"}},{"ruleId":"D2","level":"warning","message":{"text":"PieGrid.layout (cognitive 18): PieGrid.layout has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/chart/pie_chart.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9af636c46963927f90a0f2a825a97cf9283d0fa14d9fa6fcc990d13fe58ce9"}},{"ruleId":"D2","level":"warning","message":{"text":"Alignment._stringify (cognitive 18): Alignment._stringify has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 9. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (AlignmentDirectional._stringify) 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":"pdf/lib/src/widgets/geometry.dart"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"527bcf94fb6e25d3f29a212701971db77685cae5468b7b85f01e1db0d36d10f8"}},{"ruleId":"D2","level":"warning","message":{"text":"AlignmentDirectional._stringify (cognitive 18): AlignmentDirectional._stringify has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 9. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (Alignment._stringify) 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":"pdf/lib/src/widgets/geometry.dart"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d8e79e82a7b0bade2dceea5c99292a9a0b23041a9cc11db561bdf038205457"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageProvider.resolve (cognitive 18): ImageProvider.resolve has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 3 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/image_provider.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce5464596eca59ec31a02515dbb50960f69edd3f905cf2c7e2edb3d8e549643"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintingPlugin.handle (cognitive 17): PrintingPlugin.handle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 1 (3 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":"printing/macos/printing/Sources/printing/PrintingPlugin.swift"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9a74bac95f2b40d0414c50d2eba6136d48a816f63279dde5d11af5c6cb3604"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintingPlugin.layoutPdf (cognitive 16): PrintingPlugin.layoutPdf has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 4, error handling 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"printing/lib/printing_web.dart"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5980d4cc163bbaca85e49f14455b66b029bc1187f4b89cc0b0b00d06d851b8"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDict.output (cognitive 16): PdfDict.output has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4 (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":"pdf/lib/src/pdf/format/dict.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7c8ef99bc5b9ec0395ce89fe854f065a38ccc36025a9aabc58fceb0d3a7b80"}},{"ruleId":"D2","level":"warning","message":{"text":"RichText.paint (cognitive 16): RichText.paint has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/text.dart"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cb805826871a884507e2f12b9149f97e208597fc6d50232bf1cce5573c7409"}},{"ruleId":"D2","level":"warning","message":{"text":"Printing.pickPrinter (cognitive 16): Printing.pickPrinter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 1 (4 pts), loops 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":"printing/lib/src/printing.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"37be3683a407f4b36a63412517737ca83e6a913c671ca9aea2280e2bac3468a9"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintJob.setDocument (cognitive 16): PrintJob.setDocument has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"printing/ios/printing/Sources/printing/PrintJob.swift"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f1ace960d299ba12b06332a393d737a722edb8e6e741894a63ffd9e6e73e21"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PdfGoogleFonts: TooManyMethods \u2014 6526 methods. The bar is 30 methods; this is 6496 over it, 217.53\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":"printing/lib/src/fonts/gfonts.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ec2beeb5bd4e1d7278015204cb8c9be1f8363c9aadf3aec062fde6ee927c09"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PdfGoogleFonts: ClassTooLong \u2014 32627 significant lines (blank, comment-only and punctuation-only lines excluded), 6526 methods. The bar is 400 significant lines; this is 32227 over it, 81.57\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":"printing/lib/src/fonts/gfonts.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"550aa8bee36cad6876708891a4eeca791a58b7b621cfca52063a988b772a6c3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fonts/gfonts.dart: FileTooLong \u2014 32629 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: PdfGoogleFonts (6551-71803). The bar is 500 significant lines; this is 32129 over it, 65.26\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"printing/lib/src/fonts/gfonts.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa75c47ca938d156a378aa1d4b7a049d9d8c4788a73ca98750a5b3901011881"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Flex.layout: MethodTooLong \u2014 layout runs 225 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 125 over it, 2.25\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":"pdf/lib/src/widgets/flex.dart"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a576f7b446a7550e4b779334ebf2d964c363b47dd0e1bf8773f8dbe475e2234"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TtfWriter.withChars: MethodTooLong \u2014 withChars runs 221 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 121 over it, 2.21\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":"pdf/lib/src/pdf/font/ttf_writer.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"787f98207473684c59850eba791e001871328abef468048ab586df0ba4514d09"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MultiPage.postProcess: MethodTooLong \u2014 postProcess runs 192 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\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":"pdf/lib/src/widgets/multi_page.dart"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"0153002fb13a7c0ef2d4e80b359607a6a4ea103f2c35dd4b7f99c99fb517bf1f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PdfGraphics: ClassTooLong \u2014 757 significant lines (blank, comment-only and punctuation-only lines excluded), 45 methods. The bar is 400 significant lines; this is 357 over it, 1.89\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":"pdf/lib/src/pdf/graphics.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64158976b18f58927a1708a8edeeecbc9c7106f52bbe0fc24d4cc453fbcbada"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Wrap.layout: MethodTooLong \u2014 layout runs 184 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\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":"pdf/lib/src/widgets/wrap.dart"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"6611f7152ff6c40b246a9de46aeb761ffd8ed85c575780642bcdfa518fad5887"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pdf/graphics.dart: FileTooLong \u2014 903 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: PdfGraphics (100-1272). The bar is 500 significant lines; this is 403 over it, 1.81\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/pdf/graphics.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3394a1877089ef929eebce2c0cf0d276d5611ba5ba0285597501f0889ca0a2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PdfGraphics: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\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":"pdf/lib/src/pdf/graphics.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c794b0a76a875dff7f567fa5d31ef36145d2973af415d295816854d56c236ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/basic.dart: FileTooLong \u2014 717 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 217 over it, 1.43\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":"pdf/lib/src/widgets/basic.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"012545f0ae665163ff3f3b59434ea6401e35efc8048414309bd795070e0ec859"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TableHelper.fromTextArray: MethodTooLong \u2014 fromTextArray runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\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":"pdf/lib/src/widgets/table_helper.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"136f7fa14098b78cb75b4b86629985ad319882767d290dfb9a1b91010911bd00"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GridView.layout: MethodTooLong \u2014 layout runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\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":"pdf/lib/src/widgets/grid_view.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ae297f7aa2e246c4452cd1222a3616b3814b06a4f981b6224101cf3735ef80"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MultiPage.generate: MethodTooLong \u2014 generate runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\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":"pdf/lib/src/widgets/multi_page.dart"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"629c874a4c018d14a782e97d849ee31ae084cc632429d86853f8dabc105e5b3d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Table.layout: MethodTooLong \u2014 layout runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\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":"pdf/lib/src/widgets/table.dart"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"00734ee84c4af902a97ecb9404396cf4cc1f33364306274f60d5c41eaea18470"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/geometry.dart: FileTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 56 over it, 1.11\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":"pdf/lib/src/widgets/geometry.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0d9b251dae3aba24cd311e4015f78709f4ea6abf742d46d416b34bf0acca05"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BoxDecoration.paint: MethodTooLong \u2014 paint runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/decoration.dart"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d66fc71806db5050a365379ea1095db511b1177b5f55106518a5658abeed29"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/flex.dart: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded), about 72% of them inside a single declaration: Flex (64-565). The bar is 500 significant lines; this is 15 over it, 1.03\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/flex.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53920728e72e37d7d0734b73b8ff22194be8840afd56e80a5376081e59dcf6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/annotations.dart: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3 over it, 1.01\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":"pdf/lib/src/widgets/annotations.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1dc06bb751ad2bb9600da216432e72ddb74029ce0b09a08012d1b722feb983"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (68 shared lines): pdf/lib/src/pdf/format/xref.dart:117-199 | pdf/lib/src/pdf/format/xref.dart:201-290 \u2014 These two members are variants of one another: 68 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":"pdf/lib/src/pdf/format/xref.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec203a6936ff666e1295e7b171f8ab1d43388c59a596a0aa6697b95a4d4f87bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (51 shared lines): printing/ios/printing/Sources/printing/PrintingPlugin.swift:40-148 | printing/macos/printing/Sources/printing/PrintingPlugin.swift:44-148 \u2014 These two members are variants of one another: 51 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":"printing/ios/printing/Sources/printing/PrintingPlugin.swift"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b7c0136fa4d242881efb7880a43efa350f57d00d4809aedbbad9ebb6490081"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): pdf/lib/src/svg/image.dart:45-115 | pdf/lib/src/svg/path.dart:59-112 | pdf/lib/src/svg/path.dart:114-149 | pdf/lib/src/svg/path.dart:151-192 | pdf/lib/src/svg/path.dart:231-271 | pdf/lib/src/svg/text.dart:46-116 | pdf/lib/src/svg/use.dart:41-99 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 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. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/svg/image.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfffac5998f2000de2fa4d00a6c526cbb2253ec0ab7e4ea129abe6c957f2694"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): printing/ios/printing/Sources/printing/PrintJob.swift:421-476 | printing/macos/printing/Sources/printing/PrintJob.swift:287-338 \u2014 These two members are one piece of code written twice and then edited apart: 52 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":"printing/ios/printing/Sources/printing/PrintJob.swift"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d48a8bc9ab68cc471987b2c57ae024a17f9bbe72b47095edf1a710defc34c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (74 corresponding lines): pdf/lib/src/svg/gradient.dart:109-182 | pdf/lib/src/svg/gradient.dart:261-368 \u2014 These two members are one piece of code written twice and then edited apart: 74 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":"pdf/lib/src/svg/gradient.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3605761e7a46e8794e5abe8d63a6f038a7a01e4ef2c8b579f2f223ea49161e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): pdf/lib/src/widgets/chart/grid_axis.dart:290-333 | pdf/lib/src/widgets/chart/grid_axis.dart:335-375 \u2014 These two members are one piece of code written twice and then edited apart: 41 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":"pdf/lib/src/widgets/chart/grid_axis.dart"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b558fa0cf505a133c9b82d2b1f5f26872e77c6c990026082fabe60cae7880cb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): pdf/lib/src/widgets/basic.dart:568-604 | pdf/lib/src/widgets/decoration.dart:48-80 \u2014 These two members are one piece of code written twice and then edited apart: 33 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":"pdf/lib/src/widgets/basic.dart"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66ac12b525a3a4777777183810add2dd6869312e9ae32fef0ed5d058db890f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): pdf/lib/src/widgets/annotations.dart:260-295 | pdf/lib/src/widgets/annotations.dart:326-366 \u2014 These two members are one piece of code written twice and then edited apart: 36 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":"pdf/lib/src/widgets/annotations.dart"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84e39c00c70c1ccd87747252ea2dd5dfa10a56bbf148cf0117640738778730e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): pdf/lib/src/svg/gradient.dart:203-239 | pdf/lib/src/svg/gradient.dart:393-431 \u2014 These two members are one piece of code written twice and then edited apart: 37 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":"pdf/lib/src/svg/gradient.dart"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a565e8fcdd8a51d77d3bf2971dc691e381dcb9f07bb7507d111c79d1e7115ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): pdf/lib/src/pdf/raster.dart:41-69 | pdf/lib/src/pdf/raster.dart:71-98 \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":"pdf/lib/src/pdf/raster.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38328d6f9d6e2c4b85b5cc51b67a160acec5fc14042bcf1cfc6788d00f43dfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): pdf/lib/src/widgets/decoration.dart:129-163 | pdf/lib/src/widgets/decoration.dart:198-238 \u2014 These two members are one piece of code written twice and then edited apart: 35 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":"pdf/lib/src/widgets/decoration.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8150a9186ab294ead729ad39f9b4b1e5dded1a70d2de3e22956f53704b42d42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): printing/ios/printing/Sources/printing/PrintingPlugin.swift:155-177 | printing/macos/printing/Sources/printing/PrintingPlugin.swift:155-175 \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":"printing/ios/printing/Sources/printing/PrintingPlugin.swift"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"999520162c5e86c3bee19f7e871bd324adc98fd4e5d52bfbc73526936107eeca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): pdf/lib/src/widgets/forms.dart:105-139 | pdf/lib/src/widgets/forms.dart:388-432 \u2014 These two members are one piece of code written twice and then edited apart: 35 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":"pdf/lib/src/widgets/forms.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abc348e774d2c9fa507f68f67904b4ad8e97dc1993fb9778029c4339f870026"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): pdf/lib/src/svg/clip_path.dart:29-53 | pdf/lib/src/svg/mask_path.dart:29-54 \u2014 These two members are one piece of code written twice and then edited apart: 25 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":"pdf/lib/src/svg/clip_path.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc78f6b819753542d57d3c5959ea2322c496965c2cb86dcbe8018e124028fa63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): pdf/lib/src/widgets/document.dart:27-69 | pdf/lib/src/widgets/document.dart:71-106 \u2014 These two members are one piece of code written twice and then edited apart: 36 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":"pdf/lib/src/widgets/document.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e70fbe1205ee52bdee1b44da202d685bff1ef151a7c181e225baa4f195c8b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): pdf/lib/src/widgets/shape.dart:37-70 | pdf/lib/src/widgets/shape.dart:89-117 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"pdf/lib/src/widgets/shape.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bec1249107d511a50e11ed8e209a370551791bbaab1b0a177430925c5a3fc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): pdf/lib/src/widgets/basic.dart:935-962 | pdf/lib/src/widgets/basic.dart:996-1023 \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":"pdf/lib/src/widgets/basic.dart"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c69ec5c327720a0fb1c5a6433b8cf1ed2b7057db7a194b950590fe80359eac2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): pdf/lib/src/widgets/text.dart:323-345 | pdf/lib/src/widgets/text.dart:394-416 \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":"pdf/lib/src/widgets/text.dart"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ad6a1065b3c1d786b1014bf37d71a883fa4e4f7076302a61e5b78b1c1718d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): pdf/lib/src/svg/group.dart:37-59 | pdf/lib/src/svg/symbol.dart:36-57 \u2014 These two members are one piece of code written twice and then edited apart: 22 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":"pdf/lib/src/svg/group.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fcaea353d879a461fcd653b0d3a2062465385b6861151b862fc13fccec2ff8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): pdf/lib/src/widgets/chart/grid_cartesian.dart:104-127 | pdf/lib/src/widgets/chart/grid_radial.dart:68-85 \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":"pdf/lib/src/widgets/chart/grid_cartesian.dart"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6226a28a11af50c410d4710304f314db5fa87cbed8052ccd855220c682bbf9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): pdf/lib/src/svg/group.dart:77-92 | pdf/lib/src/svg/text.dart:207-220 \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":"pdf/lib/src/svg/group.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b2087295564fd7f75a284ed55cc86e5afd639a070d13d50ff081ae21b3a01f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): pdf/lib/src/widgets/basic.dart:52-71 | pdf/lib/src/widgets/basic.dart:549-566 \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":"pdf/lib/src/widgets/basic.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4303e3e2b1b4246c980d3f5c487afe277da91a94cfe707107ab585b417a74f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): pdf/lib/src/svg/gradient.dart:189-201 | pdf/lib/src/svg/gradient.dart:377-391 \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":"pdf/lib/src/svg/gradient.dart"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f968fc27bd4666c695ab65290987a6b390fd67f595d1bf3a78609ef196e4bec5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): pdf/lib/src/widgets/basic.dart:887-901 | pdf/lib/src/widgets/clip.dart:34-49 | pdf/lib/src/widgets/clip.dart:75-97 | pdf/lib/src/widgets/widget.dart:247-260 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/basic.dart"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe1d79436c6f01b767a5c5626317c8ab82391200df4f70b63d2838a1fe04176"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): pdf/lib/src/widgets/chart/line_chart.dart:133-158 | pdf/lib/src/widgets/chart/pie_chart.dart:404-424 \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":"pdf/lib/src/widgets/chart/line_chart.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7ffd1f2fab3bf5712c7d4833c88b2d2707bde339ff50f564960e36af4fd2d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): pdf/lib/src/widgets/flex.dart:534-548 | pdf/lib/src/widgets/grid_view.dart:355-372 | pdf/lib/src/widgets/partitions.dart:212-225 | pdf/lib/src/widgets/stack.dart:289-307 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/flex.dart"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c72d2eb74d33d0e6ee010a598b695f267d1958fb03d0d99e24bac32adeb97ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): pdf/lib/src/widgets/basic.dart:501-521 | pdf/lib/src/widgets/basic.dart:688-701 | pdf/lib/src/widgets/widget.dart:297-310 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 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":"pdf/lib/src/widgets/basic.dart"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"e430cfdde95e13c05556c8d8138e3f3cccce0731adf39fbbfda470763ac61e88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): pdf/lib/src/svg/path.dart:38-57 | pdf/lib/src/svg/path.dart:194-211 | pdf/lib/src/svg/path.dart:213-229 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 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":"pdf/lib/src/svg/path.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e75eed0671d2f5480f4b7c66a0d1add7ed1463837ff2286c671a73024927eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): pdf/lib/src/widgets/box_border.dart:95-110 | pdf/lib/src/widgets/box_border.dart:112-126 \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":"pdf/lib/src/widgets/box_border.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be29473044b9f8c62c6e841415add5a9ee768f257b8c0e038f19d8f69d19f57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): pdf/lib/src/pdf/font/ttf_parser.dart:297-306 | pdf/lib/src/pdf/font/ttf_parser.dart:354-364 \u2014 These two members are one piece of code written twice and then edited apart: 10 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":"pdf/lib/src/pdf/font/ttf_parser.dart"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74b9d58a0b243263738ce2043bf5a7f804a1c553976cf73ff7442ebe5781a82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): pdf/lib/src/widgets/annotations.dart:118-132 | pdf/lib/src/widgets/annotations.dart:163-179 | pdf/lib/src/widgets/annotations.dart:210-226 \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":"pdf/lib/src/widgets/annotations.dart"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c611f7b5c2db52f664b918c0f394325219e13dbd6056a5f7a0feba9cc7a3266"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): printing/lib/src/preview/custom.dart:169-186 | printing/lib/src/preview/pdf_preview.dart:317-332 \u2014 These two members are one piece of code written twice and then edited apart: 16 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":"printing/lib/src/preview/custom.dart"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22b60ce9e4f9d4a2f39d09e8beaccb687bdf2f216a6524dcd22a97327395f76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): pdf/lib/src/widgets/geometry.dart:249-261 | pdf/lib/src/widgets/geometry.dart:438-450 \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":"pdf/lib/src/widgets/geometry.dart"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d7a2d47ed4ff02216ddbaf5259271c418fbe53e0c77d3a060bdc906cf6f7ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): pdf/lib/src/widgets/geometry.dart:492-511 | pdf/lib/src/widgets/geometry.dart:656-665 \u2014 These two members are one piece of code written twice and then edited apart: 10 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":"pdf/lib/src/widgets/geometry.dart"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"506bcc0b6c894a7ca031230f0dbf4df40036cf387ffcaa814e8bc6c05a65a3c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): pdf/lib/src/pdf/color.dart:282-295 | pdf/lib/src/widgets/box_border.dart:160-172 \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":"pdf/lib/src/pdf/color.dart"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8e74f2a3e8427fe4dc3317a381e16aaeb94187e585a72ec3fa8f1a8f869c46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): printing/ios/printing/Sources/printing/PrintingPlugin.swift:193-201 | printing/ios/printing/Sources/printing/PrintingPlugin.swift:215-225 | printing/macos/printing/Sources/printing/PrintingPlugin.swift:210-218 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 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":"printing/ios/printing/Sources/printing/PrintingPlugin.swift"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"02abeb99d6d67b4c10ec3fad19eb669fa79d2931679882093e24fb63a7d7cbae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): printing/ios/printing/Sources/printing/PrintingPlugin.swift:227-235 | printing/macos/printing/Sources/printing/PrintingPlugin.swift:220-226 \u2014 These two members are one piece of code written twice and then edited apart: 7 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":"printing/ios/printing/Sources/printing/PrintingPlugin.swift"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"129801d247ae6c31b10b81331bb924690db24e5723911859d1dbd2cd8b23d025"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): printing/ios/printing/Sources/printing/PrintingPlugin.swift:204-212 | printing/macos/printing/Sources/printing/PrintingPlugin.swift:201-207 \u2014 These two members are one piece of code written twice and then edited apart: 7 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":"printing/ios/printing/Sources/printing/PrintingPlugin.swift"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14bd46c3658d6bdc5d34583d049d1b0f81ac368eb9558fe3f5fd694c58c294e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): printing/ios/printing/Sources/printing/PrintingPlugin.swift:33-37 | printing/macos/printing/Sources/printing/PrintingPlugin.swift:37-41 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"printing/ios/printing/Sources/printing/PrintingPlugin.swift"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d4504244b743a7de30b36da4a37418f4ef58c75e5b531fb6b8c5e556cd6a1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): pdf/lib/src/widgets/flex.dart:198-205 | pdf/lib/src/widgets/wrap.dart:121-128 \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":"pdf/lib/src/widgets/flex.dart"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"743955fb688defadbac711557a66ca7cc583a387d79136b4f2e8e66e93a2757f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): pdf/lib/src/widgets/flex.dart:207-214 | pdf/lib/src/widgets/wrap.dart:112-119 \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":"pdf/lib/src/widgets/flex.dart"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c35086070f925d7223df577a081b87dbb298ea630dc93a616db5f96885e0eca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): pdf/lib/src/pdf/format/bool.dart:26-29 | pdf/lib/src/pdf/format/indirect.dart:28-31 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"pdf/lib/src/pdf/format/bool.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b2b53caabe4a80313660c66772fbdfbb6e3eb8580fa15311212ef12ab359ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): pdf/lib/src/widgets/geometry.dart:763-793 | pdf/lib/src/widgets/geometry.dart:885-915 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/geometry.dart"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad618175d9d06ee3749966b284d94aca2d6c89e3f3be52518fd1b78adb859e21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): pdf/lib/src/widgets/flex.dart:408-437 | pdf/lib/src/widgets/multi_page.dart:551-580 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/flex.dart"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"3966f7a7bb72ae77998397d336ca4d3d9c1fe5cf05dfbeb66e652fcc8f2a2372"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): pdf/lib/src/pdf/format/xref.dart:147-174 | pdf/lib/src/pdf/format/xref.dart:234-261 \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 \u0060pdf/lib/src/pdf/format/xref.dart:147\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/pdf/format/xref.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"638b101b0afd8755ff8e969b4239f293bcece6d9d46a63e9bf4c260fc2c1fcbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): pdf/lib/src/pdf/format/xref.dart:119-145 | pdf/lib/src/pdf/format/xref.dart:204-230 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060pdf/lib/src/pdf/format/xref.dart:232\u0060 calls \u0060yieldIfNeeded\u0060 and \u0060pdf/lib/src/pdf/format/xref.dart:147\u0060 does not \u2014 after which the two agree again for 3 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":"pdf/lib/src/pdf/format/xref.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc087bb17fc316d663c8973614555b5ab3caa2811bc258c02ff1e91e775c2d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 6): pdf/lib/src/svg/image.dart:46-69 | pdf/lib/src/svg/path.dart:60-83 | pdf/lib/src/svg/path.dart:115-139 | pdf/lib/src/svg/path.dart:152-175 | pdf/lib/src/svg/path.dart:232-255 | pdf/lib/src/svg/use.dart:42-65 \u2014 there are 6 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pdf/lib/src/svg/image.dart:46\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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":"pdf/lib/src/svg/image.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1515bc1cb27f6f56035358f6386180893c271f7ed6afdd7f3b933dce9c28d83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): pdf/lib/src/svg/gradient.dart:203-225 | pdf/lib/src/svg/gradient.dart:393-415 \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 \u0060pdf/lib/src/svg/gradient.dart:203\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/svg/gradient.dart"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c761b80b0e2cd5e06cd3b2c6e2c9bfd6eaef27e38fd0f70a16ccb1d2c0dcfcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): pdf/lib/src/widgets/basic.dart:110-130 | pdf/lib/src/widgets/grid_view.dart:269-290 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/basic.dart"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c823508fdc0a22130a1bb8ce5e14c77c60eebccce7818c0b78207bd7ef22f6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): pdf/lib/src/widgets/wrap.dart:279-300 | pdf/lib/src/widgets/wrap.dart:322-343 \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 \u0060pdf/lib/src/widgets/wrap.dart:279\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/wrap.dart"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7f3cb5a329191a9c5af589dceb2042ada15b5417c619a429666e14bbe22bed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): pdf/lib/src/widgets/document.dart:46-65 | pdf/lib/src/widgets/document.dart:85-105 \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 \u0060pdf/lib/src/widgets/document.dart:46\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/document.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"6504fb52453d244c5415edbb4f300e39fc19bc9ff43acc6b782a4f8cdd50b427"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): pdf/lib/src/widgets/forms.dart:119-139 | pdf/lib/src/widgets/forms.dart:412-432 \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 \u0060pdf/lib/src/widgets/forms.dart:119\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060pdf/lib/src/widgets/forms.dart:409\u0060 calls \u0060getFont\u0060 and \u0060pdf/lib/src/widgets/forms.dart:118\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":"pdf/lib/src/widgets/forms.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"582d6eaa6a6f659fffcc47c9d0847e21c48a461cfc62bba68304bf681517f08c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): printing/lib/src/preview/raster.dart:129-148 | printing/lib/src/preview/raster.dart:213-233 \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 \u0060printing/lib/src/preview/raster.dart:129\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":"printing/lib/src/preview/raster.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5541c5666d1680e72f9069c1ab879eca812aca8c085fb112d17005f4da61be89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 7): pdf/lib/src/svg/image.dart:49-66 | pdf/lib/src/svg/path.dart:63-80 | pdf/lib/src/svg/path.dart:118-135 | pdf/lib/src/svg/path.dart:155-172 | pdf/lib/src/svg/path.dart:235-252 | pdf/lib/src/svg/text.dart:52-65 | pdf/lib/src/svg/use.dart:45-62 \u2014 there are 7 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 7 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pdf/lib/src/svg/image.dart:49\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. 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":"pdf/lib/src/svg/image.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2793116d4ca94eb3d16c4c6b41ed7e92dda8c372365404ee20e2ee5e61a53771"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): pdf/lib/src/pdf/graphics.dart:645-661 | pdf/lib/src/pdf/graphics.dart:1255-1271 \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":"pdf/lib/src/pdf/graphics.dart"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"63400e8e41599619e59385486d4aa4fd85f83be2a36e8f19e711698feff396c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): pdf/lib/src/widgets/chart/grid_cartesian.dart:104-120 | pdf/lib/src/widgets/chart/grid_radial.dart:68-84 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pdf/lib/src/widgets/chart/grid_cartesian.dart:104\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":"pdf/lib/src/widgets/chart/grid_cartesian.dart"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ad4f302a17c02308c7b48436838e4a817da896f469b19619d064fbf13ba62c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): pdf/lib/src/widgets/table.dart:278-294 | pdf/lib/src/widgets/table_helper.dart:59-75 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/table.dart"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba5a2a8203cde3d9850b558358d13d50727c5c83f578a8945996a54b0f25e67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): pdf/lib/src/svg/gradient.dart:115-130 | pdf/lib/src/svg/gradient.dart:299-314 \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 \u0060pdf/lib/src/svg/gradient.dart:115\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":"pdf/lib/src/svg/gradient.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54a17635861f1a26a2f9138ac15704ad0076e4e49001d92493ffc50015af6c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): pdf/lib/src/widgets/shape.dart:37-52 | pdf/lib/src/widgets/shape.dart:89-104 \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 \u0060pdf/lib/src/widgets/shape.dart:37\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":"pdf/lib/src/widgets/shape.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bc57f66aaf34c047af63791e05b82df1875e4c3f527b917809f57372424829"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): pdf/lib/src/widgets/table.dart:544-558 | pdf/lib/src/widgets/table.dart:581-596 \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 \u0060pdf/lib/src/widgets/table.dart:544\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":"pdf/lib/src/widgets/table.dart"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de54a2ea0765bb866e8ce5912fab07a753fda76fa3b65c7e35454cecea3e38b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): pdf/lib/src/svg/color.dart:45-55 | pdf/lib/src/svg/color.dart:74-88 \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 \u0060pdf/lib/src/svg/color.dart:45\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/svg/color.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22111e4298f83c3c8336bc0e836b523eef8edda9218a47e1de74c11eedbc14e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): pdf/lib/src/widgets/decoration.dart:296-309 | pdf/lib/src/widgets/decoration.dart:315-328 | pdf/lib/src/widgets/decoration.dart:336-349 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pdf/lib/src/widgets/decoration.dart:296\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":"pdf/lib/src/widgets/decoration.dart"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"805eed3e3e046cc3fa424a6d80738cf0a2a4168cfb4f9dd199b213c70ffdf6ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pdf/lib/src/pdf/format/xref.dart:187-199 | pdf/lib/src/pdf/format/xref.dart:278-290 \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 \u0060pdf/lib/src/pdf/format/xref.dart:187\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060pdf/lib/src/pdf/format/xref.dart:276\u0060 calls \u0060stop\u0060 and \u0060pdf/lib/src/pdf/format/xref.dart:185\u0060 does not \u2014 after which the two agree again for 4 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":"pdf/lib/src/pdf/format/xref.dart"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"7762146c2797a274ae22578419d041b9848a2fa95619184fe2c7396710faee16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pdf/lib/src/widgets/decoration.dart:129-141 | pdf/lib/src/widgets/decoration.dart:198-210 \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 \u0060pdf/lib/src/widgets/decoration.dart:129\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 after the matched lines, \u0060pdf/lib/src/widgets/decoration.dart:214\u0060 calls \u0060min\u0060 and \u0060pdf/lib/src/widgets/decoration.dart:142\u0060 does not \u2014 after which the two agree again for 3 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":"pdf/lib/src/widgets/decoration.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1442500958e7d0cb5a81b673fe6e6a210601f540adca8a3e83f67c0305bfacd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): pdf/lib/src/widgets/multi_page.dart:464-476 | pdf/lib/src/widgets/multi_page.dart:663-675 \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 \u0060pdf/lib/src/widgets/multi_page.dart:464\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":"pdf/lib/src/widgets/multi_page.dart"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bc15eba0347dc090679bc0df3bcad904ad625fa2df7da61d252c5b54246b1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pdf/lib/src/pdf/raster.dart:42-53 | pdf/lib/src/pdf/raster.dart:72-83 \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 \u0060pdf/lib/src/pdf/raster.dart:42\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/pdf/raster.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"debe7c9e131e0d2b348c199b487c0c5ddf8d856397db6155ac5776bfeb4e6f0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pdf/lib/src/svg/color.dart:57-68 | pdf/lib/src/svg/color.dart:73-84 \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 \u0060pdf/lib/src/svg/color.dart:57\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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/svg/color.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b556fd3e1e9fcb6d1f59a3dceb3fb1528e8fc55c61bf5971fea3fb6406526287"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pdf/lib/src/widgets/annotations.dart:438-449 | pdf/lib/src/widgets/forms.dart:400-411 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/annotations.dart"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd7e4a13e29ec5b51d8a78c9a8635e6523b01f32f9c193efbd2de78b2e0d657"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): pdf/lib/src/widgets/text.dart:189-200 | pdf/lib/src/widgets/text.dart:227-238 \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 \u0060pdf/lib/src/widgets/text.dart:189\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":"pdf/lib/src/widgets/text.dart"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f521126027a00fe920a65bdc98365346f08768c10e6c4b63432bcdb3d7bd47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pdf/lib/src/widgets/basic.dart:688-698 | pdf/lib/src/widgets/widget.dart:297-307 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pdf/lib/src/widgets/basic.dart:688\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":"pdf/lib/src/widgets/basic.dart"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"448544e141b12eb3479fd0fef6e5db48830cd0ee72d106f643d3b809e6ba337a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pdf/lib/src/widgets/basic.dart:938-948 | pdf/lib/src/widgets/basic.dart:999-1009 \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 \u0060pdf/lib/src/widgets/basic.dart:938\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/basic.dart"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae809c37119286991b28250de9698330f5acdfeea2bc3c943b1bfc7407e83e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): pdf/lib/src/widgets/chart/pie_chart.dart:313-323 | pdf/lib/src/widgets/chart/pie_chart.dart:344-354 \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":"pdf/lib/src/widgets/chart/pie_chart.dart"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbe0ecf2a564cfc1c11893c08fbac50092e2498918b80f12c7f10df5921ab94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pdf/lib/src/pdf/raster.dart:61-69 | pdf/lib/src/pdf/raster.dart:90-98 \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 \u0060pdf/lib/src/pdf/raster.dart:61\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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/pdf/raster.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffab69e7f031c6393515ed3be86bc42ffa6c86601f27273e55b1935179bd175"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pdf/lib/src/svg/group.dart:84-92 | pdf/lib/src/svg/text.dart:212-220 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pdf/lib/src/svg/group.dart:84\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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/svg/group.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"59cb7ad008d8ac25203557c7ee3f3dda0732e2551a3a5fc70f2c7d2375a6e9a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pdf/lib/src/widgets/flex.dart:534-542 | pdf/lib/src/widgets/grid_view.dart:355-363 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pdf/lib/src/widgets/flex.dart:534\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":"pdf/lib/src/widgets/flex.dart"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d759426099e77a5a428b4521fefe84e6ac0798e17b7e1d0df1b412833e03c79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): pdf/lib/src/widgets/text.dart:204-212 | pdf/lib/src/widgets/text.dart:223-231 \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 \u0060pdf/lib/src/widgets/text.dart:204\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":"pdf/lib/src/widgets/text.dart"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a762cc2d4149e0d8e89c8c4060803cd0328c1134e5fd5c77a65dea202c142597"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pdf/lib/src/svg/path.dart:142-149 | pdf/lib/src/svg/path.dart:185-192 \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 \u0060pdf/lib/src/svg/path.dart:142\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/svg/path.dart"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d0e4cc77fc56b5b0fc3194a71be87b12ec2daf3a6f19244d1b7a4423fe5d0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 10): pdf/lib/src/widgets/barcode.dart:57-64 | pdf/lib/src/widgets/chart/bar_chart.dart:95-102 | pdf/lib/src/widgets/chart/chart.dart:137-144 | pdf/lib/src/widgets/chart/line_chart.dart:72-79 | pdf/lib/src/widgets/chart/point_chart.dart:67-74 | pdf/lib/src/widgets/progress.dart:43-50 | pdf/lib/src/widgets/shape.dart:28-35 | pdf/lib/src/widgets/shape.dart:80-87 | pdf/lib/src/widgets/shape.dart:135-142 | pdf/lib/src/widgets/shape.dart:199-206 \u2014 there are 10 copies across 7 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 10 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/barcode.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bd9ea35f58299ee168dbcdf583fe5c5065e39c9534bfbeb93eaf3d50163f99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): pdf/lib/src/widgets/clip.dart:25-32 | pdf/lib/src/widgets/widget.dart:215-222 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/clip.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ca8f2cc38124f01048ad1c740cd49031b9f7b941e5f2f05c40f1cc4dbe3639"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): printing/ios/printing/Sources/printing/PrintJob.swift:440-461 | printing/macos/printing/Sources/printing/PrintJob.swift:303-324 \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 \u0060printing/ios/printing/Sources/printing/PrintJob.swift:440\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":"printing/ios/printing/Sources/printing/PrintJob.swift"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60869cbaffcd421d7d9d55a458a585a13e0e3f392ee526a2a7abcbcced890d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): printing/ios/printing/Sources/printing/PrintingPlugin.swift:110-126 | printing/macos/printing/Sources/printing/PrintingPlugin.swift:114-130 \u2014 before extracting anything, compare \u0060printing/ios/printing/Sources/printing/PrintingPlugin.swift\u0060 and \u0060printing/macos/printing/Sources/printing/PrintingPlugin.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 71 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":"printing/ios/printing/Sources/printing/PrintingPlugin.swift"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"492e4f313ffe7387b6ba3b98c0abce71e26b27ce064cd15c57fe3ba5136d3526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): printing/ios/printing/Sources/printing/PrintJob.swift:421-436 | printing/macos/printing/Sources/printing/PrintJob.swift:287-302 \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 \u0060printing/ios/printing/Sources/printing/PrintJob.swift:421\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":"printing/ios/printing/Sources/printing/PrintJob.swift"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf7ebebdb57fb49a214eb5440dab8209ae51285194d05ca361e3960411c28bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): printing/ios/printing/Sources/printing/PrintJob.swift:463-476 | printing/macos/printing/Sources/printing/PrintJob.swift:325-338 \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 \u0060printing/ios/printing/Sources/printing/PrintJob.swift:463\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060printing/ios/printing/Sources/printing/PrintJob.swift:462\u0060 calls \u0060translateBy\u0060 and \u0060printing/macos/printing/Sources/printing/PrintJob.swift:324\u0060 does not \u2014 after which the two agree again for 4 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":"printing/ios/printing/Sources/printing/PrintJob.swift"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0172310b27b49e60f747c8895cb6f43e5232eb9fa8d7de7d636ef221a8d6aa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): printing/ios/printing/Sources/printing/PrintJob.swift:127-136 | printing/ios/printing/Sources/printing/PrintJob.swift:236-245 \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":"printing/ios/printing/Sources/printing/PrintJob.swift"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c5292cc0d966eab90024645ceb2b42b1045eaa1b8ac9da3f804aebda9fae9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): printing/ios/printing/Sources/printing/PrintingPlugin.swift:134-148 | printing/macos/printing/Sources/printing/PrintingPlugin.swift:134-148 \u2014 before extracting anything, compare \u0060printing/ios/printing/Sources/printing/PrintingPlugin.swift\u0060 and \u0060printing/macos/printing/Sources/printing/PrintingPlugin.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 71 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 \u0060printing/ios/printing/Sources/printing/PrintingPlugin.swift:134\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":"printing/ios/printing/Sources/printing/PrintingPlugin.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cebd8a040bd75a8668cd296ef62a4ab7983dada2011bc67f37a6f9e40edb44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): printing/ios/printing/Sources/printing/PrintingPlugin.swift:155-164 | printing/macos/printing/Sources/printing/PrintingPlugin.swift:155-164 \u2014 before extracting anything, compare \u0060printing/ios/printing/Sources/printing/PrintingPlugin.swift\u0060 and \u0060printing/macos/printing/Sources/printing/PrintingPlugin.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 71 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 \u0060printing/ios/printing/Sources/printing/PrintingPlugin.swift:155\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":"printing/ios/printing/Sources/printing/PrintingPlugin.swift"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"518bd18ed3751ce25f11373b948b168934e6e784cf495bac0ef99a92f9f185e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): printing/ios/printing/Sources/printing/PrintingPlugin.swift:168-176 | printing/macos/printing/Sources/printing/PrintingPlugin.swift:166-175 \u2014 before extracting anything, compare \u0060printing/ios/printing/Sources/printing/PrintingPlugin.swift\u0060 and \u0060printing/macos/printing/Sources/printing/PrintingPlugin.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 71 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 \u0060printing/ios/printing/Sources/printing/PrintingPlugin.swift:168\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":"printing/ios/printing/Sources/printing/PrintingPlugin.swift"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"41468a4289284f793e032166e11e59ac4a1f6474664e221d7504beadc9047593"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 3): printing/ios/printing/Sources/printing/PrintingPlugin.swift:88-92 | printing/ios/printing/Sources/printing/PrintingPlugin.swift:129-130 | printing/macos/printing/Sources/printing/PrintingPlugin.swift:93-97 \u2014 before extracting anything, compare \u0060printing/ios/printing/Sources/printing/PrintingPlugin.swift\u0060 and \u0060printing/macos/printing/Sources/printing/PrintingPlugin.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 71 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 \u0060printing/ios/printing/Sources/printing/PrintingPlugin.swift:88\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":"printing/ios/printing/Sources/printing/PrintingPlugin.swift"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c37ae4cfd2bf82831ecab2fde72f141aa9ca9d4e1a178d675a489c66a489d1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): printing/ios/printing/Sources/printing/PrintingPlugin.swift:40-47 | printing/macos/printing/Sources/printing/PrintingPlugin.swift:44-51 \u2014 before extracting anything, compare \u0060printing/ios/printing/Sources/printing/PrintingPlugin.swift\u0060 and \u0060printing/macos/printing/Sources/printing/PrintingPlugin.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 71 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 \u0060printing/ios/printing/Sources/printing/PrintingPlugin.swift:40\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":"printing/ios/printing/Sources/printing/PrintingPlugin.swift"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ab226334c38f0bb1f2e523dada832d9ad416a9d8a9853072ce3377bebdae1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): printing/ios/printing/Sources/printing/PrintingPlugin.swift:99-104 | printing/macos/printing/Sources/printing/PrintingPlugin.swift:102-107 \u2014 before extracting anything, compare \u0060printing/ios/printing/Sources/printing/PrintingPlugin.swift\u0060 and \u0060printing/macos/printing/Sources/printing/PrintingPlugin.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 71 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 \u0060printing/ios/printing/Sources/printing/PrintingPlugin.swift:99\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":"printing/ios/printing/Sources/printing/PrintingPlugin.swift"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f1ca090dc6e9f5b21a87693bd0ed1e188b9b40ca3f9f6b0dba607620ddefe3"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pdf: pdf: abstractness 0.10, instability 0.00, distance 0.90 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3ec7b8975dcb0413761fd6d423aba4bc5201caec28b4b21c3b865c5128b57f9f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PrintingPlugin (LCOM4 6): PrintingPlugin\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"printing/lib/printing_web.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6927534a5a1ad60cd8a157f35c5ba50b021a2013cfcb1a119b12cef0935805"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BorderRadius (LCOM4 6): BorderRadius\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/border_radius.dart"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"6636ef26b59ce4346f9f4ef9abf5fadcc97d09fa949fe2e2ccd101aa281d10ab"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MyAppState (LCOM4 5): MyAppState\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo/lib/app.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7ae6f7400887d19d23045250550322c64120886c68c729f8408b1a63ae42de"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BorderRadiusDirectional (LCOM4 5): BorderRadiusDirectional\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/border_radius.dart"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"5688ec265872e74c0dc9b33c691bf8d4daee39a018591532902e1a5f0572eefc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EdgeInsets (LCOM4 5): EdgeInsets\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/geometry.dart"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1148bb8f8c09600755fd1176c82386e7a5eb776beb93ea91a4f34a4271fbb88"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EdgeInsetsDirectional (LCOM4 4): EdgeInsetsDirectional\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/geometry.dart"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a2a4a877056f692d9d9f3f0767c36d63fe7b3ce65b1c05f5b58ffa39f896f2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _WidgetSpan (LCOM4 4): _WidgetSpan\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/text.dart"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"767ff36ed1a744b0fabaebdeb730ee801dfb161815bbc82061108d2a9b689d1e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PdfPreviewCustomState (LCOM4 4): PdfPreviewCustomState\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"printing/lib/src/preview/custom.dart"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"527d13924b73d0a2c1b5051f9d93e4248f2fca3748b2d23e3f297d59e83485a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: printing/lib/printing_web.dart: printing/lib/printing_web.dart changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is PrintingPlugin.layoutPdf at line 120), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: update NotoColorEmoji font URL and improve analysis options exclusions\u201D; \u201Cfix(printing): update pdf.js to 6.2.108 for [GHSA redacted]\u201D; \u201Cfix(printing): copy PDF bytes before pdf.js raster on web\u201D; \u201CFix to access _dartPdfJsBaseUrl as dart String\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-16 16:23:50 -03:00\u0027 --until=\u00272026-10-14 16:23:50 -03:00\u0027 --full-history --no-merges -- printing/lib/printing_web.dart\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":"printing/lib/printing_web.dart"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"80635db842ee52a5d59b2e537d03145ae9caf3c996d7c0b3ab50fdb55f57178d"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060widget_wrapper\u0060 is a published pub package (\u0060pubspec.yaml\u0060 without \u0060publish_to: none\u0060) and neither \u0060widget_wrapper/README.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":"widget_wrapper/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"707eadc1fffeb9900d3d66e93b4852e8c2402beb3dd8a816cb5575a97253a6de"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060unitsPerEm\u0060 spells \u0060Em\u0060 where 18 names in the project spell it \u0060EM\u0060: 18 of 19 names in project repository.src spell the token \u0060EM\u0060 (18 of 19; unit: names in project repository.src containing \u0060EM\u0060). Peers: PdfGoogleFonts.rEMThin (printing/lib/src/fonts/gfonts.dart:57104); PdfGoogleFonts.rEMExtraLight (printing/lib/src/fonts/gfonts.dart:57114); PdfGoogleFonts.rEMLight (printing/lib/src/fonts/gfonts.dart:57124); PdfGoogleFonts.rEMRegular (printing/lib/src/fonts/gfonts.dart:57134); PdfGoogleFonts.rEMMedium (printing/lib/src/fonts/gfonts.dart:57144). Rename to \u0060unitsPerEM\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/pdf/font/ttf_parser.dart"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fd76ba1a737c1af246f2d4e842d5152a2e8ba3550c694d820235f86d242460"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060pdf\u0060 (23749 LoC, 277 module-visible types across 8 directories) overshoots its size bounds. 1 of 6 build unit(s) (Gradle, SwiftPM, pub) overshoot their size bounds, lowering Project Cohesion to 6.7/10. 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":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/pubspec.yaml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7abba025281fa4df725d82043b678c5c58e5b4aa8cc46018156aba99cf079e"}},{"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":"8cf3233afd19f3c47bdddb8fcbffe11fc493a753545f13c523df75fffbd0e61c"},"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":"afd4d0a2b93ab00b73b53cfabe77faf406572ec2bc7a5824121c32ab593610fc"},"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":"64683ce43016c51ce86e32d65857fb620be5e7e46fd57389c43503107b9e263f"},"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":"73b1cf243b863c755e579421798ec09f51de0ff1593b0c2960c98bfd80ae57fb"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"7972207f947978a35699ebdf2b4d3ae490c63cfe66258cd09697e8983b45ec86"},"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":"fa88cc83cd5bbe17b8fde842aa577d5912152abb73b153a2bfb41f3c81a40274"},"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":"75735bb6800addd65b11ce9a7691b9436d990b1bc128ed2a3e0b07ea483ee073"},"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":"e4a678004cfb81945c81675331df8a336b4bc7f4450db3a8ab9aa399c11214c5"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"b27b074f88364f31314718614c132b94f6081b79c7488977d8edafb88186e385"},"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":"7c335e0cbf454d5de475910fe04ddb38f7cad8318a4a1eef9dd070be75704599"},"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":"ab19a21129ad7cbe1d334424033a65e3c568d5ba02e617e6fc824a19c302c9f2"},"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":"582d317868639efbc8cf6dbe27f1b4818ab6b37a70d7df95de6033e650a6f873"},"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":"c01da220913d068afe1a34f22980e3e8b8e151ab46858841b6bbc3cf416e6299"},"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":"a8c8b4a68a316fcf5943abc1ffe77eaf7c544ac72b60741e4895ea1c864a6a11"},"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":"5e72a7ec1a6b615d6027a1666680044a0a2ac849ffb9b53df479ff5d3749775e"},"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":"be1a93d3982c222ce107bbfd7225140eaa84e1ca8988f5d07453efcf6fbd89b1"},"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":"8521b9a20d8ff99e9abe3eeca7c0f04841388c581c06ebed9a0897fe241f0fc9"},"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":"c136f7563e0d076716c84364bfc58d96cd99d025ca5a18908e1731aadbc19436"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"c48a53bd2db7030ac926551b1c89a327cbf50e6113abaae5140c3e6c7acda6e9"},"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":"521488e9fe399aae2a3c06f01c3b13b4eeaa56f4fa7c286260dd1573586554e8"},"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":"224f9d4c8f5c2a2d203af5846bffb2b4426225c66e5b0f1d4626ed400dd154b7"},"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":"218d3f16b0b1f01e3359dcc9b04347e8b77a880c4db861f72f78791967aafb32"},"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":"ab8d83539c5ebe567cb6deae98d392d6617f9ea4001a34a9a21fb3f393c0be8f"},"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":"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":"83e1dc82ab6536d6646feeb1dc6db6c38e89cacdfe4e1339ca18ebc2ba97a7a4"},"taxa":[{"id":"CICD-SEC-5","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":"fc5445989f2ed1a6cdd8ba1d81af8788542d376cfec71d00d96fee7fbe6ee193"},"taxa":[{"id":"CICD-SEC-5","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":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060paintBackground\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/widgets/chart/grid_radial.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b25485c6a6c45a671ec12c8b72b8d562c183c074ebcf53655feedd8760ac412"}},{"ruleId":"IC1","level":"note","message":{"text":"Member throws UnsupportedError: \u0060convertHtml\u0060\u0027s body only throws an UnsupportedError or an UnimplementedError that gives its reason \u2014 sometimes a deliberate refusal, often an unfinished stub. Confirm it\u0027s intentional."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"printing/lib/printing_web.dart"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5ae4929db421f056e6f46ee23f146652039382796ec6b56d9aafbffa037eaa"}},{"ruleId":"IC1","level":"note","message":{"text":"Member throws UnsupportedError: \u0060listPrinters\u0060\u0027s body only throws an UnsupportedError or an UnimplementedError that gives its reason \u2014 sometimes a deliberate refusal, often an unfinished stub. Confirm it\u0027s intentional."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"printing/lib/printing_web.dart"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"420c9fbaa0e54ec59c6eb1cd6b344c4d0311ef2e0f83177f85198039bc27d500"}},{"ruleId":"IC1","level":"note","message":{"text":"Member throws UnsupportedError: \u0060pickPrinter\u0060\u0027s body only throws an UnsupportedError or an UnimplementedError that gives its reason \u2014 sometimes a deliberate refusal, often an unfinished stub. Confirm it\u0027s intentional."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"printing/lib/printing_web.dart"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"392467e9e265237d1213a3eb9040a173d0b216c3c626604fed439e9d4353af38"}},{"ruleId":"M1","level":"note","message":{"text":"Thin README: The root README is 87 words, against a bar of 120. Of the three newcomer-critical sections this check looks for by heading, in the README and in the repository documents it links, it found no a build/run or getting-started section, no a testing section, no an architecture or project-map section. Sections are matched on HEADING text only, so material written under a heading this check does not recognise \u2014 or with no heading at all \u2014 is not seen and this row may understate what the document covers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88b11295dc6ac6146c259ace6043143959f96dc98628f8c8578b6c5f95b8149"}},{"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":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add the Dart analyzer\u0027s security lints plus \u0060semgrep --config=auto\u0060 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/dart.yaml"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060demo/android/build.gradle\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo/android/build.gradle"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"804c75b5096443918a8e6d2931921cb56d36c5ce38a26e6c440393d9d45b2dcb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060printingInfo != null \u0026\u0026 !printingInfo.canRaster\u0060 appears character-identically in 2 files \u2014 printing/lib/src/preview/custom.dart, printing/lib/src/preview/raster.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"printing/lib/src/preview/custom.dart"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf5a6544995944be26fffdf60b0c835488bc05d2cfbdf87fbffe16b69d16771"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060SvgLinearGradient.fromXml\u0060 is public and takes \u0060XmlElement element\u0060 from its caller, and it calls itself at line 176 (\u0060SvgLinearGradient.fromXml\u0060) with a piece of \u0060element\u0060 \u2014 and nowhere in \u0060SvgLinearGradient.fromXml\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. \u0060jsonDecode\u0060 sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws \u0060StackOverflowError\u0060 from about 20,000 levels \u2014 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser\u0027s stack). That is an \u0060Error\u0060, not an \u0060Exception\u0060: an \u0060on Exception catch\u0060 around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through \u0060SvgLinearGradient.fromXml\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/svg/gradient.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e8d1141fd115948a95597964dec3b1544c47f3aeadc30e7f83d16fdc42be9d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060SvgRadialGradient.fromXml\u0060 is public and takes \u0060XmlElement element\u0060 from its caller, and it calls itself at line 362 (\u0060SvgRadialGradient.fromXml\u0060) with a piece of \u0060element\u0060 \u2014 and nowhere in \u0060SvgRadialGradient.fromXml\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. \u0060jsonDecode\u0060 sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws \u0060StackOverflowError\u0060 from about 20,000 levels \u2014 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser\u0027s stack). That is an \u0060Error\u0060, not an \u0060Exception\u0060: an \u0060on Exception catch\u0060 around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through \u0060SvgRadialGradient.fromXml\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pdf/lib/src/svg/gradient.dart"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dab786aa63bb340768ba7c7c85a0d562f86359a6acb51e0c22232cabdc9b306"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-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-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-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-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"}]}],"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":26,"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."]}]}