{"$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":"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":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"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":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"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":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"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":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"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":"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":"LayerParser.parseJson (cyclomatic 51): LayerParser.parseJson has cyclomatic complexity 51 (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":"lib/src/parser/layer_parser.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e038cd86bd6781cb603a4efa2edf1bd877bb6fbd7b9f488e862f533c04e7737c"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonUtf8Reader._doPeek (cyclomatic 40): JsonUtf8Reader._doPeek has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/moshi/json_utf8_reader.dart"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b415d6a9d86e25c5dcda5524454918bda9acb687f8fb314e3fdcaf6c67fd5d"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonUtf8Reader.peekNumber (cyclomatic 36): JsonUtf8Reader.peekNumber has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/moshi/json_utf8_reader.dart"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2e5a5766b0908d2ea868b80cce0814f35b8125e2f094eb6c090b8113824b73"}},{"ruleId":"D1","level":"warning","message":{"text":"KeyframeParser._parseMultiDimensionalKeyframe (cyclomatic 35): KeyframeParser._parseMultiDimensionalKeyframe has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/keyframe_parser.dart"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfabaaa269cd6beb060df747a6b571a4c42528258020fae2f5b38311d467248c"}},{"ruleId":"D1","level":"warning","message":{"text":"TextLayer._drawTextParagraph (cyclomatic 28): TextLayer._drawTextParagraph has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/model/layer/text_layer.dart"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d8ea32fff7eaee5dba14fa8ad03eb503dfe39b290d707ba816b41c738b2d53"}},{"ruleId":"D1","level":"warning","message":{"text":"AnimatableTransformParser.parse (cyclomatic 26): AnimatableTransformParser.parse has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/animatable_transform_parser.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1b1bcb87dece8c700690c1af4a804d3f4c8c3b9c428b6bab405aed49ab0c12"}},{"ruleId":"D1","level":"warning","message":{"text":"GradientStrokeParser.parse (cyclomatic 26): GradientStrokeParser.parse has cyclomatic complexity 26 (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":"lib/src/parser/gradient_stroke_parser.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1322a248d62a429b6e032de1e3ab3bbe231fbff43d93056ae48fa5dac1d6945"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformKeyframeAnimation.getMatrix (cyclomatic 25): TransformKeyframeAnimation.getMatrix has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/keyframe/transform_keyframe_animation.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3cc564b27880f2ef25a511441b4b8acad166ac5139e0d9e1b717f7a7445c63"}},{"ruleId":"D1","level":"warning","message":{"text":"KeyframeLoop.parse (cyclomatic 22): KeyframeLoop.parse has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/model/keyframe_loop.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eaeb7c76e6d0c212ae01eaec92f079a346c55ca809eeb4a51146f7be54ac857"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonUtf8Reader.readEscapeCharacter (cyclomatic 22): JsonUtf8Reader.readEscapeCharacter has cyclomatic complexity 22 (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":"lib/src/parser/moshi/json_utf8_reader.dart"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcc0615b6fef48cb65a3075f14a39ce9f5211ecca799165b3d1290faaab7f9b"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformKeyframeAnimation.applyValueCallback (cyclomatic 21): TransformKeyframeAnimation.applyValueCallback has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/keyframe/transform_keyframe_animation.dart"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"8358d60265e7dcd1f6280cf3e84bedb3930ede700a153f71ef06326db6ddc6e7"}},{"ruleId":"D1","level":"warning","message":{"text":"PolystarContent._createStarPath (cyclomatic 20): PolystarContent._createStarPath has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/content/polystar_content.dart"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96a95616824672ff945d7bce72d482dd0874bf1d3599df5e816cf60bf66a07e"}},{"ruleId":"D1","level":"warning","message":{"text":"ShapeStrokeParser.parse (cyclomatic 19): ShapeStrokeParser.parse 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":"lib/src/parser/shape_stroke_parser.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4efd2ec3ef84b4fbca323b5e2df146a3fd836ad234d9b048600466f72f84b7a"}},{"ruleId":"D1","level":"warning","message":{"text":"TextLayer.TextLayer (cyclomatic 18): TextLayer.TextLayer has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/model/layer/text_layer.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4884398c565efb010019483156aca9e0d727e668afc1e0d8700200be5de7dc6"}},{"ruleId":"D1","level":"warning","message":{"text":"TextLayer.addValueCallback (cyclomatic 18): TextLayer.addValueCallback 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":"lib/src/model/layer/text_layer.dart"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"23359e50a5aa1a1a3b926cdc0097d15932dee3f0fafb58327929cc64aeafbfa5"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonUtf8Reader.skipValue (cyclomatic 18): JsonUtf8Reader.skipValue 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. This is NOT this file\u0027s highest cyclomatic complexity: JsonUtf8Reader.peek (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/moshi/json_utf8_reader.dart"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c870075c09a563aee8d10f1f11094fc6efeb3ed7215d4f74ab24be74d696239"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseStrokeContent._applyTrimPath (cyclomatic 17): BaseStrokeContent._applyTrimPath 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":"lib/src/animation/content/base_stroke_content.dart"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d826df6b41f07163a81f6e5153492de90f62ad4cef42ec8b4fb60b6315453771"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseKeyframeAnimation._setLoopProgress (cyclomatic 16): BaseKeyframeAnimation._setLoopProgress has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/keyframe/base_keyframe_animation.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"19dace708abfe381b8a29ee342ff08e20bb3d3096fc2e18058568776af60273e"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentData.== (cyclomatic 16): DocumentData.== has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/model/document_data.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8e4b6248e30bef463c907ca4d665fc674dcf961cccd0e18f1cc8c8c3fc7df6"}},{"ruleId":"D1","level":"warning","message":{"text":"SlotsParser._copy (cyclomatic 16): SlotsParser._copy has cyclomatic complexity 16 (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":"lib/src/parser/slots_parser.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a495c03c119ac2722d936ee85764abe611b34997dce2086d0f37b94243f2143"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyframeParser._parseMultiDimensionalKeyframe (cognitive 103): KeyframeParser._parseMultiDimensionalKeyframe has cognitive complexity 103 (threshold 15). Drivers by points: if/else 29 (77 pts), match/switch 3 (12 pts), loops 3 (9 pts), boolean chains 5 (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/keyframe_parser.dart"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2cb87bb8410f58129d3ae2c24f6e6ad17e115e3303e908c37121bec9952b6e"}},{"ruleId":"D2","level":"warning","message":{"text":"LayerParser.parseJson (cognitive 71): LayerParser.parseJson has cognitive complexity 71 (threshold 15). Drivers by points: if/else 16 (36 pts), loops 7 (22 pts), match/switch 3 (11 pts), boolean chains 1, ternaries 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/layer_parser.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7ce8f7acea3aa448a013933b6f805325789d39f135199cbd45e177dcb51f0d"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonUtf8Reader.peekNumber (cognitive 58): JsonUtf8Reader.peekNumber has cognitive complexity 58 (threshold 15). Drivers by points: if/else 21 (41 pts), boolean chains 14, ternaries 1 (2 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/moshi/json_utf8_reader.dart"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d14dc19e29882b0fe5a55f1f963f5aeb7d86ad2731f1762caeef0ac25d82742"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonUtf8Reader._doPeek (cognitive 51): JsonUtf8Reader._doPeek has cognitive complexity 51 (threshold 15). Drivers by points: if/else 26 (38 pts), match/switch 5 (10 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/moshi/json_utf8_reader.dart"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7259b22c4a7f584fcea65b3a6d3375630390b942eb832baf13577a17be1d0d59"}},{"ruleId":"D2","level":"warning","message":{"text":"TextLayer._drawTextParagraph (cognitive 40): TextLayer._drawTextParagraph has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 5 (9 pts), loops 5 (8 pts), boolean chains 6, match/switch 2 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/model/layer/text_layer.dart"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"f250da8a1acf852cab64dd07c2a52b2e38736fe6cbb6dda4658f877d06c3cb23"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformKeyframeAnimation.getMatrix (cognitive 39): TransformKeyframeAnimation.getMatrix has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (25 pts), ternaries 4 (10 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/keyframe/transform_keyframe_animation.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d921903fc34207df8cf2c0d258e241c12685ffcc43101f39b1d36adc1b2534"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformKeyframeAnimation.applyValueCallback (cognitive 39): TransformKeyframeAnimation.applyValueCallback has cognitive complexity 39 (threshold 15). Drivers by points: if/else 30 (39 pts) (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/keyframe/transform_keyframe_animation.dart"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d69bc0eb88e1d0d4244774014f8baef64fde570c6eee5278543fe471b7199b"}},{"ruleId":"D2","level":"warning","message":{"text":"PolystarContent._createStarPath (cognitive 38): PolystarContent._createStarPath has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (20 pts), ternaries 5 (14 pts), boolean chains 3, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/content/polystar_content.dart"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8ede6615a678a136b50a37a4385138bcb12065f8eb50b23c0c0131cec88360"}},{"ruleId":"D2","level":"warning","message":{"text":"GradientStrokeParser.parse (cognitive 37): GradientStrokeParser.parse has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (11 pts), match/switch 3 (11 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/gradient_stroke_parser.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"295b649a7c005a8ff8a973c15abdd93d205c204daf4bc1e2fbdd6f8776aa7c02"}},{"ruleId":"D2","level":"warning","message":{"text":"TextLayer.addValueCallback (cognitive 33): TextLayer.addValueCallback has cognitive complexity 33 (threshold 15). Drivers by points: if/else 22 (33 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":"lib/src/model/layer/text_layer.dart"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0984c42334867dee9211692ac9178a6f1fea030173ea1aa590d5d608333d18"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseStrokeContent._applyTrimPath (cognitive 28): BaseStrokeContent._applyTrimPath has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 5, loops 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/content/base_stroke_content.dart"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d74f933cec1dae262eea07f87c2484c3a9f2a2930a064b19d3fe8bf3d46d395"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyframesParser.parse (cognitive 25): KeyframesParser.parse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (6 pts), match/switch 1 (2 pts), ternaries 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":"lib/src/parser/keyframes_parser.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c5999a897acbabe0955abe2c9a211fc50521cabda1ff0807a712f4c24533de"}},{"ruleId":"D2","level":"warning","message":{"text":"ShapeStrokeParser.parse (cognitive 24): ShapeStrokeParser.parse has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 3 (11 pts), loops 3 (8 pts), if/else 3 (5 pts) (nesting depth added 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. 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":"lib/src/parser/shape_stroke_parser.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c332f31d82bfe06e31364a928093e7d25550b943a0ac9d50f3b2d351b721943e"}},{"ruleId":"D2","level":"warning","message":{"text":"LoopPosition.moveTo (cognitive 23): LoopPosition.moveTo has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 2 (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":"lib/src/model/keyframe_loop.dart"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"189ff300546f6deb07eaf6b246fe9ca3e437b7be38d381bcc41b75c4e26c11c5"}},{"ruleId":"D2","level":"warning","message":{"text":"FontCharacterParser.parse (cognitive 23): FontCharacterParser.parse has cognitive complexity 23 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 3 (8 pts), match/switch 2 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/font_character_parser.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a4bc8a90cba56ed718ea2f89a9cddba9083fa259f7e80970a3e9d144cbc2a3"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonUtf8Reader.skipValue (cognitive 23): JsonUtf8Reader.skipValue has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/moshi/json_utf8_reader.dart"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35bcca104e41bf72d919f180ae802b1143df148782a91b4532094a27f0078e5"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonUtf8Reader._nextNonWhitespace (cognitive 23): JsonUtf8Reader._nextNonWhitespace has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, match/switch 1 (3 pts), loops 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":"lib/src/parser/moshi/json_utf8_reader.dart"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a3d9828702d65a12ce6be3df672623d2ac49e3a58d4180e90e18a657e6c455"}},{"ruleId":"D2","level":"warning","message":{"text":"LottieComposition.decodeZip (cognitive 22): LottieComposition.decodeZip has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), boolean chains 3 (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":"lib/src/composition.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"898035cb36a899d14c4042e1a93d898000502cdd2cef855c601c68a33bef4462"}},{"ruleId":"D2","level":"warning","message":{"text":"TextLayer._splitGlyphTextIntoLines (cognitive 22): TextLayer._splitGlyphTextIntoLines has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 1, loops 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":"lib/src/model/layer/text_layer.dart"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"b839747c9b86e0e1bfd3bb2ceb004fb45a2a8193e74636f57c32b359a02ccc23"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseLayer._applyMasks (cognitive 21): BaseLayer._applyMasks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/model/layer/base_layer.dart"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadeba0ab35e1106afa048134bde4e03d84845b5a8c490d838285955ebd10749"}},{"ruleId":"D2","level":"warning","message":{"text":"GradientFillContent.addValueCallback (cognitive 20): GradientFillContent.addValueCallback has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (20 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/content/gradient_fill_content.dart"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccc45b5685926fbcbda104bef4035a7c6320a504c605d8805d497a4c25602d9"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderLottie.setComposition (cognitive 20): RenderLottie.setComposition has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/render_lottie.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c2d2a4be226362cc35d6cd6e745cc2957515d208314b07304a968f0f392ff1"}},{"ruleId":"D2","level":"warning","message":{"text":"RoundedCornersContent.modifyShape (cognitive 19): RoundedCornersContent.modifyShape has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 6, ternaries 2 (4 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/content/rounded_corners_content.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e25ae0c7f9cbb4534e074b5ed5c4ce845fe19be1d8d0fef620381fb7e3de5c"}},{"ruleId":"D2","level":"warning","message":{"text":"AnimatablePathValueParser.parseSplitPath (cognitive 19): AnimatablePathValueParser.parseSplitPath has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/animatable_path_value_parser.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2dfd3199cf15c96fd973d22e5492d74a6f5c0f06ec03b6c9c852e15d0bb3361"}},{"ruleId":"D2","level":"warning","message":{"text":"RoundedCornersContent._getShapeData (cognitive 18): RoundedCornersContent._getShapeData has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (4 pts), ternaries 2 (4 pts), loops 2 (3 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":"lib/src/animation/content/rounded_corners_content.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f491b525c35ef59e9c6a73841aa16e0a86822857911a053608bc836cc8abc20"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyframeLoop.parse (cognitive 18): KeyframeLoop.parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, ternaries 2, loops 1, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/model/keyframe_loop.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b6427458753c16b665938a782a6cc17f57948ddf89ac99db837176b7bfdd3d"}},{"ruleId":"D2","level":"warning","message":{"text":"AnimatableTransformParser.parse (cognitive 18): AnimatableTransformParser.parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/animatable_transform_parser.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0b8c5982cb1a082b689c2da3df816250d794479af8a434b655137a6f123570"}},{"ruleId":"D2","level":"warning","message":{"text":"GradientFillParser.parse (cognitive 18): GradientFillParser.parse has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 2 (6 pts), ternaries 2 (6 pts), loops 2 (4 pts), if/else 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/gradient_fill_parser.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4eed17c7dc196284e1367458a6913c7671499b06afda38373c65f3b1ba05d1"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonUtf8Reader.readEscapeCharacter (cognitive 18): JsonUtf8Reader.readEscapeCharacter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/moshi/json_utf8_reader.dart"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b286ca1ab2eb0e6ad31424cfbc2068ed5dd0abbb65199ddfd712a44420c7eb"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseStrokeContent.draw (cognitive 17): BaseStrokeContent.draw has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/content/base_stroke_content.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"207e7a6cad3abdb12009522acd0987e96d63316323c0e3d9a35ee1db40dd5974"}},{"ruleId":"D2","level":"warning","message":{"text":"TextLayer.TextLayer (cognitive 17): TextLayer.TextLayer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 8. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/model/layer/text_layer.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"617979df3c0308140d97e46b0e81e84383bdfecc5e8ace71460c9773717043b8"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseKeyframeAnimation._setLoopProgress (cognitive 16): BaseKeyframeAnimation._setLoopProgress has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 7 (8 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/keyframe/base_keyframe_animation.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e032fdd98a2a555ca19bdda2b2d6c6188c0f400a383e7b01a0f3f914ce4853d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayerParser.parseJson: MethodTooLong \u2014 parseJson runs 214 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/layer_parser.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4371b1de9fecae5f3ac3c53d111cb871a4053be7b13d1cfc8e899097720f692b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TextLayer: ClassTooLong \u2014 693 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 293 over it, 1.73\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":"lib/src/model/layer/text_layer.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acbddffe9c9a9c28b8af3de2466a09e01f5ccf49ee301bb9860367e7d001587"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layer/text_layer.dart: FileTooLong \u2014 730 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: TextLayer (22-976). The bar is 500 significant lines; this is 230 over it, 1.46\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":"lib/src/model/layer/text_layer.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5750eb532fbdae14583c1716bf36e42f5c5c38bb1a5dc4a2b301dba810eaf11c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KeyframeParser._parseMultiDimensionalKeyframe: MethodTooLong \u2014 _parseMultiDimensionalKeyframe runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/keyframe_parser.dart"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d15014a943f07917eb575f02e46d073887df2e426b5f9dc328109a0a028676"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ValueDelegate: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\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":"lib/src/value_delegate.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca00c040d7edfa1d4d98ffa8e691b8c2da2cb1bd131678c8f20f58616b2a0cb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BaseLayer: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\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":"lib/src/model/layer/base_layer.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"213e743cea78233900a7cc20e33ae4dcd651b5e0ecc14818bc1cf57b37029a83"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LottieComposition: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\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":"lib/src/composition.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0f19d9210a2b5e74b9acb26acfe3d039a0d1a1f851acba9620c7d02c03f100"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BaseLayer: ClassTooLong \u2014 451 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 400 significant lines; this is 51 over it, 1.13\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":"lib/src/model/layer/base_layer.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"843c950b145abcd2161d080cd7cab3222ed9be9059bd9f3a893f89bca353a8dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TransformKeyframeAnimation.getMatrix: MethodTooLong \u2014 getMatrix runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/keyframe/transform_keyframe_animation.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4d932389aa3a5ac6567b548defc59c312cd28645e128c0418f65eb5561799d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BaseKeyframeAnimation: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\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":"lib/src/animation/keyframe/base_keyframe_animation.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded05337695095e14c75dbee8af46bdc19f29a95d7dae5baf567f3187a3fb607"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 47\u002B corresponding lines): lib/src/animation/content/base_stroke_content.dart:368-417 | lib/src/animation/content/fill_content.dart:162-208 | lib/src/animation/content/gradient_fill_content.dart:271-330 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 47 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":"lib/src/animation/content/base_stroke_content.dart"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"baae55694ab6da2626946ea83a76ebc8a0bb671884a1b441bd57d0d2e30cd7cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): lib/src/parser/moshi/json_utf8_reader.dart:648-693 | lib/src/parser/moshi/json_utf8_reader.dart:754-815 \u2014 These two members are one piece of code written twice and then edited apart: 46 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":"lib/src/parser/moshi/json_utf8_reader.dart"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"25adf3fb9e389554e575909f9fb5eb5be272b59c8047bf2974f24e2dac619f85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): lib/src/parser/gradient_color_parser.dart:161-192 | lib/src/parser/gradient_color_parser.dart:194-228 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/gradient_color_parser.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9baf07ad1ad5de3b38597b484f8581ff296c52c42b3eade2ec9e87e82dc628"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): lib/src/parser/circle_shape_parser.dart:22-62 | lib/src/parser/shape_fill_parser.dart:23-67 \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":"lib/src/parser/circle_shape_parser.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a783790027f6a180c99bca0adf134d8bf290e6383867e8dfb81a1dbf112e5ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): lib/src/animation/content/gradient_fill_content.dart:194-218 | lib/src/animation/content/gradient_stroke_content.dart:108-129 \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":"lib/src/animation/content/gradient_fill_content.dart"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ec40998d1b762b0893c2b6147072ab1047ed124069c7034a98e133cef9eb25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 32\u002B corresponding lines): lib/src/parser/animatable_text_properties_parser.dart:117-154 | lib/src/parser/rectangle_shape_parser.dart:22-59 | lib/src/parser/repeat_parser.dart:20-51 | lib/src/parser/shape_trim_path_parser.dart:17-52 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 32 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":"lib/src/parser/animatable_text_properties_parser.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a24bb8c0817ed23003809eaaa14a216a401a13781cbde712e27cb734853da43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): lib/src/providers/asset_provider.dart:34-67 | lib/src/providers/network_provider.dart:30-62 \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":"lib/src/providers/asset_provider.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"406e47c7b5024ab518543471e2363beac91ac142f9409d3dc3c991822ff834bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): lib/src/parser/moshi/json_utf8_reader.dart:495-518 | lib/src/parser/moshi/json_utf8_reader.dart:598-626 \u2014 These two members are one piece of code written twice and then edited apart: 24 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":"lib/src/parser/moshi/json_utf8_reader.dart"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"12556519783cf6e112c0f97c55f62062b24e6539ba6b42ac55f05b26c5f3930c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): lib/src/lottie_builder.dart:478-493 | lib/src/raw_lottie.dart:128-144 | lib/src/render_lottie.dart:279-295 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 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":"lib/src/lottie_builder.dart"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"391d2c3a5606c9d4a56fe5034814a1817fbb01cc0b54149a39eafc109bc9a292"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/src/animation/content/gradient_fill_content.dart:176-192 | lib/src/animation/content/gradient_stroke_content.dart:89-106 \u2014 These two members are one piece of code written twice and then edited apart: 17 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":"lib/src/animation/content/gradient_fill_content.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7179a3581ec8839f7062a5cc76002d8afc93fc958c732be78a40700ebcf8d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): lib/src/providers/file_provider_io.dart:30-49 | lib/src/providers/memory_provider.dart:24-44 \u2014 These two members are one piece of code written twice and then edited apart: 20 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":"lib/src/providers/file_provider_io.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"307b69490b30db05da64f80efc59d6082b5b7a58528e951a449839bf90e350bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): lib/src/parser/merge_paths_parser.dart:13-33 | lib/src/parser/rounded_corners_parser.dart:14-36 | lib/src/parser/shape_path_parser.dart:17-39 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 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":"lib/src/parser/merge_paths_parser.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba89fa81066f9b82254c154f032b43ba0cc2e23caf6a3290c3fdeda2472a81d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/src/animation/content/fill_content.dart:129-144 | lib/src/animation/content/gradient_fill_content.dart:159-174 \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":"lib/src/animation/content/fill_content.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"668cde41807c9702f6e4eeffa1d209ba533d1160b14e6fc3952acadc45da72c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/src/animation/content/gradient_stroke_content.dart:169-187 | lib/src/animation/content/stroke_content.dart:57-77 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/content/gradient_stroke_content.dart"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee38fa3ed6f505e40148d5bbae6caf167364acd4ca901d46e5f796fa6d7d713"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): lib/src/animation/keyframe/double_keyframe_animation.dart:9-30 | lib/src/animation/keyframe/integer_keyframe_animation.dart:9-32 | lib/src/animation/keyframe/point_keyframe_animation.dart:19-48 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 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":"lib/src/animation/keyframe/double_keyframe_animation.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"022955cdeb87a481cf16345abf570ed4e0dbc6c6e754f9c853da73fc7ac0bec5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/src/parser/blur_effect_parser.dart:15-34 | lib/src/parser/lottie_composition_parser.dart:201-218 \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":"lib/src/parser/blur_effect_parser.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8215648119db9aeee4ff5394f8e6d26b2226b10f3a9a93dea6966569b7ba6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/src/parser/animatable_text_properties_parser.dart:36-64 | lib/src/parser/json_utils.dart:75-92 \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":"lib/src/parser/animatable_text_properties_parser.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f4df81f387ab5f4dc6466e60bb391eb46dc7d32f7ace00dfe1f3f8ac82c214"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): lib/src/animation/content/ellipse_content.dart:51-62 | lib/src/animation/content/polystar_content.dart:84-95 | lib/src/animation/content/rectangle_content.dart:63-77 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 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":"lib/src/animation/content/ellipse_content.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"63617fa2b8b27cc2d13aed6b5d14cd60835f75900ad557b372c5ab37fced6efc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): lib/src/model/layer/base_layer.dart:472-487 | lib/src/model/layer/base_layer.dart:501-517 | lib/src/model/layer/base_layer.dart:519-533 | lib/src/model/layer/base_layer.dart:535-550 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/model/layer/base_layer.dart"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d5771d5238eac413f63c52114df06e6eb4d27dac69d9ae9bb05e7b464c5a9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/src/providers/asset_provider.dart:69-89 | lib/src/providers/network_provider.dart:64-79 \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":"lib/src/providers/asset_provider.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0652327be899209d0a0a18619bd2714c0564c7b7b3d9e8b673f4d7f6346945a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): lib/src/value_delegate.dart:28-40 | lib/src/value_delegate.dart:42-54 | lib/src/value_delegate.dart:56-68 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 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":"lib/src/value_delegate.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c57cd145189aef7832ca88370785ef1087741449c4017751f41d9a8149ae25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): lib/src/animation/content/ellipse_content.dart:127-136 | lib/src/animation/content/rectangle_content.dart:197-210 | lib/src/animation/content/repeater_content.dart:153-164 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 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":"lib/src/animation/content/ellipse_content.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ae63a083a4ae80afee7c41e70e1cf354298ec7eed8c35799f5f0bec351859a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): lib/src/parser/moshi/json_utf8_reader.dart:77-92 | lib/src/parser/moshi/json_utf8_reader.dart:94-109 | lib/src/parser/moshi/json_utf8_reader.dart:111-125 | lib/src/parser/moshi/json_utf8_reader.dart:127-144 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/moshi/json_utf8_reader.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cee048634d2ab1c55371f5dd55d3b7037bbe80dcbe45f6f729b467bc9a4ab4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/src/providers/asset_provider.dart:91-98 | lib/src/providers/network_provider.dart:81-87 \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":"lib/src/providers/asset_provider.dart"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87cbd54243484f4927a3a0409cac5e07b41686100267ef73bd3620758a20111"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): lib/src/parser/gradient_fill_parser.dart:41-74 | lib/src/parser/gradient_stroke_parser.dart:57-90 \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 \u0060lib/src/parser/gradient_fill_parser.dart:41\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":"lib/src/parser/gradient_fill_parser.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0dd1a1b62dbaa3591c019d42657350bc4f0b94e1166ae1c732e33b68f5b4fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): lib/src/parser/gradient_stroke_parser.dart:92-117 | lib/src/parser/shape_stroke_parser.dart:52-78 \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 \u0060lib/src/parser/gradient_stroke_parser.dart:92\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, \u0060lib/src/parser/shape_stroke_parser.dart:51\u0060 calls \u0060parseInteger\u0060 and \u0060lib/src/parser/gradient_stroke_parser.dart:91\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":"lib/src/parser/gradient_stroke_parser.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"457a4c88be1123edecde0926d65b2ca91311a80e149ff8431fa024db988739cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): lib/src/animation/content/gradient_fill_content.dart:220-239 | lib/src/animation/content/gradient_stroke_content.dart:134-153 \u2014 before extracting anything, compare \u0060lib/src/animation/content/gradient_fill_content.dart\u0060 and \u0060lib/src/animation/content/gradient_stroke_content.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"lib/src/animation/content/gradient_fill_content.dart"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"d607130592ad2b9877d455814d1c0babb00dee123bb0ba973ac4907eed9ffc93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/src/animation/content/gradient_fill_content.dart:194-209 | lib/src/animation/content/gradient_stroke_content.dart:108-123 \u2014 before extracting anything, compare \u0060lib/src/animation/content/gradient_fill_content.dart\u0060 and \u0060lib/src/animation/content/gradient_stroke_content.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/animation/content/gradient_fill_content.dart:194\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":"lib/src/animation/content/gradient_fill_content.dart"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddee2ab7041658283be3b92119a6e68272a4e9377d57806c558601481ff1960"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/src/parser/moshi/json_utf8_reader.dart:669-683 | lib/src/parser/moshi/json_utf8_reader.dart:789-803 \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 \u0060lib/src/parser/moshi/json_utf8_reader.dart:669\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":"lib/src/parser/moshi/json_utf8_reader.dart"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4741505fd9cafe5b8558c204b0e953413c8b1d0e61b5f138b2ce293f1c3ca88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): lib/src/parser/keyframe_parser.dart:163-176 | lib/src/parser/keyframe_parser.dart:177-190 | lib/src/parser/keyframe_parser.dart:210-223 | lib/src/parser/keyframe_parser.dart:224-237 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/parser/keyframe_parser.dart:163\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":"lib/src/parser/keyframe_parser.dart"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a637e56960c950268280bf5ace5828a84e18f491ef5ebb7c9ee9424de0df398"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): lib/src/animation/content/gradient_fill_content.dart:180-192 | lib/src/animation/content/gradient_stroke_content.dart:93-106 \u2014 before extracting anything, compare \u0060lib/src/animation/content/gradient_fill_content.dart\u0060 and \u0060lib/src/animation/content/gradient_stroke_content.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/animation/content/gradient_fill_content.dart:180\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":"lib/src/animation/content/gradient_fill_content.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b80764e41cfafbfc10758d6070c6d76706c9d9f0f2b43ac070c35dca4d6d845"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/src/parser/circle_shape_parser.dart:31-44 | lib/src/parser/rectangle_shape_parser.dart:30-43 \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 \u0060lib/src/parser/circle_shape_parser.dart:31\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":"lib/src/parser/circle_shape_parser.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0877d15b4b534cb1432e2291b8dca53096d7558c5bf34b7500bde5cb45bf5905"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): lib/src/animation/content/fill_content.dart:129-140 | lib/src/animation/content/gradient_fill_content.dart:159-171 \u2014 before extracting anything, compare \u0060lib/src/animation/content/fill_content.dart\u0060 and \u0060lib/src/animation/content/gradient_fill_content.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/animation/content/fill_content.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/content/fill_content.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"159f427546d20d7ef225b51afae2e37454b11f4a46882841f278124b81055cca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): lib/src/animation/content/fill_content.dart:167-178 | lib/src/animation/content/gradient_fill_content.dart:273-285 \u2014 before extracting anything, compare \u0060lib/src/animation/content/fill_content.dart\u0060 and \u0060lib/src/animation/content/gradient_fill_content.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/animation/content/fill_content.dart:167\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, \u0060lib/src/animation/content/fill_content.dart:165\u0060 calls \u0060setValueCallback\u0060 and \u0060lib/src/animation/content/gradient_fill_content.dart:273\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":"lib/src/animation/content/fill_content.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a164f83a74c26a9470ac8fcda424a5cd0e467c64e25632c113f9638f5a3a8fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/src/animation/content/gradient_fill_content.dart:241-253 | lib/src/animation/content/gradient_stroke_content.dart:155-167 \u2014 before extracting anything, compare \u0060lib/src/animation/content/gradient_fill_content.dart\u0060 and \u0060lib/src/animation/content/gradient_stroke_content.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"lib/src/animation/content/gradient_fill_content.dart"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e210e6992cf700bd6687990868f30259cb79a451ca7ae12d24d60d4d4374f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/src/animation/content/gradient_stroke_content.dart:49-61 | lib/src/animation/content/stroke_content.dart:28-40 \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 \u0060lib/src/animation/content/gradient_stroke_content.dart:49\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":"lib/src/animation/content/gradient_stroke_content.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7500cc2c733d50d3671d4aa9ef647e9e9bd2a3539694f76da90a840cecd3b7e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): lib/src/model/layer/image_layer.dart:73-85 | lib/src/model/layer/solid_layer.dart:79-90 \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 \u0060lib/src/model/layer/image_layer.dart:73\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":"lib/src/model/layer/image_layer.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5446d572777e71b65ebe451b2c7de88aa1505bf77da0f98d2f5edde69a962d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/src/parser/gradient_stroke_parser.dart:49-61 | lib/src/parser/shape_stroke_parser.dart:34-46 \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 \u0060lib/src/parser/gradient_stroke_parser.dart:49\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":"lib/src/parser/gradient_stroke_parser.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0929dbe00d89bda762f8599143986b3e98c33e36ad08c8eb98e1d96c28876687"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): lib/src/animation/content/fill_content.dart:168-178 | lib/src/animation/content/gradient_fill_content.dart:275-285 | lib/src/animation/content/stroke_content.dart:62-72 \u2014 before extracting anything, compare \u0060lib/src/animation/content/fill_content.dart\u0060 and \u0060lib/src/animation/content/gradient_fill_content.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/animation/content/fill_content.dart:168\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, \u0060lib/src/animation/content/fill_content.dart:165\u0060 calls \u0060setValueCallback\u0060 and \u0060lib/src/animation/content/gradient_fill_content.dart:273\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":"lib/src/animation/content/fill_content.dart"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"921767d7999a30a8248530b4d81a60583440a0d7bd532650ce314cf44161c523"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): lib/src/lottie_builder.dart:483-493 | lib/src/raw_lottie.dart:134-144 | lib/src/render_lottie.dart:285-295 \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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/lottie_builder.dart:483\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":"lib/src/lottie_builder.dart"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77b39556759c82f29d5b92f84a82202dc461425db5e13b98067693d9660556e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): lib/src/animation/content/ellipse_content.dart:51-60 | lib/src/animation/content/polystar_content.dart:84-93 | lib/src/animation/content/rectangle_content.dart:63-71 \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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/animation/content/ellipse_content.dart:51\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. 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":"lib/src/animation/content/ellipse_content.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3886fa364b6f75ce24bad92b461bf309e02363a8589dc20465f2b89d89b56f4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/src/animation/content/base_stroke_content.dart:392-401 | lib/src/animation/content/gradient_fill_content.dart:305-314 \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 \u0060lib/src/animation/content/base_stroke_content.dart:392\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":"lib/src/animation/content/base_stroke_content.dart"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c634f0d4cf1e9e7932b8305a66eed5260b8cc04735ef9605cdf8b7f2f802297"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/src/animation/content/fill_content.dart:71-79 | lib/src/animation/content/gradient_fill_content.dart:92-100 \u2014 before extracting anything, compare \u0060lib/src/animation/content/fill_content.dart\u0060 and \u0060lib/src/animation/content/gradient_fill_content.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/content/fill_content.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9420fb2336b0f489c65d9cce852d12008165b62ae710e88dcbce06250f7e6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): lib/src/model/layer/base_layer.dart:510-517 | lib/src/model/layer/base_layer.dart:544-550 \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 \u0060lib/src/model/layer/base_layer.dart:510\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":"lib/src/model/layer/base_layer.dart"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2495ebe79911e700a67903fd0874eeb59ba7097dda15a86ff3e3509ba2cb8e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/src/animation/content/polystar_content.dart:195-201 | lib/src/animation/content/polystar_content.dart:270-276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/content/polystar_content.dart"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"586b5fa9d59d54c8ee9691af6cb134ff9e94ae67a8bbb80fc59e9049230c661a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 8): lib/src/animation/content/base_stroke_content.dart:352-366 | lib/src/animation/content/ellipse_content.dart:111-125 | lib/src/animation/content/fill_content.dart:146-160 | lib/src/animation/content/gradient_fill_content.dart:255-269 | lib/src/animation/content/polystar_content.dart:337-351 | lib/src/animation/content/rectangle_content.dart:181-195 | lib/src/animation/content/repeater_content.dart:137-151 | lib/src/animation/content/shape_content.dart:88-102 \u2014 before extracting anything, compare \u0060lib/src/animation/content/fill_content.dart\u0060 and \u0060lib/src/animation/content/gradient_fill_content.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/content/base_stroke_content.dart"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"233d767edaffc36d3a55eac4c97566af499775a2fc23a6e21ffa9ee413f7b56b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/render_cache/store_drawing.dart:80-85 | lib/src/render_cache/store_raster.dart:111-116 \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":"lib/src/render_cache/store_drawing.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0a5ae3b8948cfa91ea3ad764a4a6cc0e1707abeb1d36177706a1b836e714f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): example/lib/examples/hide_after_complete.dart:38-67 | example/lib/examples/run_once.dart:45-72 \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":"example/lib/examples/hide_after_complete.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2f53856ac4c948f43e514951ada08ecbef491728aa80c2d025f859168ff2df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): example/lib/examples/blur.dart:9-28 | example/lib/examples/drop_shadow.dart:9-36 \u2014 These two members are one piece of code written twice and then edited apart: 20 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":"example/lib/examples/blur.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4591a28e7412557de14abcedf414ba6fd91a8a03ff4f0fdecf7a8aa6484c19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): example/lib/examples/custom_draw.dart:40-53 | example/lib/examples/custom_load.dart:33-46 \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":"example/lib/examples/custom_draw.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c975d4e28592f8435e3bba2ed691001c27f387b57c1c88046c0661b757c92aa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): example/lib/examples/animation_controller.dart:29-50 | example/lib/examples/repeat.dart:35-58 \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":"example/lib/examples/animation_controller.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32a03974a07bbb719a6fbbdc902e3e6f54ec7a811e35cce11baefee6f25ba20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): example/lib/examples/hide_after_complete.dart:19-30 | example/lib/examples/run_once.dart:26-37 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example/lib/examples/hide_after_complete.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0bc399fc0cb75d9629fbc9079469e85840b56be6cde80a626e94298d9b86a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): example/lib/examples/examples.dart:9-26 | example/lib/main.dart:9-29 \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":"example/lib/examples/examples.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d4ee287ef9ba8c66b6083fd44ad5d4c9151828ff3eaaa5424213ca203a70d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): example/lib/examples/error_builder.dart:9-14 | example/lib/examples/simple_dynamic_properties.dart:9-14 \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":"example/lib/examples/error_builder.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f0cf4e0c5dcab32881ae0f7f83340301925221b7eb12ff59fa4c0d5df6ad69"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LottieComposition (LCOM4 9): LottieComposition\u0027s methods fall into 9 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 9 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":"lib/src/composition.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3513b0d9edb2ce6a4766a60de1e489203f647076a387358dc3b9a8b8fd9696a2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ValueCallbackKeyframeAnimation (LCOM4 5): ValueCallbackKeyframeAnimation\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":"lib/src/animation/keyframe/value_callback_keyframe_animation.dart"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ce8023414a8c2514439f2db192f85d97f0c5662e6480cc97bcb72dbb5ba606"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _LottieState (LCOM4 5): _LottieState\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":"lib/src/lottie.dart"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"c527feeb9bed490040a5213d8c0895f467b92f261c6dbc0e10a6723e20e229c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/animation/keyframe/transform_keyframe_animation.dart: lib/src/animation/keyframe/transform_keyframe_animation.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in TransformKeyframeAnimation.getMatrix at line 133. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 23:13:38 \u002B01:00\u0027 --until=\u00272026-11-16 23:13:38 \u002B01:00\u0027 --full-history --no-merges -- lib/src/animation/keyframe/transform_keyframe_animation.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":"lib/src/animation/keyframe/transform_keyframe_animation.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"becd703d5825be4ef2a0be0055bb56f1a3f72356d1d984d84a43d4feaf1e672c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/src/model/layer/composition_layer.dart: lib/src/model/layer/composition_layer.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is CompositionLayer.CompositionLayer at line 27), 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 time-remapped pre-compositions playing a hair early (#469)\u201D; \u201CFix a frame falling between two keyframes, also inside precomps (#460)\u201D; \u201CFix time remapping with stretched precompositions (#427)\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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 23:13:38 \u002B01:00\u0027 --until=\u00272026-11-16 23:13:38 \u002B01:00\u0027 --full-history --no-merges -- lib/src/model/layer/composition_layer.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":"lib/src/model/layer/composition_layer.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde4d2d41e5a4e21f108e0aa84aead8614c611060a43f25c9f9e9836b7d35316"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(xha): download all screenshots from lottie-android as golden screenshots \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/screenshot_test.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a403eebf1a2cdab9eec414b0727a10d9fee469ad54e08a25d2c86449d99dd50d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(xha): compare bytes content \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/providers/memory_provider.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b0eacd59d41cdc01f0d6cf0c03ecb45b2656e577dd731bc96be3f8d8f32219"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: create a HoldInterpolator so progress changes don\u0027t invalidate. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/keyframe_parser.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e6e6d357e620a99b345ff34bd64da5d6e1f6cfb666dfecfb0855f7066b6416"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: create a HoldInterpolator so progress changes don\u0027t invalidate. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/keyframe_parser.dart"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"4129b109a7d87897d0de49f21ad73b867421197169af8f88115e0a985b057965"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(xha): check the error message for Flutter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parser/keyframe_parser.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b10b21205e310fcac707638bb0c7327e0564c3045275dc6065394a34e9627c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(xha): check if needed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/model/layer/base_layer.dart"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ab93a3d51be885bc90307ccd915ea5fb868b5984e508ebb988cca2f60f02f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(xha): take from context. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/model/layer/text_layer.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e01f2a67617a72e1c97a5ee2b927061f68a59534ec7fd893e3f857ee384178"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use the correct text bounds. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/model/layer/text_layer.dart"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"075b744dec27680a3dd6c2fc26beaeea72032ee9734d301549f7bf157bb70e97"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(xha): decide what to do? We don\u0027t have access to the LottieDrawble \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/model/content/shape_data.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"522ada5d62f621d733a5b57d915c866dcd504bbbe26b8df1d41735166ca0c2b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: see if we can use this for the main {@link #getMatrix()} method. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/keyframe/transform_keyframe_animation.dart"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"e203d82632a28c9e7dc99b66ea826493f6e72bbc463647b42569bb51c2035e54"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: cache this somehow. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/content/content_group.dart"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e03bf1249bf2368cf3b4ab041a2ab99566fac17439ecfa0e36a4c5af3030b0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle bounds \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/content/ellipse_content.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"260f112ad603464d74c25823c1118fcf828a40870a54666c6eba319b8ad8886a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(xha): cache the shader based on the input parameters and not the animation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/content/gradient_stroke_content.dart"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ed282314fd413f7aed929592444d783165931ab3cd88c2c4fc26e05dcc7178"}},{"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":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","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":"e0adcbe811b303db5b6b37bf9be5e45d8bf1eff2fbcae3930d860d2fb176a7d5"},"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":"5cc42b8d372a6bd9c0c01b261748a2fa4bd09624db455b2d907624a171f73248"},"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":"e865f8e041d33296d3a286c330b96b723cbb96b9645d8f1c642b2719543e8974"},"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":"fc5c0429d9f352930b385a213d5133b17a6db84e72447d5cf7203d52098c46e3"},"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":"936abd9b56072b8222fc4472f35db291865bcce1006764766898a16927181e6e"},"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":"879e4f0c38959ccd387012e12514b0b7127401dc8e54e89d5885d0e31658cd54"},"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":"698485ebf6a9267a522957ff9e21ee9c6c3501b2630a13d7ff80ca996375c2c6"},"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":"ad71efdd3362b082ff87171a5211d2ee0ed1a745e4f2837681ea2612dc810871"},"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":"cb8d7c5e07d90e5dbe59564ef8872e798cdcf4070282fc150b04c2d25b4e0976"},"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":"401113a055fe908ab20c10aa0163866da973189519eb7661738b5007200d4f38"},"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":"e75a3603ab05360297b60f47587475ab73abf3958b9afa87edd15d93a2a63a69"},"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":"d8674958f863d73a4484d7ff9c6c171b1f091187a2231e55dd0575239a52fdd5"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"bd630e67e903fc6a619d69165de6bcf86c3ecb7422aa9ca4c6f6f26d9a9d1662"},"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"}},{"id":"CICD-SEC-8","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":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8ed847c4b94f6b16430b22cea47395a81a125beeaa3af4082d993cced53d4a84"},"taxa":[{"id":"CICD-SEC-6","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":"3288c76a6902a6d6c0c728e6ef527d468ef91d93bb78ebdf7836daba34e68da8"},"taxa":[{"id":"CICD-SEC-4","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":"0cfd836177c4fd9914086300f4d07f181c7f268878211a4d3b84331d92aae2b9"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 throws a \u0022not implemented\u0022 error: \u0060getCurrentKeyframe\u0060 is a shipped member whose whole body still throws a \u0022not implemented\u0022 error \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/keyframe/base_keyframe_animation.dart"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00f42a6adb526fb728e1912e1028d3273ddf326e584da92b4e2f430bb38dec2"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 throws a \u0022not implemented\u0022 error: \u0060keyframeAt\u0060 is a shipped member whose whole body still throws a \u0022not implemented\u0022 error \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/keyframe/base_keyframe_animation.dart"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"f264476a1db0b635e21e029851debe07890281ed1ff7735197792caf345baded"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 throws a \u0022not implemented\u0022 error: \u0060isCachedValueEnabled\u0060 is a shipped member whose whole body still throws a \u0022not implemented\u0022 error \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/keyframe/base_keyframe_animation.dart"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed9f3e137efb319184540f9f4552f024ca55028c95bc94bffccf939472a6fd4"}},{"ruleId":"IC1","level":"warning","message":{"text":"Skeleton type \u2014 most members are unfinished: \u0060_EmptyKeyframeWrapper\u0060 has 3 unfinished members out of 6 declared methods (whether or not each carries a body) \u2014 a scaffolded class that was never implemented."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/keyframe/base_keyframe_animation.dart"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3a7ada8528068b53e7b2a4e32940e37a819854af02e1effda44379c240b564"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 throws a \u0022not implemented\u0022 exception: \u0060getCurrentKeyframe\u0060 throws an exception whose message says it isn\u0027t finished \u2014 a not-implemented stub wearing an ordinary exception. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/keyframe/base_keyframe_animation.dart"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9e476051cb23c4c8ae5439dfe616c2646960a37d49475db3f31c12d3af0989"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 throws a \u0022not implemented\u0022 exception: \u0060keyframeAt\u0060 throws an exception whose message says it isn\u0027t finished \u2014 a not-implemented stub wearing an ordinary exception. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/keyframe/base_keyframe_animation.dart"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a12ee049e5140dffc78a860470f2c89c16b0c5e1e9c861e9e9df166a8883563"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 throws a \u0022not implemented\u0022 exception: \u0060isCachedValueEnabled\u0060 throws an exception whose message says it isn\u0027t finished \u2014 a not-implemented stub wearing an ordinary exception. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/animation/keyframe/base_keyframe_animation.dart"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c84de4ea2800adb93f24cbd44508a22e2c54c375bdbf6330ac85a3cf13a4dcb"}},{"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":"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 3 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/analyze-and-test.yaml"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch gradle: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060gradle\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3bff8eed2eb29302c3d10644f1ecba23171c77cd6c406b6dfa078dfc05ad87"}},{"ruleId":"P4","level":"warning","message":{"text":"No deployment automation: No release automation was found in CI \u2014 neither a deploy stage (Helm/Kubernetes/compose manifests, an orchestrated rollout) nor a publish job that ships the built artifact. Releases appear to be run by hand, which is slower, less repeatable and harder to reverse."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7a7f38718309412c2d2c2c0663260a3d160de9a5a60f3915755be16386d3f1e8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060content is TrimPathContent \u0026\u0026 content.type == ShapeTrimPathType.simultaneously\u0060 appears character-identically in 4 files \u2014 lib/src/animation/content/ellipse_content.dart, lib/src/animation/content/polystar_content.dart, lib/src/animation/content/rectangle_content.dart, lib/src/animation/content/shape_content.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":"lib/src/animation/content/ellipse_content.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d8f65d5862780f3a9652d1bb6243e593b42ece129ad8dedb5983c8e0e0a567"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060keyframe.startValue == null || keyframe.endValue == null\u0060 appears character-identically in 3 files \u2014 lib/src/animation/keyframe/color_keyframe_animation.dart, lib/src/animation/keyframe/double_keyframe_animation.dart, lib/src/animation/keyframe/point_keyframe_animation.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":"lib/src/animation/keyframe/color_keyframe_animation.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abb27cf34ad28f6a9e9b2554d2bbf5f5d5005785d850d9f6571be94da3e0934"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.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-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"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-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-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"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":21,"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."]}]}