{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"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":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX1","name":"Captive dependencies","shortDescription":{"text":"Captive dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/AX1"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"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":"_ERScrollPhysics.applyBoundaryConditions (cyclomatic 76): _ERScrollPhysics.applyBoundaryConditions has cyclomatic complexity 76 (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":"packages/easy_refresh/lib/src/physics/scroll_physics.dart"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20dadd77ee5d7695279ec7da4c90894d90ea3a200707972d79f56937f39ae21"}},{"ruleId":"D1","level":"warning","message":{"text":"IndicatorNotifier._updateMode (cyclomatic 57): IndicatorNotifier._updateMode has cyclomatic complexity 57 (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":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c7c4f938745c905c32f384722700f226346e118d1ffa977c4b5a49bb92f093"}},{"ruleId":"D1","level":"warning","message":{"text":"_ERScrollPhysics.createBallisticSimulation (cyclomatic 40): _ERScrollPhysics.createBallisticSimulation has cyclomatic complexity 40 (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":"packages/easy_refresh/lib/src/physics/scroll_physics.dart"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"7441e8b1c9bd0761129758d112a2fdbf58fe68bd7658a7dfab41924c1c9ef33e"}},{"ruleId":"D1","level":"warning","message":{"text":"IndicatorNotifier._updateOffset (cyclomatic 39): IndicatorNotifier._updateOffset has cyclomatic complexity 39 (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":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8e1554816eb3e34156f7f0c3aa5f997d553d347be1be82c415233f28d85615"}},{"ruleId":"D1","level":"warning","message":{"text":"_ERScrollPhysics._applyNestedBoundaryConditions (cyclomatic 31): _ERScrollPhysics._applyNestedBoundaryConditions has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/physics/scroll_physics.dart"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"596cfddd4fb783bbf474afd520762b0eb35cb872736639a085bbe719a42a6f50"}},{"ruleId":"D1","level":"warning","message":{"text":"_BezierIndicatorState._buildBalls (cyclomatic 27): _BezierIndicatorState._buildBalls has cyclomatic complexity 27 (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":"packages/easy_refresh/lib/src/styles/bezier/bezier_indicator.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1f1becc1d33432b75beb20e1897feb74bc39c168285838dfe55f7ad62e377f"}},{"ruleId":"D1","level":"warning","message":{"text":"_BezierIndicatorState._buildSpin (cyclomatic 26): _BezierIndicatorState._buildSpin has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/styles/bezier/bezier_indicator.dart"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"f870d0f2aefb468e17f8a3277f2ade3855b14281e6986f765d3aedd2f026099b"}},{"ruleId":"D1","level":"warning","message":{"text":"_BezierIndicatorState.build (cyclomatic 25): _BezierIndicatorState.build 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":"packages/easy_refresh/lib/src/styles/bezier/bezier_indicator.dart"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4ff83a798271b39d981c6d06620597b6bc5215c75aea23d76cdbc28d37a79f"}},{"ruleId":"D1","level":"warning","message":{"text":"_MaterialIndicatorState.build (cyclomatic 24): _MaterialIndicatorState.build has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/styles/material/material_indicator.dart"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ebd7ffd039416e41eeb4b038cc564e5180763a33ee94ef4d5963671ccdc40f"}},{"ruleId":"D1","level":"warning","message":{"text":"_ERScrollPhysics.applyPhysicsToUserOffset (cyclomatic 18): _ERScrollPhysics.applyPhysicsToUserOffset has cyclomatic complexity 18 (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":"packages/easy_refresh/lib/src/physics/scroll_physics.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"547c27a7311fda8e74997594e10f878a4f851f699daccebee90ebc0ee5c5aae2"}},{"ruleId":"D1","level":"warning","message":{"text":"FooterNotifier.animateToOffset (cyclomatic 17): FooterNotifier.animateToOffset 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":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"d157bcff0daa3d31430105c0bc60dc55ea4aacfcab5059774b30c9128ef5327d"}},{"ruleId":"D1","level":"warning","message":{"text":"_EasyRefreshState._bindNestedControllers (cyclomatic 16): _EasyRefreshState._bindNestedControllers has cyclomatic complexity 16 (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":"packages/easy_refresh/lib/src/easy_refresh.dart"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"e906a3fb68242c53212567bbea7a87fb4900dcc56d0cc68d36bc312849805559"}},{"ruleId":"D1","level":"warning","message":{"text":"IndicatorNotifier.overExtent (cyclomatic 16): IndicatorNotifier.overExtent 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":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60fa28c6e3ea58de028aa3b45902ac2e3cfe36544b535fe91ec446097ac5ca6"}},{"ruleId":"D1","level":"warning","message":{"text":"_BezierClipper.getClip (cyclomatic 16): _BezierClipper.getClip has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/styles/bezier/bezier_background.dart"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8965d42b3f019a7897c7b4f6cf63edc9ab1279650586575fe0748b8bac7f16"}},{"ruleId":"D1","level":"warning","message":{"text":"_CupertinoIndicatorState.build (cyclomatic 16): _CupertinoIndicatorState.build has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/styles/cupertino/cupertino_indicator.dart"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67ac46200b7c1a397146de55b30a955a2b678778db728ec8f9e15f3fcde0d10"}},{"ruleId":"D2","level":"warning","message":{"text":"IndicatorNotifier._updateMode (cognitive 138): IndicatorNotifier._updateMode has cognitive complexity 138 (threshold 15). Drivers by points: if/else 42 (97 pts), ternaries 5 (22 pts), boolean chains 19 (nesting depth added 72). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d80625a1a6142c4872bea649a5a4c3ad9d4971d30fa5a19b1260afe547053c6"}},{"ruleId":"D2","level":"warning","message":{"text":"_ERScrollPhysics.applyBoundaryConditions (cognitive 113): _ERScrollPhysics.applyBoundaryConditions has cognitive complexity 113 (threshold 15). Drivers by points: if/else 35 (69 pts), boolean chains 44 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/physics/scroll_physics.dart"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"9621f63e6303f4c66d02f346597781aa00c36284ed3c0891f843da9741d19034"}},{"ruleId":"D2","level":"warning","message":{"text":"IndicatorNotifier._updateOffset (cognitive 50): IndicatorNotifier._updateOffset has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 24 (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":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbac74d97e655e4a7d91f14f10dd64693e29bbf77ac5a27495466acbe55137b"}},{"ruleId":"D2","level":"warning","message":{"text":"_ERScrollPhysics.createBallisticSimulation (cognitive 50): _ERScrollPhysics.createBallisticSimulation has cognitive complexity 50 (threshold 15). Drivers by points: boolean chains 26, if/else 13 (24 pts) (nesting depth added 11). 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":"packages/easy_refresh/lib/src/physics/scroll_physics.dart"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a34dc99c4c7d7109a061ee7d44320a2b5a4abfca61ebe76fec38cc99a1488c"}},{"ruleId":"D2","level":"warning","message":{"text":"_BezierClipper.getClip (cognitive 40): _BezierClipper.getClip has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (28 pts), ternaries 4 (12 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/styles/bezier/bezier_background.dart"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"a721f4623a08229487854239857bcf855bc4018b2b7af195867002d31d22febf"}},{"ruleId":"D2","level":"warning","message":{"text":"_BezierIndicatorState._buildSpin (cognitive 38): _BezierIndicatorState._buildSpin has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 13 (25 pts), boolean chains 9, if/else 4 (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":"packages/easy_refresh/lib/src/styles/bezier/bezier_indicator.dart"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"817008aa979bc481d811ff8619aa7584f06d34566391711b4a35452a5b88d8e8"}},{"ruleId":"D2","level":"warning","message":{"text":"_BezierIndicatorState.build (cognitive 36): _BezierIndicatorState.build has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 14 (26 pts), boolean chains 7, if/else 3 (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":"packages/easy_refresh/lib/src/styles/bezier/bezier_indicator.dart"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f80cf3c8502c5246e38c10d822bb74b6048ca3301d5e3e5544e45fb1fb55fec"}},{"ruleId":"D2","level":"warning","message":{"text":"_ERScrollPhysics._applyNestedBoundaryConditions (cognitive 34): _ERScrollPhysics._applyNestedBoundaryConditions has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 16 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/physics/scroll_physics.dart"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"2333fa4fe2d6e2d9b438ec30e4299629298d72574f01d17395a8381bd768e8ee"}},{"ruleId":"D2","level":"warning","message":{"text":"_BezierIndicatorState._buildBalls (cognitive 32): _BezierIndicatorState._buildBalls has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 11 (15 pts), boolean chains 13, if/else 2 (3 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":"packages/easy_refresh/lib/src/styles/bezier/bezier_indicator.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ee5bde083951c07b8b9e40d5a312b618d8837a4acb82d5c5149f268dc7012d"}},{"ruleId":"D2","level":"warning","message":{"text":"_MaterialIndicatorState.build (cognitive 31): _MaterialIndicatorState.build has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 18 (26 pts), boolean chains 3, if/else 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":"packages/easy_refresh/lib/src/styles/material/material_indicator.dart"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a71fdde02bd1819019faf7cd4d2be7b8ddcb9c38f638939d5fcd1cf625a0d5"}},{"ruleId":"D2","level":"warning","message":{"text":"FooterNotifier.animateToOffset (cognitive 29): FooterNotifier.animateToOffset has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 6 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e840023acef0020e339e9b4aa462e7a45610f852b83eff83bd5559452bf3f86"}},{"ruleId":"D2","level":"warning","message":{"text":"HeaderNotifier.animateToOffset (cognitive 24): HeaderNotifier.animateToOffset has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b7b782f415d8696e8ca43218f3facdc99b93982f20169b1d6dedd8397e3a06"}},{"ruleId":"D2","level":"warning","message":{"text":"HeaderNotifier._calculateOffset (cognitive 22): HeaderNotifier._calculateOffset has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (5 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (FooterNotifier._calculateOffset) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"084e5a2a6e71807135928ca2a5fdab3899c0960596a5ed75e93507fdcecd2d8f"}},{"ruleId":"D2","level":"warning","message":{"text":"FooterNotifier._calculateOffset (cognitive 22): FooterNotifier._calculateOffset has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (5 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (HeaderNotifier._calculateOffset) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c66d0f7c859980c83fdf896e79d042ce6640962b1dc0799fdae21574f5ae677"}},{"ruleId":"D2","level":"warning","message":{"text":"_ClassicIndicatorState._buildVerticalWidget (cognitive 22): _ClassicIndicatorState._buildVerticalWidget has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 10 (20 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. This shape REPEATS in the file: one other method here (_ClassicIndicatorState._buildHorizontalWidget) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/styles/classic/classic_indicator.dart"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6e0a0975a3dd51d50d5d870b373738ed7c1a9993421c3c6a367fb26dc9ece3"}},{"ruleId":"D2","level":"warning","message":{"text":"_ClassicIndicatorState._buildHorizontalWidget (cognitive 22): _ClassicIndicatorState._buildHorizontalWidget has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 10 (20 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. This shape REPEATS in the file: one other method here (_ClassicIndicatorState._buildVerticalWidget) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/styles/classic/classic_indicator.dart"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c30dee607bd459c0c7b711db868a5ad4267edb2d5d95a71ec3c50512705b1a"}},{"ruleId":"D2","level":"warning","message":{"text":"_ClassicIndicatorState._buildIcon (cognitive 19): _ClassicIndicatorState._buildIcon has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 7 (8 pts), boolean chains 2 (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":"packages/easy_refresh/lib/src/styles/classic/classic_indicator.dart"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5be58810b3637096a4f3dc0c406798788154b14c3be8a19ea5c01bac35a0c1"}},{"ruleId":"D2","level":"warning","message":{"text":"_CupertinoIndicatorState.build (cognitive 19): _CupertinoIndicatorState.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 10 (14 pts), boolean chains 3, if/else 2 (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":"packages/easy_refresh/lib/src/styles/cupertino/cupertino_indicator.dart"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecf339876a58a3f415c3181a74a29f8901daa5f340a45c1b7614bdab69b2856"}},{"ruleId":"D2","level":"warning","message":{"text":"_EasyRefreshState._bindNestedControllers (cognitive 18): _EasyRefreshState._bindNestedControllers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/easy_refresh.dart"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd42b7117ae50c52aacf11ace7fee98f03792c190b024b3a2283764579baa14a"}},{"ruleId":"D2","level":"warning","message":{"text":"_TaurusIndicatorState.build (cognitive 18): _TaurusIndicatorState.build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1, ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/styles/taurus/taurus_indicator.dart"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"268a00ba744dfe8d3d59fe256406a9a57caa0f9183ae5762cf24dbd93c8892e9"}},{"ruleId":"D2","level":"warning","message":{"text":"IndicatorNotifier._resetBallistic (cognitive 17): IndicatorNotifier._resetBallistic has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3 (4 pts), boolean chains 3 (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":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5140aba5d812eb03fcc483a343eea1e941862c3e1e75129db52f4126b146b66"}},{"ruleId":"D2","level":"warning","message":{"text":"_ERScrollPhysics.applyPhysicsToUserOffset (cognitive 17): _ERScrollPhysics.applyPhysicsToUserOffset has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 7, ternaries 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":"packages/easy_refresh/lib/src/physics/scroll_physics.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f21571c05d7e83b5e1a58d7d27e9aa8adb896fc9f6f4cc737d3737ab45115c"}},{"ruleId":"D2","level":"warning","message":{"text":"IndicatorNotifier._updateBySimulation (cognitive 16): IndicatorNotifier._updateBySimulation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"043857ebe047355556561d29c51d812ccf4c4bba23bbc4da4dc0910727262bcd"}},{"ruleId":"D2","level":"warning","message":{"text":"_BezierCircleIndicatorState.build (cognitive 16): _BezierCircleIndicatorState.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (6 pts), boolean chains 2 (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":"packages/easy_refresh/lib/src/styles/bezier/bezier_circle_indicator.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76e4efc137cb78d0bc788f1a3aa29daa491d420df8d5836d7f8b8d27c78d571"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IndicatorNotifier: TooManyMethods \u2014 95 methods. The bar is 30 methods; this is 65 over it, 3.17\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":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8accbbbc50a64015c02c42bfdb572232a310a9893b498af3aeeb875dcd2c796b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: notifier/indicator_notifier.dart: FileTooLong \u2014 1081 significant lines (blank, comment-only and punctuation-only lines excluded), about 70% of them inside a single declaration: IndicatorNotifier (12-1261). The bar is 500 significant lines; this is 581 over it, 2.16\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":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2f5c3d6706bcd7999bdae2eaa08a1226001c8136791211e1ed84f01eb39b67"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IndicatorNotifier: ClassTooLong \u2014 754 significant lines (blank, comment-only and punctuation-only lines excluded), 95 methods. The bar is 400 significant lines; this is 354 over it, 1.89\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"114b7600a04d6207dcc3aa8da674835c189794dd247e8106228247b4a6e94825"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/easy_refresh.dart: FileTooLong \u2014 815 significant lines (blank, comment-only and punctuation-only lines excluded), about 74% of them inside a single declaration: _EasyRefreshState (395-1261). The bar is 500 significant lines; this is 315 over it, 1.63\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":"packages/easy_refresh/lib/src/easy_refresh.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16319e275a60c612063e8acaf24c12903c8b6165187348999e50d2d639f3954c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ERScrollPhysics.applyBoundaryConditions: MethodTooLong \u2014 applyBoundaryConditions runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\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":"packages/easy_refresh/lib/src/physics/scroll_physics.dart"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"295043a96fc65bc0366213e5e107c307396101be3e52a02cd862ed0ac719880e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _EasyRefreshState: ClassTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods. The bar is 400 significant lines; this is 201 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/easy_refresh.dart"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"801bcfe01c25c7d15e208f48710fc09313af998f9eeae31e961fc388c2a6f56d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _ERScrollPhysics: ClassTooLong \u2014 600 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 200 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/physics/scroll_physics.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d059e5575f4dc16b8ce59126a8e4c3a853874afa457818cbffc64e03d6b3aae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: physics/scroll_physics.dart: FileTooLong \u2014 657 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: _ERScrollPhysics (10-852). The bar is 500 significant lines; this is 157 over it, 1.31\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":"packages/easy_refresh/lib/src/physics/scroll_physics.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d016028c134c7f4f2602e6ea854b91e0bd20f7015b0d5aa1d5cfb9dec9cfcf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _TaurusIndicatorState.build: MethodTooLong \u2014 build runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\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":"packages/easy_refresh/lib/src/styles/taurus/taurus_indicator.dart"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8de9cd0b70ce3d9136e16530a87aad1062c7f3baf72cdde8c006e194d64d31"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _EasyRefreshState: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\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":"packages/easy_refresh/lib/src/easy_refresh.dart"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ccbb34e7915f94e1afb7efa9b0b3e7ac516ea65002be27684739655dfe1bc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): packages/easy_refresh/lib/src/styles/cupertino/cupertino_indicator.dart:262-325 | packages/easy_refresh/lib/src/styles/cupertino/cupertino_indicator.dart:327-390 \u2014 These two members are one piece of code written twice and then edited apart: 64 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":"packages/easy_refresh/lib/src/styles/cupertino/cupertino_indicator.dart"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a4aa1ebfec5c11ede158f4895c238c319c43efb08fdabf031806754f6322e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (79 corresponding lines): packages/easy_refresh/lib/src/notifier/indicator_notifier.dart:1418-1496 | packages/easy_refresh/lib/src/notifier/indicator_notifier.dart:1627-1716 \u2014 These two members are one piece of code written twice and then edited apart: 79 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":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d278c2439bffa0bdbd3bf98bb857f900a9834d9d9e8f95b61942e9cc6dbe0b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart:171-220 | packages/easy_refresh/lib/src/indicator/header/header_locator.dart:173-220 \u2014 These two members are one piece of code written twice and then edited apart: 48 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":"packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ce9707c0e05e5306a4751cab7143d5fd163a4e1747277db704c34c6ee6cb12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart:31-69 | packages/easy_refresh/lib/src/indicator/header/header_locator.dart:31-69 \u2014 These two members are one piece of code written twice and then edited apart: 39 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":"packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cd7b79e69db5c0893a8733c9de2ce4954359cbfedc03c24351270a90768297"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): packages/easy_refresh/lib/src/styles/classic/footer/classic_footer.dart:146-181 | packages/easy_refresh/lib/src/styles/classic/header/classic_header.dart:146-181 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/styles/classic/footer/classic_footer.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8825aae03cd31057ef67556630c2da0a3c482345a4dfd625d415d606fe8312"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): packages/easy_refresh/lib/src/notifier/indicator_notifier.dart:1332-1364 | packages/easy_refresh/lib/src/notifier/indicator_notifier.dart:1541-1573 \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":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cb4a4e95d5eb335442e31437ab2801592c0e45ca51864e7b862b2af30ba59a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart:130-155 | packages/easy_refresh/lib/src/indicator/header/header_locator.dart:132-157 \u2014 These two members are one piece of code written twice and then edited apart: 26 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":"packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d6bea6c542a2fe83e63357750ba959983e64831fde1b26723b4eb7ad06edb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart:104-128 | packages/easy_refresh/lib/src/indicator/header/header_locator.dart:106-130 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fbd8bfba00f669391666bb80a5a25b6d28f97f2a76bfa9a7009e73216ecddc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): packages/easy_refresh/lib/src/styles/material/footer/material_footer.dart:113-137 | packages/easy_refresh/lib/src/styles/material/header/material_header.dart:113-137 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/styles/material/footer/material_footer.dart"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9c7cfc0a45deb69bd621c2c63207cff5964fe8b1c45b5ff13567143d99517f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 21\u002B corresponding lines): packages/easy_refresh_bow/lib/src/bow_indicator.dart:158-187 | packages/easy_refresh_bubbles/lib/src/bubbles_indicator.dart:148-170 | packages/easy_refresh_skating/lib/src/skating_indicator.dart:135-155 | packages/easy_refresh_space/lib/src/space_indicator.dart:147-169 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh_bow/lib/src/bow_indicator.dart"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b908894f6ed900558254fe2d7da3e0872a25a25cfb53dd5ab0e8cf8507eb2d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): packages/easy_refresh_bow/lib/src/bow_indicator.dart:64-86 | packages/easy_refresh_bubbles/lib/src/bubbles_indicator.dart:63-80 | packages/easy_refresh_skating/lib/src/skating_indicator.dart:59-84 | packages/easy_refresh_space/lib/src/space_indicator.dart:57-77 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 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":"packages/easy_refresh_bow/lib/src/bow_indicator.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a72083cab9be0d32bf13298d278a61d9e53f8d1d6e2bbde1c8de4be072cb8dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): packages/easy_refresh/lib/src/styles/bezier/footer/bezier_footer.dart:58-74 | packages/easy_refresh/lib/src/styles/bezier/header/bezier_header.dart:58-74 \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":"packages/easy_refresh/lib/src/styles/bezier/footer/bezier_footer.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4655a58a1fe48ae9ae0c35e67b3c1d9b4cab79c2e5e2bb14a2eb2543a63833a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): packages/easy_refresh_space/lib/src/space_indicator.dart:89-99 | packages/easy_refresh_bow/lib/src/bow_indicator.dart:99-108 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh_space/lib/src/space_indicator.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"862e3c33e89cfd3f7accae47f243c9095233c35727212f673c7f02381fcdeb0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): packages/easy_refresh_bow/lib/src/bow_indicator.dart:88-97 | packages/easy_refresh_skating/lib/src/skating_indicator.dart:86-95 | packages/easy_refresh_space/lib/src/space_indicator.dart:79-87 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh_bow/lib/src/bow_indicator.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb76855246cd80dddd1a0caf7ac9f9af855f8aa25b9f22157c5519917a0690c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): packages/easy_refresh/lib/src/styles/bezier/bezier_circle_indicator.dart:67-74 | packages/easy_refresh/lib/src/styles/taurus/taurus_indicator.dart:100-106 \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":"packages/easy_refresh/lib/src/styles/bezier/bezier_circle_indicator.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd140852bae131b6ceac2820446fc1a5e336d87ca06fc1118b9328999263a0e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): packages/easy_refresh/lib/src/indicator/indicator.dart:274-280 | packages/easy_refresh/lib/src/notifier/indicator_notifier.dart:1290-1296 \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":"packages/easy_refresh/lib/src/indicator/indicator.dart"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bb986ad7c615f9d54f14ba40b466aea1841418e7be30664402bdf8813acf43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201334 lines \u00D7 2): packages/easy_refresh/lib/src/notifier/indicator_notifier.dart:1464-1496 | packages/easy_refresh/lib/src/notifier/indicator_notifier.dart:1683-1716 \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 \u0060packages/easy_refresh/lib/src/notifier/indicator_notifier.dart:1464\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":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d38a95030c12d14e288fb6ff4b4430aa3d9774c5090ca419c5ccbe0e8bd32d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): packages/easy_refresh/lib/src/styles/cupertino/cupertino_indicator.dart:280-307 | packages/easy_refresh/lib/src/styles/cupertino/cupertino_indicator.dart:345-372 \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 \u0060packages/easy_refresh/lib/src/styles/cupertino/cupertino_indicator.dart:280\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/styles/cupertino/cupertino_indicator.dart"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a904f806527fd56d632bb625fec05479f57c16e83a38b9bd0e2958ba49b7ff20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart:171-197 | packages/easy_refresh/lib/src/indicator/header/header_locator.dart:173-199 \u2014 \u0060packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart\u0060 and \u0060packages/easy_refresh/lib/src/indicator/header/header_locator.dart\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 75 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart:171\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":"packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"792fd906e4c4a5b40e938828c2e3a8a25693f8a27e59335d42180f2256090bb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): example/lib/widget/paths_painter.dart:70-93 | packages/easy_refresh/lib/src/painter/paths_painter.dart:70-93 \u2014 before extracting anything, compare \u0060example/lib/widget/paths_painter.dart\u0060 and \u0060packages/easy_refresh/lib/src/painter/paths_painter.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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/widget/paths_painter.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b691ddf56a2e814f8148870c7774402a91eba91bcee31c7ce42db196c97360"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart:107-128 | packages/easy_refresh/lib/src/indicator/header/header_locator.dart:109-130 \u2014 \u0060packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart\u0060 and \u0060packages/easy_refresh/lib/src/indicator/header/header_locator.dart\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 75 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart:107\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":"packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b131c2b3a8e9dec1a27ccf4a693cd13190bc1e82f44818e789eea7fd13ca7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): packages/easy_refresh/lib/src/styles/classic/footer/classic_footer.dart:146-166 | packages/easy_refresh/lib/src/styles/classic/header/classic_header.dart:146-166 \u2014 \u0060packages/easy_refresh/lib/src/styles/classic/footer/classic_footer.dart\u0060 and \u0060packages/easy_refresh/lib/src/styles/classic/header/classic_header.dart\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 21 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/easy_refresh/lib/src/styles/classic/footer/classic_footer.dart:146\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/styles/classic/footer/classic_footer.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fea5d4e3240b0fd2c726bf60261972e60c781b4ed35e5d4542f661367dda12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): packages/easy_paging/lib/easy_paging.dart:364-382 | packages/easy_paging/lib/easy_paging.dart:387-405 \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":"packages/easy_paging/lib/easy_paging.dart"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0781d83c471c68f6f48ecaf6883a5118056b261ef2b479b2af3fbcc90e720f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): packages/easy_refresh/lib/src/styles/material/footer/material_footer.dart:120-137 | packages/easy_refresh/lib/src/styles/material/header/material_header.dart:120-137 \u2014 \u0060packages/easy_refresh/lib/src/styles/material/footer/material_footer.dart\u0060 and \u0060packages/easy_refresh/lib/src/styles/material/header/material_header.dart\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 18 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/easy_refresh/lib/src/styles/material/footer/material_footer.dart:120\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":"packages/easy_refresh/lib/src/styles/material/footer/material_footer.dart"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6bfb3ba74757bb3e1440ec08300abaedd3a0d19fbc686640150cfbda7eaf7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): example/lib/widget/paths_painter.dart:117-132 | packages/easy_refresh/lib/src/painter/paths_painter.dart:117-132 \u2014 before extracting anything, compare \u0060example/lib/widget/paths_painter.dart\u0060 and \u0060packages/easy_refresh/lib/src/painter/paths_painter.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example/lib/widget/paths_painter.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66d1beb79dd4ec44f97dbed08afb91fafc4c6919a64201835aed209c9634ab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart:34-49 | packages/easy_refresh/lib/src/indicator/header/header_locator.dart:34-49 \u2014 \u0060packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart\u0060 and \u0060packages/easy_refresh/lib/src/indicator/header/header_locator.dart\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 75 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart:34\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeeba0620342c7a81ee10e8444ab2f7faab75026d8163a6f7969ec631ddf3cb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): packages/easy_refresh/lib/src/notifier/indicator_notifier.dart:1425-1440 | packages/easy_refresh/lib/src/notifier/indicator_notifier.dart:1634-1649 \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 \u0060packages/easy_refresh/lib/src/notifier/indicator_notifier.dart:1425\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"36826d508b953795320846bb15b7538018bc952d0d83a426354c7cdb1a65e084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): packages/easy_refresh/lib/src/notifier/indicator_notifier.dart:1347-1360 | packages/easy_refresh/lib/src/notifier/indicator_notifier.dart:1556-1569 \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 \u0060packages/easy_refresh/lib/src/notifier/indicator_notifier.dart:1347\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"51eceb2ab0743d4029c8b6babaa3f93c02825b6c27c3b165f38a913fec82f13a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): packages/easy_refresh/lib/src/styles/cupertino/cupertino_indicator.dart:265-278 | packages/easy_refresh/lib/src/styles/cupertino/cupertino_indicator.dart:330-343 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/easy_refresh/lib/src/styles/cupertino/cupertino_indicator.dart:265\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":"packages/easy_refresh/lib/src/styles/cupertino/cupertino_indicator.dart"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0bdc8033288ffc31f432730b41c559195b37aafeae5d66874d0e085eb8a42a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): packages/easy_refresh_bubbles/lib/src/bubbles_indicator.dart:148-159 | packages/easy_refresh_skating/lib/src/skating_indicator.dart:135-146 | packages/easy_refresh_space/lib/src/space_indicator.dart:147-158 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/easy_refresh_bubbles/lib/src/bubbles_indicator.dart:148\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh_bubbles/lib/src/bubbles_indicator.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"9517cedba65d24b131518efd2dcfd9f770f19c778f1ae13d0aab55b1d34d805b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart:211-220 | packages/easy_refresh/lib/src/indicator/header/header_locator.dart:211-220 \u2014 \u0060packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart\u0060 and \u0060packages/easy_refresh/lib/src/indicator/header/header_locator.dart\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 75 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart:211\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":"packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d92d3e5953c16e99f30a2d3609569ea91c2f5d6a555877bc42e45cf199c13c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): packages/easy_refresh/lib/src/physics/scroll_physics.dart:250-259 | packages/easy_refresh/lib/src/physics/scroll_physics.dart:595-604 \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":"packages/easy_refresh/lib/src/physics/scroll_physics.dart"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"102fae8153014fd18527bd987ef5cd9477dd075cf70886d26cc0c5b5b0c42e25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): packages/easy_refresh_halloween/lib/src/halloween_indicator.dart:143-152 | packages/easy_refresh_squats/lib/src/squats_indicator.dart:85-94 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"packages/easy_refresh_halloween/lib/src/halloween_indicator.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb7311096b8d1e2d56811eadf1ac68d6109a830d217d726e7b5a993b938eb4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): example/lib/widget/paths_painter.dart:62-68 | packages/easy_refresh/lib/src/painter/paths_painter.dart:62-68 \u2014 before extracting anything, compare \u0060example/lib/widget/paths_painter.dart\u0060 and \u0060packages/easy_refresh/lib/src/painter/paths_painter.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example/lib/widget/paths_painter.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4687a18d410dcc22a48389d671e0aa33106b125737575b854c3ac3c3f9ec0317"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): example/lib/widget/paths_painter.dart:138-146 | packages/easy_refresh/lib/src/painter/paths_painter.dart:138-146 \u2014 before extracting anything, compare \u0060example/lib/widget/paths_painter.dart\u0060 and \u0060packages/easy_refresh/lib/src/painter/paths_painter.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example/lib/widget/paths_painter.dart"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73a338ebd3299f8b886b532c5462ad83e8a3bc20b53748a723122b841f0f1e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): packages/easy_refresh/lib/src/styles/bezier/bezier_indicator.dart:89-97 | packages/easy_refresh/lib/src/styles/phoenix/phoenix_indicator.dart:85-93 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/styles/bezier/bezier_indicator.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b83cc464ed4dbd66823c8541cc22dc726ea547f0f9f7895289d9f20814910e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): packages/easy_refresh/lib/src/styles/bezier/bezier_indicator.dart:99-104 | packages/easy_refresh/lib/src/styles/delivery/delivery_indicator.dart:121-126 | packages/easy_refresh/lib/src/styles/phoenix/phoenix_indicator.dart:95-100 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/styles/bezier/bezier_indicator.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4318e2bce8c2a9855177031cfcfc4f9d6c7b90be330cd4526c338cd38553077e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): packages/easy_refresh/lib/src/styles/cupertino/footer/cupertino_footer.dart:52-63 | packages/easy_refresh/lib/src/styles/cupertino/header/cupertino_header.dart:52-63 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"packages/easy_refresh/lib/src/styles/cupertino/footer/cupertino_footer.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de66f38d785ca4020eca69133ca4af1016bf83d8dc51ede3a26cb9e0fb41c46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): packages/easy_refresh/lib/src/styles/delivery/footer/delivery_footer.dart:31-43 | packages/easy_refresh/lib/src/styles/delivery/header/delivery_header.dart:31-43 \u2014 \u0060packages/easy_refresh/lib/src/styles/delivery/footer/delivery_footer.dart\u0060 and \u0060packages/easy_refresh/lib/src/styles/delivery/header/delivery_header.dart\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 13 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"packages/easy_refresh/lib/src/styles/delivery/footer/delivery_footer.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53f6380fa6ae1f5e45f6dc2b2115731d1b4c7e4f10616ba9cbc96d98d91c61c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): packages/easy_refresh/lib/src/styles/phoenix/footer/phoenix_footer.dart:30-42 | packages/easy_refresh/lib/src/styles/phoenix/header/phoenix_header.dart:30-42 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"packages/easy_refresh/lib/src/styles/phoenix/footer/phoenix_footer.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"37442f86506fd42ace98d0990514de4e55398dfa9db548aa8cedcb3b6b4afb9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): packages/easy_refresh/lib/src/styles/taurus/footer/taurus_footer.dart:29-41 | packages/easy_refresh/lib/src/styles/taurus/header/taurus_header.dart:29-41 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"packages/easy_refresh/lib/src/styles/taurus/footer/taurus_footer.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebec7ef11336a8d623abba405c7af9fb09c3173dda793490d4873151a95b42e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): packages/easy_refresh_bow/lib/src/bow_footer.dart:23-30 | packages/easy_refresh_bow/lib/src/bow_header.dart:23-30 \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":"packages/easy_refresh_bow/lib/src/bow_footer.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8187f7f5b9c464e8380111598ca0cd69ae275262857487f51b7d7ab3707ca4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): packages/easy_refresh_bow/lib/src/bow_indicator.dart:54-62 | packages/easy_refresh_bubbles/lib/src/bubbles_indicator.dart:53-61 | packages/easy_refresh_skating/lib/src/skating_indicator.dart:49-57 | packages/easy_refresh_space/lib/src/space_indicator.dart:47-55 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. 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":"packages/easy_refresh_bow/lib/src/bow_indicator.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4024234abc2035d36807c0afaad0711e2af502098ecc1d1d5d87c00fbfa50c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): packages/easy_refresh_bubbles/lib/src/bubbles_footer.dart:22-29 | packages/easy_refresh_bubbles/lib/src/bubbles_header.dart:22-29 \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":"packages/easy_refresh_bubbles/lib/src/bubbles_footer.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43d295b681d9b1260983c845042275fa30fd00f9f43b3d24884e7444bb59d58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): packages/easy_refresh_halloween/lib/src/halloween_footer.dart:22-29 | packages/easy_refresh_halloween/lib/src/halloween_header.dart:22-29 \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":"packages/easy_refresh_halloween/lib/src/halloween_footer.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"db870276cac095b29d4f0a56f0c49e4f77eb663e34302e669b7a3478fd396af4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): packages/easy_refresh_halloween/lib/src/halloween_indicator.dart:176-183 | packages/easy_refresh_squats/lib/src/squats_indicator.dart:96-103 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh_halloween/lib/src/halloween_indicator.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b81e4e24e6802014e94c45019da2d3971d5ff65824b4e469702cc9890c3d9f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): packages/easy_refresh_skating/lib/src/skating_footer.dart:21-28 | packages/easy_refresh_skating/lib/src/skating_header.dart:21-28 \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":"packages/easy_refresh_skating/lib/src/skating_footer.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4506332b9bf4782b9f95995aa42a6036a173f702dc117f98200ec910e79c370c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): packages/easy_refresh_space/lib/src/space_footer.dart:22-29 | packages/easy_refresh_space/lib/src/space_header.dart:22-29 \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":"packages/easy_refresh_space/lib/src/space_footer.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4986bea0ce9a1b7194dbe44847233269edead3a825ca0c88dabdd0dee2398f7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): packages/easy_refresh_squats/lib/src/squats_footer.dart:26-38 | packages/easy_refresh_squats/lib/src/squats_header.dart:26-38 \u2014 before extracting anything, compare \u0060packages/easy_refresh_squats/lib/src/squats_footer.dart\u0060 and \u0060packages/easy_refresh_squats/lib/src/squats_header.dart\u0060 as WHOLE FILES: 83% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"packages/easy_refresh_squats/lib/src/squats_footer.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"becb373e03534afbd7a371aba3d56a721a6c80228d7fc179be9cab171ddb5056"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (16 members, 11 shared lines): example/lib/example.dart:41-86 | example/lib/page/sample/page_view_page.dart:35-116 | example/lib/page/sample/refresh_on_start_page.dart:33-98 | example/lib/page/style/bezier_circle_page.dart:33-87 | example/lib/page/style/bezier_page.dart:133-371 | example/lib/page/style/bubbles_page.dart:33-77 | example/lib/page/style/classical_page.dart:47-336 | example/lib/page/style/cupertino_page.dart:33-139 | example/lib/page/style/delivery_page.dart:33-87 | example/lib/page/style/halloween_page.dart:33-77 | example/lib/page/style/material_page.dart:39-260 | example/lib/page/style/phoenix_page.dart:33-103 | example/lib/page/style/skating_page.dart:33-77 | example/lib/page/style/space_page.dart:33-77 | example/lib/page/style/squats_page.dart:33-77 | example/lib/page/style/taurus_page.dart:33-103 \u2014 These 16 members are variants of one another: a block of 11 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 16 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 16 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example/lib/example.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b27ee8b2f79b6ee725f7928c92b5855452a6eeb3e7f5799589d734bff3369a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): example/lib/page/more/more_page.dart:16-79 | example/lib/page/more/support_me_page.dart:21-97 | example/lib/page/sample/sample_page.dart:16-145 | example/lib/page/style/style_page.dart:14-123 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example/lib/page/more/more_page.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"190515cc23a5928af6c6f27578133760f2d0e93478a8080d099db87040368dfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (144 corresponding lines): example/lib/page/sample/easy_refresh_nested_page.dart:38-181 | example/lib/page/sample/tab_bar_view_page.dart:36-197 \u2014 These two members are one piece of code written twice and then edited apart: 144 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/page/sample/easy_refresh_nested_page.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9020461d31d4786b36cde41f43a67556dddbe56fb2ea474f4a0d56157d5fd4b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 36\u002B corresponding lines): packages/easy_refresh_bow/example/main.dart:26-61 | packages/easy_refresh_bubbles/example/main.dart:26-65 | packages/easy_refresh_halloween/example/main.dart:26-65 | packages/easy_refresh_skating/example/main.dart:26-65 | packages/easy_refresh_space/example/main.dart:26-65 | packages/easy_refresh_squats/example/main.dart:26-65 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 36 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh_bow/example/main.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8956b9f5a487a6e40fe5d625e39aff62638fb337711f1dd8371c46138bfe42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): example/lib/page/sample/user_profile_page.dart:207-218 | example/lib/page/sample/user_profile_page.dart:233-245 \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/page/sample/user_profile_page.dart"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10e444088ddee01b5eba19f1172e2a2bc1d84fa9edd5c5a2b8eb307d4e847b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): example/lib/page/sample/nested_scroll_view.dart:43-55 | example/lib/page/sample/nested_scroll_view.dart:57-67 | example/lib/page/sample/test_page.dart:68-83 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 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":"example/lib/page/sample/nested_scroll_view.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00d188c69c43764388c56b1cf615af1431a6d8fc25e6b7ee00eb8a1a24c0794"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (99\u2013101 lines \u00D7 3): example/lib/page/style/bezier_page.dart:184-282 | example/lib/page/style/classical_page.dart:110-210 | example/lib/page/style/material_page.dart:76-174 \u2014 before extracting anything, compare \u0060example/lib/page/style/bezier_page.dart\u0060 and \u0060example/lib/page/style/classical_page.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 129 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 \u0060example/lib/page/style/bezier_page.dart:184\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example/lib/page/style/bezier_page.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e93d5fc46d110dc9319b1e8b1532d0a2db39d8d85e2464b2664b87c8f3902c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (54 lines \u00D7 2): example/lib/page/sample/easy_refresh_nested_page.dart:43-96 | example/lib/page/sample/tab_bar_view_page.dart:45-98 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example/lib/page/sample/easy_refresh_nested_page.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"357ccf4da60393daa2fa3232d03bb2a1485ff505f1ce9e1167d0e7de71905900"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): example/lib/page/style/phoenix_page.dart:61-96 | example/lib/page/style/taurus_page.dart:61-96 \u2014 before extracting anything, compare \u0060example/lib/page/style/phoenix_page.dart\u0060 and \u0060example/lib/page/style/taurus_page.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 89 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 \u0060example/lib/page/style/phoenix_page.dart:61\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example/lib/page/style/phoenix_page.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ad8cd9f6dca429adb5301ff5a1ce15bcf4645c36bd053c2d022639b65922aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 5): packages/easy_refresh_bubbles/example/main.dart:33-61 | packages/easy_refresh_halloween/example/main.dart:33-61 | packages/easy_refresh_skating/example/main.dart:33-61 | packages/easy_refresh_space/example/main.dart:33-61 | packages/easy_refresh_squats/example/main.dart:33-61 \u2014 before extracting anything, compare \u0060packages/easy_refresh_bubbles/example/main.dart\u0060 and \u0060packages/easy_refresh_halloween/example/main.dart\u0060 as WHOLE FILES: 85% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/easy_refresh_bubbles/example/main.dart:33\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":"packages/easy_refresh_bubbles/example/main.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9eb28f7855f1aa7c72512bec591efe032923809d80f4b64497bef2db7407ca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): example/lib/page/style/classical_page.dart:223-249 | example/lib/page/style/material_page.dart:176-202 \u2014 before extracting anything, compare \u0060example/lib/page/style/classical_page.dart\u0060 and \u0060example/lib/page/style/material_page.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 173 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 \u0060example/lib/page/style/classical_page.dart:223\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":"example/lib/page/style/classical_page.dart"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"b558bbe35a1ce74b40cd7e9289785af8cb3f2ed9838339f024785a5a7f31d0cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 5): example/lib/page/style/bubbles_page.dart:53-77 | example/lib/page/style/halloween_page.dart:53-77 | example/lib/page/style/skating_page.dart:53-77 | example/lib/page/style/space_page.dart:53-77 | example/lib/page/style/squats_page.dart:53-77 \u2014 before extracting anything, compare \u0060example/lib/page/style/bubbles_page.dart\u0060 and \u0060example/lib/page/style/halloween_page.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 74 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 \u0060example/lib/page/style/bubbles_page.dart:53\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":"example/lib/page/style/bubbles_page.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e9c576792e107f8133c1ad269f4337d388e7965c491116876a6bc42e35b8ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 18): example/lib/example.dart:49-70 | example/lib/page/sample/carousel_page.dart:41-62 | example/lib/page/sample/listener_header_page.dart:46-67 | example/lib/page/sample/page_view_page.dart:80-101 | example/lib/page/sample/refresh_on_start_page.dart:64-85 | example/lib/page/sample/secondary_page.dart:181-202 | example/lib/page/style/bezier_circle_page.dart:49-70 | example/lib/page/style/bezier_page.dart:171-192 | example/lib/page/style/bubbles_page.dart:40-61 | example/lib/page/style/cupertino_page.dart:76-97 | example/lib/page/style/delivery_page.dart:41-62 | example/lib/page/style/halloween_page.dart:40-61 | example/lib/page/style/material_page.dart:63-84 | example/lib/page/style/phoenix_page.dart:48-69 | example/lib/page/style/skating_page.dart:40-61 | example/lib/page/style/space_page.dart:40-61 | example/lib/page/style/squats_page.dart:40-61 | example/lib/page/style/taurus_page.dart:48-69 \u2014 before extracting anything, compare \u0060example/lib/example.dart\u0060 and \u0060example/lib/page/style/bezier_circle_page.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060example/lib/example.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060example/lib/example.dart:47\u0060 calls \u0060ClassicHeader\u0060, \u0060ClassicFooter\u0060 and \u0060example/lib/page/sample/carousel_page.dart:40\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":"example/lib/example.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2445df6a8befdfe4c230334d3f7c27bfe323acaa3b7ea84b1d6edd24eb251ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): example/lib/page/style/cupertino_page.dart:43-63 | example/lib/page/style/cupertino_page.dart:105-125 \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 \u0060example/lib/page/style/cupertino_page.dart:43\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":"example/lib/page/style/cupertino_page.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"334e88fab4b5e80d717eb1ed42721901c18a7d5d98c38fd51494e0c303c5adb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4): example/lib/page/more/more_page.dart:16-35 | example/lib/page/more/support_me_page.dart:21-40 | example/lib/page/sample/sample_page.dart:16-35 | example/lib/page/style/style_page.dart:14-33 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060example/lib/page/more/more_page.dart:16\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example/lib/page/more/more_page.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a2adefde5f6e4c6e8c7976ad6b9b10e350c195b5f8b883bea27f98652d368e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 6): example/lib/example.dart:70-86 | packages/easy_refresh_bubbles/example/main.dart:50-65 | packages/easy_refresh_halloween/example/main.dart:50-65 | packages/easy_refresh_skating/example/main.dart:50-65 | packages/easy_refresh_space/example/main.dart:50-65 | packages/easy_refresh_squats/example/main.dart:50-65 \u2014 before extracting anything, compare \u0060example/lib/example.dart\u0060 and \u0060packages/easy_refresh_bubbles/example/main.dart\u0060 as WHOLE FILES: 85% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060example/lib/example.dart:70\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":"example/lib/example.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92fba39f0948987ddeb4e087fed6c8315b991df34ea248708a32d6efb17f70a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): example/lib/page/style/delivery_page.dart:71-87 | example/lib/page/style/phoenix_page.dart:87-103 | example/lib/page/style/taurus_page.dart:87-103 \u2014 before extracting anything, compare \u0060example/lib/page/style/delivery_page.dart\u0060 and \u0060example/lib/page/style/phoenix_page.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 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 \u0060example/lib/page/style/delivery_page.dart:71\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":"example/lib/page/style/delivery_page.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ea426a1e31d15acf53a4aac45a2239a3884dd20d62d610aa6eedb183d6f405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): example/lib/page/style/classical_page.dart:285-301 | example/lib/page/style/material_page.dart:231-247 \u2014 before extracting anything, compare \u0060example/lib/page/style/classical_page.dart\u0060 and \u0060example/lib/page/style/material_page.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 173 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 \u0060example/lib/page/style/classical_page.dart:285\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":"example/lib/page/style/classical_page.dart"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d5adcfc91351f970ef8c97b6d23821e6cb24a84dafc047854d23d2070e0d0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 5): example/lib/example.dart:61-72 | example/lib/page/style/bezier_circle_page.dart:61-72 | example/lib/page/style/bezier_page.dart:183-194 | example/lib/page/style/classical_page.dart:109-122 | example/lib/page/style/material_page.dart:75-86 \u2014 before extracting anything, compare \u0060example/lib/example.dart\u0060 and \u0060example/lib/page/style/bezier_circle_page.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060example/lib/example.dart:61\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example/lib/example.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd7e4f0863225abd2400f1bc62e7075873e5539c031558dcd2fccb0a27e6ab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 6): example/lib/page/style/bow_page.dart:52-64 | example/lib/page/style/bubbles_page.dart:56-67 | example/lib/page/style/halloween_page.dart:56-67 | example/lib/page/style/skating_page.dart:56-67 | example/lib/page/style/space_page.dart:56-67 | example/lib/page/style/squats_page.dart:56-67 \u2014 before extracting anything, compare \u0060example/lib/page/style/bubbles_page.dart\u0060 and \u0060example/lib/page/style/halloween_page.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 74 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 \u0060example/lib/page/style/bow_page.dart:52\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example/lib/page/style/bow_page.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6411f9aa9c448db42b19298ae830028f329b79e4ec25a393755553c0d9ef7eb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): example/lib/page/sample/nested_scroll_view.dart:124-135 | example/lib/page/sample/nested_scroll_view.dart:177-188 \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 \u0060example/lib/page/sample/nested_scroll_view.dart:124\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":"example/lib/page/sample/nested_scroll_view.dart"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91c9dc6c723d1ce65a440d1f60c20cc3920d1c057d6134cb6ee64076280759d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 19): example/lib/example.dart:61-71 | example/lib/page/sample/carousel_page.dart:53-63 | example/lib/page/sample/listener_header_page.dart:58-68 | example/lib/page/sample/page_view_page.dart:92-102 | example/lib/page/sample/refresh_on_start_page.dart:76-86 | example/lib/page/sample/secondary_page.dart:193-203 | example/lib/page/style/bezier_circle_page.dart:61-71 | example/lib/page/style/bezier_page.dart:183-193 | example/lib/page/style/bubbles_page.dart:52-62 | example/lib/page/style/classical_page.dart:108-121 | example/lib/page/style/cupertino_page.dart:88-98 | example/lib/page/style/delivery_page.dart:53-63 | example/lib/page/style/halloween_page.dart:52-62 | example/lib/page/style/material_page.dart:75-85 | example/lib/page/style/phoenix_page.dart:60-70 | example/lib/page/style/skating_page.dart:52-62 | example/lib/page/style/space_page.dart:52-62 | example/lib/page/style/squats_page.dart:52-62 | example/lib/page/style/taurus_page.dart:60-70 \u2014 before extracting anything, compare \u0060example/lib/example.dart\u0060 and \u0060example/lib/page/style/bezier_circle_page.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060example/lib/page/style/classical_page.dart:108\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":"example/lib/example.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57e005ebfd32ab5782f1f51bc2e7c3db27b89f25a007375203c824e5ed574ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): example/lib/page/sample/nested_scroll_view.dart:44-54 | example/lib/page/sample/test_page.dart:71-81 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example/lib/page/sample/nested_scroll_view.dart"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"abca3ab3b4af61a5d331f654c7962067f8df9a8fe3fd64f08bb8da6bc6003e65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): example/lib/page/sample/nested_scroll_view.dart:78-88 | example/lib/page/sample/tab_bar_view_page.dart:99-109 \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 \u0060example/lib/page/sample/nested_scroll_view.dart:78\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060example/lib/page/sample/tab_bar_view_page.dart:110\u0060 calls \u0060sliver\u0060 and \u0060example/lib/page/sample/nested_scroll_view.dart:89\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":"example/lib/page/sample/nested_scroll_view.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5cec0b1d93fcca3217afd1e2026336d2f13476b6e3f03630610f438dd9a506"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: easy_paging: easy_paging: abstractness 1.00, instability 1.00, distance 1.00 \u2014 zone of uselessness \u2014 abstract and unstable, so it\u0027s likely unused."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5a6a515947b0f48234db2aa554f408746d3ca4a54ee02676936afd61956bd4b8"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: easy_refresh: easy_refresh: abstractness 0.07, instability 0.00, distance 0.93 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"12008db4ecdc88bebcc2e93d70e8401d11afc819ba2b34e2e27a914cd9a381df"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: IndicatorNotifier (LCOM4 7): IndicatorNotifier\u0027s methods fall into 7 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 7 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":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b6c652747caffe5260cbdc9146b082e1f2719781ed98777a19161b09a24795"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CustomPagingState (LCOM4 6): CustomPagingState\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"example/lib/page/sample/paging_page.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe6753c45d648520440d214b8526e9fedf7777f5edd91af49f89df63424a398"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ERScrollBehavior (LCOM4 4): ERScrollBehavior\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/behavior/scroll_behavior.dart"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca8c136897150e990b87150bbaa4124c4d145f9fe171c8653bed82ebfd88f58"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/easy_refresh/lib/src/physics/scroll_physics.dart: packages/easy_refresh/lib/src/physics/scroll_physics.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in _ERScrollPhysics.applyBoundaryConditions at line 245. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 23:16:47 \u002B08:00\u0027 --until=\u00272026-10-23 23:16:47 \u002B08:00\u0027 --full-history --no-merges -- packages/easy_refresh/lib/src/physics/scroll_physics.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":"packages/easy_refresh/lib/src/physics/scroll_physics.dart"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c2f9e1fd10d8ec1666af34880aa645756b18033934214dc0d0f722af067b26"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/easy_refresh/lib/src/notifier/indicator_notifier.dart: packages/easy_refresh/lib/src/notifier/indicator_notifier.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in IndicatorNotifier._updateMode at line 818. 2 of those changes were fix/bug commits, and the other 4 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-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 23:16:47 \u002B08:00\u0027 --until=\u00272026-10-23 23:16:47 \u002B08:00\u0027 --full-history --no-merges -- packages/easy_refresh/lib/src/notifier/indicator_notifier.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":"packages/easy_refresh/lib/src/notifier/indicator_notifier.dart"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"401d480f22f2328b3ae4574011fad2713d7390dc98ace38ec4eecc15565e29e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: example/lib/page/sample/secondary_page.dart: example/lib/page/sample/secondary_page.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in _SecondaryPageState.build at line 56. 1 of those changes was a fix/bug commit, and the other 1 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-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 23:16:47 \u002B08:00\u0027 --until=\u00272026-10-23 23:16:47 \u002B08:00\u0027 --full-history --no-merges -- example/lib/page/sample/secondary_page.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":"example/lib/page/sample/secondary_page.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d014cede632820f7b1c672bfae51ddb6f444f2cf1a17471b11969edaf98e2e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: example/lib/page/sample/test_page.dart: example/lib/page/sample/test_page.dart changed 4 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 10 (its worst body is _TestPageState.build at line 191), 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(example): preserve tall nested header status across resets\u201D; \u201Cfix: recover beyond max overscroll boundary\u201D; \u201Cfix: stop stale footer rebound after content growth\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 23:16:47 \u002B08:00\u0027 --until=\u00272026-10-23 23:16:47 \u002B08:00\u0027 --full-history --no-merges -- example/lib/page/sample/test_page.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":"example/lib/page/sample/test_page.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"30834a0bf1ab2eb1a73f7faa0bc42033f99764538e5a728c101f33ccd1633502"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 9 project(s) overshoot their size bounds, lowering Project Cohesion to 7.8/10. The most over is \u0060packages/easy_refresh\u0060 (9662 LoC, 48 module-visible types across 23 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"51deb5f11d29da72484d112de68af7e38e0a51818f441a6e0dd487a6031a58d2"},"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":"52e46bc3a0efaa45c79faaf0acd1a4f695c8f1b145fad70c76d8f33fa1ee0894"},"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":"ee86c82485bb739cc3624328c46172d9340ef6311943b5aa1c2026b8da786983"},"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":"048871090f1c175eb1d34116b2147bf3a72741b37c29c7ced0c6e574455cbfe1"},"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":"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":"bee16a916192bc47803c755fa5c777c01a15fb56e69ce46b43bdf718adcb77fa"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"P1","level":"note","message":{"text":"CI build step not evidenced: A CI pipeline exists but no build step was matched \u2014 changes may merge without the build ever running. A build step may be invoked directly as a command, or declared as a task that a runner named in the pipeline resolves."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"251015acef1a259fcc13b7c60660cc8917ccb3ae8056cb5165ae03312dd586e8"}},{"ruleId":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"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 1 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/test.yml"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_mode == IndicatorMode.drag || _mode == IndicatorMode.armed\u0060 appears character-identically in 2 files \u2014 packages/easy_refresh/lib/src/styles/material/material_indicator.dart, packages/easy_refresh_halloween/lib/src/halloween_indicator.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":"packages/easy_refresh/lib/src/styles/material/material_indicator.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03e461d2b6a408100484146e2000c89272c4ca348534704afbfcd567b83b447"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_mode == IndicatorMode.drag || _mode == IndicatorMode.armed || _mode == IndicatorMode.ready || _mode == IndicatorMode.done\u0060 appears character-identically in 2 files \u2014 packages/easy_refresh_bow/lib/src/bow_indicator.dart, packages/easy_refresh_space/lib/src/space_indicator.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":"packages/easy_refresh_bow/lib/src/bow_indicator.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7741e67e6a2ebc1f9b69f2011a92f97d735dc198f63081b956cad31359aa81"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_mode == IndicatorMode.processed || _mode == IndicatorMode.done\u0060 appears character-identically in 3 files \u2014 packages/easy_refresh/lib/src/styles/classic/classic_indicator.dart, packages/easy_refresh/lib/src/styles/delivery/delivery_indicator.dart, packages/easy_refresh/lib/src/styles/material/material_indicator.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":"packages/easy_refresh/lib/src/styles/classic/classic_indicator.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"a627dea160f5de2e70bf9cd15ff6e1c86302f258cecbb9b820f2c1bf1379d15c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_mode == IndicatorMode.ready || _mode == IndicatorMode.processing || _mode == IndicatorMode.processed || _mode == IndicatorMode.done\u0060 appears character-identically in 2 files \u2014 packages/easy_refresh/lib/src/styles/cupertino/cupertino_indicator.dart, packages/easy_refresh/lib/src/styles/delivery/delivery_indicator.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":"packages/easy_refresh/lib/src/styles/cupertino/cupertino_indicator.dart"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef18c5917e523702eb7e918d41d261e5155f55c5e42568841bbfd0f77089682d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060childExtent \u003E constraints.remainingPaintExtent || constraints.scrollOffset \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart, packages/easy_refresh/lib/src/indicator/header/header_locator.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":"packages/easy_refresh/lib/src/indicator/footer/footer_locator.dart"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e01b3923dc07349933f77c70ebfc7eabc849ed4c5f11a56068353ac54b9f79"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mode == IndicatorMode.drag || mode == IndicatorMode.armed\u0060 appears character-identically in 3 files \u2014 packages/easy_refresh_bow/lib/src/bow_indicator.dart, packages/easy_refresh_halloween/lib/src/halloween_indicator.dart, packages/easy_refresh_space/lib/src/space_indicator.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":"packages/easy_refresh_bow/lib/src/bow_indicator.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db4ef1dc07c8fab84061dd6c6462f887c8c447a58617aa474ce4069ced48c29"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mode == IndicatorMode.ready || mode == IndicatorMode.processing\u0060 appears character-identically in 2 files \u2014 packages/easy_refresh/lib/src/styles/bezier/bezier_indicator.dart, packages/easy_refresh_skating/lib/src/skating_indicator.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":"packages/easy_refresh/lib/src/styles/bezier/bezier_indicator.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"83503d6e7d2e9eed7aacd4a70e6526a62c4dfc761bf26b0b04762998db9f9c28"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060widget.state.indicator.infiniteOffset != null \u0026\u0026 widget.state.indicator.position == IndicatorPosition.locator \u0026\u0026 (_mode != IndicatorMode.ina\u2026\u0060 appears character-identically in 2 files \u2014 packages/easy_refresh/lib/src/styles/classic/classic_indicator.dart, packages/easy_refresh/lib/src/styles/material/material_indicator.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":"packages/easy_refresh/lib/src/styles/classic/classic_indicator.dart"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae423ef5ccea679fde711bf6bf454e42e1a08aa97944ebbaa090889774a93ba6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/easy_refresh.dart"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30650982b10a660e6210f610f460795aa853a18b505d7c14721feaa635ee0b6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/easy_refresh.dart"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe380d4061cf2f5b2a49a91a3ea50d7f66c6347843892b92b7018685108f004"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/easy_refresh.dart"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"20681836f6fd90d5f3159e39a5a6a20ece012895bc5960b25b68130bc67257a3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/easy_refresh.dart"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3db587ee57aed51652757b2f57cd0e73bde2da5735fd473c702dc74f3781e8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/easy_refresh.dart"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca6be1bdde75db588bc5a6dd2a08058db992defa940a8855dc159c9df01485a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/easy_refresh/lib/src/easy_refresh.dart"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e923a3ac14cc4885d3e10853104390716c16578eccc0ffbd5694ae8084cd73"}}],"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-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"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"}]}],"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":6,"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."]}]}