{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"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":"TiffImage._decodeTile (cyclomatic 106): TiffImage._decodeTile has cyclomatic complexity 106 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b3347d50abe3d7870ed846251d65bdc9c7fd70db6aca7e42e69f03c1d75531"}},{"ruleId":"D1","level":"warning","message":{"text":"BmpEncoder.encode (cyclomatic 94): BmpEncoder.encode has cyclomatic complexity 94 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/bmp_encoder.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d940e09c7bef76ead7774d2dad9f078eb1f9c4ead5c2b089a47f1506fb9618f"}},{"ruleId":"D1","level":"warning","message":{"text":"TiffImage.TiffImage (cyclomatic 63): TiffImage.TiffImage has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21a569f61a214cca84e398321f1e39301290e487d60055012d1336cc410cf08"}},{"ruleId":"D1","level":"warning","message":{"text":"PngDecoder._startDecode (cyclomatic 50): PngDecoder._startDecode has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_decoder.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"36747622d0a3ee18205026de3be12b90043c434d5a923ae5668b1803f38376e4"}},{"ruleId":"D1","level":"warning","message":{"text":"IfdDirectory.[]= (cyclomatic 49): IfdDirectory.[]= has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/exif/ifd_directory.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ea893be8c42d7c590e3e9778616abf03603c363b610beb264e0792c0785efa"}},{"ruleId":"D1","level":"warning","message":{"text":"JpegData._read (cyclomatic 49): JpegData._read has cyclomatic complexity 49 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/jpeg_data.dart"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3518b355825eac90841f3dd2fbe8ac7a10e29ca7f933ea9d593ce7477e257df"}},{"ruleId":"D1","level":"warning","message":{"text":"PngDecoder._decodeFrame (cyclomatic 46): PngDecoder._decodeFrame has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_decoder.dart"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"4313d1bc15d9edf5a87e3b82ed665f872460f6953dfd75dab2b8d197fa99660b"}},{"ruleId":"D1","level":"warning","message":{"text":"Image.getPixelCubic (cyclomatic 46): Image.getPixelCubic has cyclomatic complexity 46 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image.dart"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"e238e32ae077b86fcbb80d07b47d928ea6f2a0bc024e1f7d6b8e289ee1f9ac90"}},{"ruleId":"D1","level":"warning","message":{"text":"VP8L._decodeImageData (cyclomatic 45): VP8L._decodeImageData has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l.dart"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e73c1be1d7fb794fb77aac915737ea44af11c4daab9771bd33679be0b22c29a"}},{"ruleId":"D1","level":"warning","message":{"text":"BitmapFont._parseFnt (cyclomatic 44): BitmapFont._parseFnt has cyclomatic complexity 44 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/font/bitmap_font.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8898b0ce560f6a029117effd7de150747a0a84725cd31b611df2af9d3bcb7064"}},{"ruleId":"D1","level":"warning","message":{"text":"ExrPart.ExrPart (cyclomatic 41): ExrPart.ExrPart has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_part.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"17558e4c3bda283478b9e0d00ebecc6bc99fa21018d090bb6585029c45cd86c4"}},{"ruleId":"D1","level":"warning","message":{"text":"TgaDecoder._decodeRle (cyclomatic 36): TgaDecoder._decodeRle has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tga_decoder.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff92688ce9f1a898d3bd61a9488f78cbac6adccc71fdfa2789726198e903d50"}},{"ruleId":"D1","level":"warning","message":{"text":"Image.fromBytes (cyclomatic 31): Image.fromBytes 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":"lib/src/image/image.dart"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"516181e7a1834fb4c4d31c6fcae87215ba9166f7d4fee25a105dc0005c9eb7b1"}},{"ruleId":"D1","level":"warning","message":{"text":"VP8Decimate._trellisQuantizeBlock (cyclomatic 28): VP8Decimate._trellisQuantizeBlock has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_rd.dart"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f25ce0aaefb49f44164ac094980ba67a60dff90c3c88fe68d8ecfd59ff5105"}},{"ruleId":"D1","level":"warning","message":{"text":"PvrDecoder._decodePvr2 (cyclomatic 27): PvrDecoder._decodePvr2 has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/pvr_decoder.dart"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"819e634575365c7a75c378336319e273484bd3f3445b45a9aefa5710e281e5ad"}},{"ruleId":"D1","level":"warning","message":{"text":"JpegScan.decode (cyclomatic 26): JpegScan.decode 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":"lib/src/formats/jpeg/jpeg_scan.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5c78115a4d4b6e9b79d0024aadd5d560966ed4884b9b2af7bbc9452f611442"}},{"ruleId":"D1","level":"warning","message":{"text":"VP8L._readHuffmanCodesHelper (cyclomatic 26): VP8L._readHuffmanCodesHelper 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":"lib/src/formats/webp/vp8l.dart"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71a5ac47d7e9f0dacf215893531490ef4549e79e94c00d6fe6484bc2d22aa9d"}},{"ruleId":"D1","level":"warning","message":{"text":"ExifData.write (cyclomatic 25): ExifData.write has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/exif/exif_data.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96cef300568ae6ffaa667191b671df20a1e8917bd5358576da477f8c8635663"}},{"ruleId":"D1","level":"warning","message":{"text":"ExifData.read (cyclomatic 25): ExifData.read has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/exif/exif_data.dart"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"438b47fb26c9e54a1003cdb75024d4c31eb876d0e8430fd2906cbc8827284c48"}},{"ruleId":"D1","level":"warning","message":{"text":"PsdLayer.PsdLayer (cyclomatic 25): PsdLayer.PsdLayer has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/psd/psd_layer.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"602bd028dcd9f3bfdd470aa4bb91f331853db71d2705d8bd4237b794328999eb"}},{"ruleId":"D1","level":"warning","message":{"text":"TiffImage.decode (cyclomatic 25): TiffImage.decode has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce908a789a7f4dd24790e0fee85e0fc063d2262c276f8312ffcf67ec9b41a388"}},{"ruleId":"D1","level":"warning","message":{"text":"PngDecoder._unfilter (cyclomatic 24): PngDecoder._unfilter 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":"lib/src/formats/png_decoder.dart"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd76abb866d34f5a0110e00de53971c845bb91896ba7091d952706ddcd0b1fd4"}},{"ruleId":"D1","level":"warning","message":{"text":"VP8L._buildHuffmanTable (cyclomatic 24): VP8L._buildHuffmanTable 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":"lib/src/formats/webp/vp8l.dart"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"08dd9fca259e81db8f01d915d3337b0cc0f9ca137b918ae26ac9926d747d30ae"}},{"ruleId":"D1","level":"warning","message":{"text":"BmpDecoder._decodeFrame (cyclomatic 23): BmpDecoder._decodeFrame has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/bmp_decoder.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afed1407313d233ce07af32c1f7d3fbf7f59c3ee6c143afbc34d0a5691da833"}},{"ruleId":"D1","level":"warning","message":{"text":"GifDecoder._decompressLine (cyclomatic 23): GifDecoder._decompressLine has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/gif_decoder.dart"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f32f3a6ec2e78539878e7351ae42d835fdd943f8a1ad3dfd2e2360d5a57448"}},{"ruleId":"D1","level":"warning","message":{"text":"TiffImage._decodeBilevelTile (cyclomatic 23): TiffImage._decodeBilevelTile has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"a361a7b479ca89deb8bcb0ac99f185a42f37ca754643ad19525f28f72fffc274"}},{"ruleId":"D1","level":"warning","message":{"text":"VP8Decimate._refineUsingDistortion (cyclomatic 23): VP8Decimate._refineUsingDistortion has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_rd.dart"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e8ca54d7d3794efd6eeaeba5430e6fe8b719e14442a542cb18b8e7b35ca153"}},{"ruleId":"D1","level":"warning","message":{"text":"JpegData._readSOS (cyclomatic 22): JpegData._readSOS has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/jpeg_data.dart"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"889574ff67967c1af585c338de50cab8497a6a8b97dc4b8815e1c326cedcc0b8"}},{"ruleId":"D1","level":"warning","message":{"text":"PngEncoder.addFrame (cyclomatic 22): PngEncoder.addFrame has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_encoder.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e831942f72f7ce3fe2f51ddec2135e572dbaf3f9271961f4a146b372f8bbd46"}},{"ruleId":"D1","level":"warning","message":{"text":"TiffFaxDecoder.decodeT6 (cyclomatic 22): TiffFaxDecoder.decodeT6 has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_fax_decoder.dart"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f868835bdbb4d3f4cc1a3a96978f7a40ba2fd7065d40a4d511569e1748484d5"}},{"ruleId":"D1","level":"warning","message":{"text":"JpegData._readAppData (cyclomatic 21): JpegData._readAppData has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/jpeg_data.dart"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8c7b160a986c5d818e31943a94b45bdb996204e5d42c8fc5b66945aae03bc6"}},{"ruleId":"D1","level":"warning","message":{"text":"Image.convert (cyclomatic 21): Image.convert has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image.dart"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1743b06c1785baf24e96ecb498732b4f884712aea5ac101c66e703e6521ca0"}},{"ruleId":"D1","level":"warning","message":{"text":"PngDecoder._writeRow (cyclomatic 20): PngDecoder._writeRow has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_decoder.dart"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d366c5322058159dbd120cb10e440a91274db2329d6b2957112d83c9782006b"}},{"ruleId":"D1","level":"warning","message":{"text":"ExrImage._readTiledPart (cyclomatic 19): ExrImage._readTiledPart has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_image.dart"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"566df5b40d604a5cd4db23c2e074c986e1efa23355075f61e67908b7fe021022"}},{"ruleId":"D1","level":"warning","message":{"text":"JpegScan._decodeACSuccessive (cyclomatic 19): JpegScan._decodeACSuccessive has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/jpeg_scan.dart"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0e5aaddb835a8d55e7594ed8f230e1bb0db041dcd4c280ee0f1d6783b9472a"}},{"ruleId":"D1","level":"warning","message":{"text":"VP8._reconstructRow (cyclomatic 19): VP8._reconstructRow has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8.dart"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"427959013f5570cb51bbf74f56f712822a2814fe82067a4b9b85223943137dca"}},{"ruleId":"D1","level":"warning","message":{"text":"VP8LEncoder._writeImageStream (cyclomatic 19): VP8LEncoder._writeImageStream has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l_encoder.dart"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2c030d1ec09c1e3424c5e6c9188beb532a9170a6be4c2ecf7ce4fcdda84193"}},{"ruleId":"D1","level":"warning","message":{"text":"Image._createImageData (cyclomatic 18): Image._createImageData has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image.dart"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8b32443c117b6e7af1498d5a1240261a724d7887a39cf4f23e15f5ed35e5e9"}},{"ruleId":"D1","level":"warning","message":{"text":"BmpInfo.decodePixel (cyclomatic 17): BmpInfo.decodePixel has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/bmp/bmp_info.dart"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad922060514ad3e07e8fdb4422120d8761842760e41803312036bdde95df849"}},{"ruleId":"D1","level":"warning","message":{"text":"IcoDecoder._decodeFrame (cyclomatic 17): IcoDecoder._decodeFrame has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/ico_decoder.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3991c8fe043097f743656fd650611b1253b17457e10c5084989282e8d573cb32"}},{"ruleId":"D1","level":"warning","message":{"text":"PngDecoder._decode (cyclomatic 17): PngDecoder._decode has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_decoder.dart"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"4114a080cd3deaea74e09ee805bfae48d3e4f7b3edbdabeca1a8c980a94a3a35"}},{"ruleId":"D1","level":"warning","message":{"text":"TgaDecoder._decodeRgb (cyclomatic 17): TgaDecoder._decodeRgb has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tga_decoder.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c3a19bdd1219e6b9d7a16d789c90ad0938dc52b9ffaf680f69177c47c53b21"}},{"ruleId":"D1","level":"warning","message":{"text":"TiffFaxDecoder._decodeNextScanline (cyclomatic 17): TiffFaxDecoder._decodeNextScanline has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_fax_decoder.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13b0cbb75d03269d6f36a5b9be7e75d8b3eace24e0822661f90fa7c67b7df7a"}},{"ruleId":"D1","level":"warning","message":{"text":"VP8._precomputeFilterStrengths (cyclomatic 17): VP8._precomputeFilterStrengths has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8.dart"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"394eeca63a06ab8915a7287f69c0e8d0c12ffdda19b04181d7dcdbf0ed4d7a16"}},{"ruleId":"D1","level":"warning","message":{"text":"VP8Encoder._putI4Mode (cyclomatic 17): VP8Encoder._putI4Mode has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_encoder.dart"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a00e12197e2161641e4555c5be6631276a91180998c0006ed6d4294f3e59aaa"}},{"ruleId":"D1","level":"warning","message":{"text":"VP8Decimate._pickBestIntra4 (cyclomatic 17): VP8Decimate._pickBestIntra4 has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_rd.dart"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa396ecd96d8ecf911f97d446684a501240ba807893455fba14dc4f962c930e"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageData.getBytes (cyclomatic 17): ImageData.getBytes has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee54f6a075be2131d6474667d9ae9a2ecb19e54dd760da1fe1a2033b1515ac1"}},{"ruleId":"D1","level":"warning","message":{"text":"NeuralQuantizer._inxSearch (cyclomatic 17): NeuralQuantizer._inxSearch has cyclomatic complexity 17 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/util/neural_quantizer.dart"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aef1412cc403861c4e13ce743320630cc98c481bf7ed1e72b9fbb7610932c73"}},{"ruleId":"D1","level":"warning","message":{"text":"BitmapFont._parseTextFnt (cyclomatic 16): BitmapFont._parseTextFnt has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/font/bitmap_font.dart"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e55207135c164c63eec06a246d4acffe0ef00ebd23d7a52cc88a55d27ee5a5"}},{"ruleId":"D1","level":"warning","message":{"text":"_XmlFntParser._decodeEntities (cyclomatic 16): _XmlFntParser._decodeEntities 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":"lib/src/font/bitmap_font.dart"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"8469750904f699a7d8e5aa60beaa76c5ee7940709ed7b300dfd2df984a749899"}},{"ruleId":"D1","level":"warning","message":{"text":"BmpInfo.BmpInfo (cyclomatic 16): BmpInfo.BmpInfo 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":"lib/src/formats/bmp/bmp_info.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5707c4c1aed5d413a27f5e33310d9ccc0f2ca46edd1212566fe1be53db9241e6"}},{"ruleId":"D1","level":"warning","message":{"text":"GifEncoder._encodeLZW (cyclomatic 16): GifEncoder._encodeLZW 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":"lib/src/formats/gif_encoder.dart"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9215b1fa1854ae656434d57b3fbba59f3da8f17be4e141fe1e4d882dfb0b108"}},{"ruleId":"D1","level":"warning","message":{"text":"PsdImage.createImageFromChannels (cyclomatic 16): PsdImage.createImageFromChannels 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. This is NOT this file\u0027s highest cyclomatic complexity: PsdImage._blend (cyclomatic 29) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/psd/psd_image.dart"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacfb61368835172e8c08bb2ad198e3f4d6be24ddd2804140fcb9103a50ede8f"}},{"ruleId":"D1","level":"warning","message":{"text":"TiffDecoder._readHeader (cyclomatic 16): TiffDecoder._readHeader 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":"lib/src/formats/tiff_decoder.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b77d077c45b61b7b3ed7b441996d086b656d0a190994df084fa1d3d35d3259e"}},{"ruleId":"D1","level":"warning","message":{"text":"VP8L._decodeAlphaData (cyclomatic 16): VP8L._decodeAlphaData 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":"lib/src/formats/webp/vp8l.dart"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03a242e61b4864fa4abbc5cfcb180758209d67212d9792e8f82ddea5e26e975"}},{"ruleId":"D1","level":"warning","message":{"text":"WebPDecoder._getInfo (cyclomatic 16): WebPDecoder._getInfo 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":"lib/src/formats/webp_decoder.dart"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9805b3580681b0492c0fc3418a2564438ce543c8b330b8be2f323f5e56aeb3"}},{"ruleId":"D1","level":"warning","message":{"text":"NeuralQuantizer._learn (cyclomatic 16): NeuralQuantizer._learn has cyclomatic complexity 16 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/util/neural_quantizer.dart"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f58121d729d251a46b905d0e7807bb461fc4a6debc0e5df8994d5008119b305"}},{"ruleId":"D2","level":"warning","message":{"text":"TiffImage._decodeTile (cognitive 438): TiffImage._decodeTile has cognitive complexity 438 (threshold 15). Drivers by points: ternaries 34 (231 pts), if/else 57 (176 pts), boolean chains 14, loops 4 (14 pts), error handling 1 (3 pts) (nesting depth added 328). 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":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcf86d6f274dae7b39dfa7c4d7aa4852d268a0a5310b7c506b633ee97daa0ea"}},{"ruleId":"D2","level":"warning","message":{"text":"BmpEncoder.encode (cognitive 161): BmpEncoder.encode has cognitive complexity 161 (threshold 15). Drivers by points: if/else 40 (64 pts), loops 15 (48 pts), boolean chains 30, ternaries 12 (19 pts) (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/bmp_encoder.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3017a7d86c4d2ca8e93941c7cddc9d3add2d6b7408546df30a42cbb867633a"}},{"ruleId":"D2","level":"warning","message":{"text":"TgaDecoder._decodeRle (cognitive 136): TgaDecoder._decodeRle has cognitive complexity 136 (threshold 15). Drivers by points: if/else 24 (90 pts), loops 7 (25 pts), ternaries 5 (19 pts), boolean chains 2 (nesting depth added 98). 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":"lib/src/formats/tga_decoder.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81c8b2bec5d1e8417456fd05f0c9fe52a1936e837831e0d83497161090fb583"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8L._decodeImageData (cognitive 129): VP8L._decodeImageData has cognitive complexity 129 (threshold 15). Drivers by points: if/else 32 (85 pts), loops 9 (35 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 80). 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":"lib/src/formats/webp/vp8l.dart"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe39cb82baed382db85db73bfdf4291b777827604885f3bb70739cdda8287421"}},{"ruleId":"D2","level":"warning","message":{"text":"IfdDirectory.[]= (cognitive 95): IfdDirectory.[]= has cognitive complexity 95 (threshold 15). Drivers by points: if/else 34 (89 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 58). 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":"lib/src/exif/ifd_directory.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"44377c63a14bec95b8135f0dfe8fe275f8e4439fd4ce0540bb1f48a04351bf04"}},{"ruleId":"D2","level":"warning","message":{"text":"TiffImage.TiffImage (cognitive 94): TiffImage.TiffImage has cognitive complexity 94 (threshold 15). Drivers by points: if/else 49 (76 pts), boolean chains 14, loops 2 (3 pts), match/switch 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76443d0d6d537bca82225cacf85c8099a941be22f8e78d0c4e08d11d4da8c6c"}},{"ruleId":"D2","level":"warning","message":{"text":"PngDecoder._startDecode (cognitive 90): PngDecoder._startDecode has cognitive complexity 90 (threshold 15). Drivers by points: if/else 26 (72 pts), loops 3 (5 pts), match/switch 2 (5 pts), ternaries 1 (5 pts), boolean chains 3 (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_decoder.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda64e4fcc9364834992a79c7b03ffebdb6b35fbe38ff5de8654b8f4a14142fb"}},{"ruleId":"D2","level":"warning","message":{"text":"TiffFaxDecoder.decodeT6 (cognitive 87): TiffFaxDecoder.decodeT6 has cognitive complexity 87 (threshold 15). Drivers by points: if/else 20 (74 pts), loops 4 (12 pts), boolean chains 1 (nesting depth added 62). 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":"lib/src/formats/tiff/tiff_fax_decoder.dart"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d83b84b7cef7e4af93f30d50cf5b035d828681e52a920c539740089639e67b"}},{"ruleId":"D2","level":"warning","message":{"text":"BitmapFont._parseFnt (cognitive 80): BitmapFont._parseFnt has cognitive complexity 80 (threshold 15). Drivers by points: loops 12 (37 pts), if/else 12 (33 pts), match/switch 2 (8 pts), ternaries 1 (2 pts) (nesting depth added 53). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/font/bitmap_font.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"717833c07fe6ac06c06e1494a3b35c6f68117458e2c8977beaed1f1c677aa73e"}},{"ruleId":"D2","level":"warning","message":{"text":"ExrImage._readTiledPart (cognitive 79): ExrImage._readTiledPart has cognitive complexity 79 (threshold 15). Drivers by points: if/else 8 (42 pts), loops 7 (28 pts), match/switch 1 (8 pts), boolean chains 1 (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_image.dart"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eeaf4fee86108cfcbf62cc60ca9a2ecabf986ca7357ebe7211c88e1cdd676bb"}},{"ruleId":"D2","level":"warning","message":{"text":"PngDecoder._decodeFrame (cognitive 72): PngDecoder._decodeFrame has cognitive complexity 72 (threshold 15). Drivers by points: if/else 15 (25 pts), ternaries 13 (20 pts), loops 7 (15 pts), boolean chains 9, error handling 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_decoder.dart"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"53087f3ab52967b114602e53b5a80a49162cbe4ef3c6ac494b51734a51f9007e"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8._precomputeFilterStrengths (cognitive 69): VP8._precomputeFilterStrengths has cognitive complexity 69 (threshold 15). Drivers by points: if/else 13 (46 pts), ternaries 4 (18 pts), loops 2 (5 pts) (nesting depth added 50). 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":"lib/src/formats/webp/vp8.dart"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec8b1fb28668aefc865013f8993bba9c41b68e834a0ded00241b04bab0cf642"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8L._readHuffmanCodesHelper (cognitive 67): VP8L._readHuffmanCodesHelper has cognitive complexity 67 (threshold 15). Drivers by points: if/else 13 (44 pts), loops 4 (12 pts), boolean chains 7, ternaries 2 (4 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l.dart"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fbd51a61e6406f8fbd4df418573d23840710e4c392767dcc102af8a42e095a"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8Encoder._putI4Mode (cognitive 66): VP8Encoder._putI4Mode has cognitive complexity 66 (threshold 15). Drivers by points: ternaries 9 (39 pts), if/else 8 (27 pts) (nesting depth added 49). 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":"lib/src/formats/webp/vp8_encoder.dart"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0acac9908074e7298bcd03d332f11b0eb3113aec3ec58ac43cc120b56b9da61"}},{"ruleId":"D2","level":"warning","message":{"text":"ExrPart.ExrPart (cognitive 65): ExrPart.ExrPart has cognitive complexity 65 (threshold 15). Drivers by points: if/else 19 (38 pts), loops 10 (21 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_part.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f43d51a7a41eec5f997171bdc1f268ade0b4da26b32277654d68e15a1d28bb"}},{"ruleId":"D2","level":"warning","message":{"text":"JpegScan.decode (cognitive 64): JpegScan.decode has cognitive complexity 64 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 7 (24 pts), ternaries 3 (8 pts), boolean chains 4 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/jpeg_scan.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57e8234b6bcc688043ffcc3e6b32b12456616ac54988196f0e5c4ed06eac1ff"}},{"ruleId":"D2","level":"warning","message":{"text":"NeuralQuantizer._inxSearch (cognitive 58): NeuralQuantizer._inxSearch has cognitive complexity 58 (threshold 15). Drivers by points: if/else 16 (56 pts), boolean chains 1, loops 1 (nesting depth added 40). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/util/neural_quantizer.dart"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac43417a0b8f2d7829ef5d5d7dc0d12545f88dc606d02f2d0cdf8c5f3f6cc00"}},{"ruleId":"D2","level":"warning","message":{"text":"PsdLayer.PsdLayer (cognitive 57): PsdLayer.PsdLayer has cognitive complexity 57 (threshold 15). Drivers by points: if/else 20 (48 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 32). 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":"lib/src/formats/psd/psd_layer.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c3cdbd72b195395d314f26d31688d62835a93616b34c9a58ae3deb8b3d1123"}},{"ruleId":"D2","level":"warning","message":{"text":"GifDecoder._decompressLine (cognitive 56): GifDecoder._decompressLine has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (36 pts), loops 5 (14 pts), boolean chains 6 (nesting depth added 29). 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":"lib/src/formats/gif_decoder.dart"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"44989f6591caf986ed337b9bcce68882737335dbcc11583aad52185f1a82bd57"}},{"ruleId":"D2","level":"warning","message":{"text":"PngDecoder._unfilter (cognitive 54): PngDecoder._unfilter has cognitive complexity 54 (threshold 15). Drivers by points: loops 8 (23 pts), if/else 8 (20 pts), ternaries 3 (9 pts), boolean chains 1, match/switch 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_decoder.dart"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e022751406fb27ae9b607679468b9893772858d84259676c9e140869cb836a1"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8Decimate._trellisQuantizeBlock (cognitive 54): VP8Decimate._trellisQuantizeBlock has cognitive complexity 54 (threshold 15). Drivers by points: if/else 11 (24 pts), ternaries 9 (19 pts), loops 6 (9 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_rd.dart"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81353ee379502109c3e55b2dabc257d788b2fb80d98a76e90745a4f50b16543"}},{"ruleId":"D2","level":"warning","message":{"text":"ExifData.read (cognitive 53): ExifData.read has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 5 (12 pts), boolean chains 6, error handling 2 (6 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/exif/exif_data.dart"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"209be8f7e9a1411c8552ae958aa2f4bb8911ec009326e2c6a3352255ccf3f136"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8._reconstructRow (cognitive 49): VP8._reconstructRow has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 9 (24 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8.dart"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d95d407dbb06d301f1ce74e5e35b14844c3776d1bf2b93820a0b0f6c239dedb"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8L._buildHuffmanTable (cognitive 48): VP8L._buildHuffmanTable has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (39 pts), loops 7 (9 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l.dart"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecca1355801cedbac829dcfa5010eb04ba7f93db9449d70274e688bfc0fbdfa0"}},{"ruleId":"D2","level":"warning","message":{"text":"ExifData.write (cognitive 46): ExifData.write has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (32 pts), loops 7 (12 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/exif/exif_data.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c308f85ace66283dfe4eaf43dc2e250237a737415a4b241c00cfc1d83780ff"}},{"ruleId":"D2","level":"warning","message":{"text":"JpegScan._decodeACSuccessive (cognitive 46): JpegScan._decodeACSuccessive has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (34 pts), ternaries 2 (9 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/jpeg_scan.dart"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"c089a6c90809b526d923f57fa3b2f422f811aa82b8b85265bb898f4211bc58cd"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8Decimate._refineUsingDistortion (cognitive 45): VP8Decimate._refineUsingDistortion has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 4 (9 pts), boolean chains 5, ternaries 2 (5 pts) (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_rd.dart"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"97631022026c6ad27d4b74675bb1306377acaef2a2f468dca4349b2059f8d99b"}},{"ruleId":"D2","level":"warning","message":{"text":"Image.getPixelCubic (cognitive 45): Image.getPixelCubic has cognitive complexity 45 (threshold 15). Drivers by points: boolean chains 25, ternaries 18, if/else 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image.dart"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86131e3577db961d95d5ad39660622fa4367c47cbe36f9c7e102f8a9d3f5e88"}},{"ruleId":"D2","level":"warning","message":{"text":"Image.convert (cognitive 45): Image.convert has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 4 (11 pts), boolean chains 6, ternaries 2 (6 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image.dart"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"748df46eb1c1f609a2b73ab23c4c52dc0e1f34bdf063b928a37b744cd3c53523"}},{"ruleId":"D2","level":"warning","message":{"text":"ExrHuffman.decode (cognitive 41): ExrHuffman.decode has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 5 (13 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_huffman.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"017c47cb070aeeea6ff2e1f347ceb28f639cc5fc44a1c4f6bae91d221a814983"}},{"ruleId":"D2","level":"warning","message":{"text":"GifEncoder._encodeLZW (cognitive 41): GifEncoder._encodeLZW has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 6 (13 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/gif_encoder.dart"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4515a5eeaab9ca5460d21d1bb13392ca1b5c188af2423e844eb48118858e928"}},{"ruleId":"D2","level":"warning","message":{"text":"TiffFaxDecoder._decodeNextScanline (cognitive 41): TiffFaxDecoder._decodeNextScanline has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (36 pts), loops 3 (5 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_fax_decoder.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f21242f38b4c75ecaa80c8d5f9698253b076c004b927ed283bf27f3cdba31f"}},{"ruleId":"D2","level":"warning","message":{"text":"PngDecoder._writeRow (cognitive 40): PngDecoder._writeRow has cognitive complexity 40 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 6 (9 pts), ternaries 3 (9 pts), boolean chains 4 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_decoder.dart"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"446c8e42b01438ecbe158747068412ff877a3def717e0ae5c1c8b3700d908b07"}},{"ruleId":"D2","level":"warning","message":{"text":"TiffImage._decodeBilevelTile (cognitive 40): TiffImage._decodeBilevelTile has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 4 (10 pts), error handling 3 (6 pts), boolean chains 2, ternaries 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acb87b89b9240156ce391e613dadc81052d4415838e657550d41e5e2e495313"}},{"ruleId":"D2","level":"warning","message":{"text":"PvrEncoder.encodeRgb4bpp (cognitive 39): PvrEncoder.encodeRgb4bpp has cognitive complexity 39 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 6 (13 pts), ternaries 2 (9 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (PvrEncoder.encodeRgba4bpp) 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":"lib/src/formats/pvr_encoder.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"634c6c3ad9a9bbaaba821cbe5bc1471c130cd0777ba7433e08bef7f7bbed8027"}},{"ruleId":"D2","level":"warning","message":{"text":"PvrEncoder.encodeRgba4bpp (cognitive 39): PvrEncoder.encodeRgba4bpp has cognitive complexity 39 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 6 (13 pts), ternaries 2 (9 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (PvrEncoder.encodeRgb4bpp) 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":"lib/src/formats/pvr_encoder.dart"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"97629752c1fb279bb96e879c9abe054a1e11285cdb2398e2d6af24ecf4c65f34"}},{"ruleId":"D2","level":"warning","message":{"text":"InternalExrPxr24Compressor.uncompress (cognitive 38): InternalExrPxr24Compressor.uncompress has cognitive complexity 38 (threshold 15). Drivers by points: loops 8 (30 pts), if/else 3 (5 pts), match/switch 1 (3 pts) (nesting depth added 26). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_pxr24_compressor.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df22dfad668aff21011b709e733177ea49c337bc366619d96ae81a53dff214b"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8LEncoder._writeImageStream (cognitive 38): VP8LEncoder._writeImageStream has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (27 pts), loops 6 (9 pts), ternaries 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l_encoder.dart"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"e642f81d43cc65abb5d5188caa2f115b9a483893119cdfea7f1afa6f43089822"}},{"ruleId":"D2","level":"warning","message":{"text":"ExrImage._readScanlinePart (cognitive 37): ExrImage._readScanlinePart has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 4 (10 pts), match/switch 1 (5 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_image.dart"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"80657b7e99c946892c8e3da64d1ea1fd2e13952f9c3ab87a49deea4b04a9eb6c"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8L._decodeAlphaData (cognitive 36): VP8L._decodeAlphaData has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 3 (8 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l.dart"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef3b88a5bb8d0273b395d6625b904a8f2debb0afd87fa3ae754bb5c75b93482"}},{"ruleId":"D2","level":"warning","message":{"text":"Image.fromBytes (cognitive 36): Image.fromBytes has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 9, loops 5 (9 pts), ternaries 4 (nesting depth added 6). 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":"lib/src/image/image.dart"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c211c43db9b7bbb2623435be84be66f3a67e7ed73d10f4d3285582dec38586"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageData.getBytes (cognitive 35): ImageData.getBytes has cognitive complexity 35 (threshold 15). Drivers by points: loops 4 (15 pts), if/else 8 (12 pts), ternaries 2 (6 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab53998ee7e44ef641ce3eee2a97eccd7224a843a65d5cfec086eb150e3782c1"}},{"ruleId":"D2","level":"warning","message":{"text":"BmpInfo.BmpInfo (cognitive 34): BmpInfo.BmpInfo has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 7 (18 pts), if/else 9 (13 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/bmp/bmp_info.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ee8cf94226a41656d6ffbf68a89e20155724c7be6d86f4fda16fe1dbd5f4ca"}},{"ruleId":"D2","level":"warning","message":{"text":"JpegImageWriter.writeRows (cognitive 34): JpegImageWriter.writeRows has cognitive complexity 34 (threshold 15). Drivers by points: loops 7 (20 pts), if/else 6 (12 pts), boolean chains 1, match/switch 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/_jpeg_image.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f182567319f101ecac5b85609691915a6e13249df245c4ec236b49e439fab2a"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8._parseResiduals (cognitive 34): VP8._parseResiduals has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 6 (17 pts), loops 6 (12 pts), if/else 4 (5 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":"lib/src/formats/webp/vp8.dart"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"c090be5f8b7fce3e262d7f29ed9e179cf8758a669b4e1b4ffea15ff2721daad1"}},{"ruleId":"D2","level":"warning","message":{"text":"GifDecoder._startDecode (cognitive 33): GifDecoder._startDecode has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (26 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/gif_decoder.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8829e538ac8255850c2dce2cd6667d1416d414e8a36d584a2ab07573192e39a"}},{"ruleId":"D2","level":"warning","message":{"text":"TgaDecoder._decodeRgb (cognitive 32): TgaDecoder._decodeRgb has cognitive complexity 32 (threshold 15). Drivers by points: loops 6 (15 pts), ternaries 3 (9 pts), boolean chains 4, if/else 4 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tga_decoder.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee36269c8441f6337c441354329edbf5fe01e28fbf171529e3617a90c6137994"}},{"ruleId":"D2","level":"warning","message":{"text":"ExrWavelet.decode (cognitive 31): ExrWavelet.decode has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 5 (10 pts), ternaries 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_wavelet.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cf8d508cf0c42a00aa104958f43b36e1768c632c288e2b7ba6029a394113a7"}},{"ruleId":"D2","level":"warning","message":{"text":"PngEncoder.addFrame (cognitive 31): PngEncoder.addFrame has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_encoder.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7400ca675a5a073a9642afb054a391102bb76283da2957fe31c7886e535f7b81"}},{"ruleId":"D2","level":"warning","message":{"text":"TiffFaxDecoder.decode2D (cognitive 31): TiffFaxDecoder.decode2D has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_fax_decoder.dart"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f05704af0443a38d4f6c2a240a54e807fe28e3e07c888f61c5bc57663b5965c"}},{"ruleId":"D2","level":"warning","message":{"text":"NeuralQuantizer._learn (cognitive 31): NeuralQuantizer._learn has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 3 (5 pts), ternaries 1 (2 pts) (nesting depth added 13). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/util/neural_quantizer.dart"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e82e7148d19dd4bbf13a842ebfadf8289300b2688b9dfbdc088337c9472166"}},{"ruleId":"D2","level":"warning","message":{"text":"BmpDecoder._decodeFrame (cognitive 30): BmpDecoder._decodeFrame has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 13 (14 pts), if/else 5 (10 pts), boolean chains 3, loops 2 (3 pts) (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":"lib/src/formats/bmp_decoder.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93b84ebbc9666053f1b48d4a11522332be3968fd070130a951fa0064bf34981"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8Filter._initTables (cognitive 30): VP8Filter._initTables has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 7 (21 pts), loops 4 (8 pts), if/else 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_filter.dart"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba2047ff55f59a500bc04dcc401335149cd33e03834958ab857ffa055c08824"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8Decimate._pickBestIntra4 (cognitive 30): VP8Decimate._pickBestIntra4 has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 4 (10 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_rd.dart"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4517dd2896952d70c234e3a9a1d37be539b48a679a58ead6cc96cbd587f876c"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8LEncoder.encodeVP8L (cognitive 30): VP8LEncoder.encodeVP8L has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 6 (16 pts), if/else 4 (8 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l_encoder.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab96ce88f6a289254b3fbca4445bd5e2b44329a0e8a9e35b0cceb69a061f8ab"}},{"ruleId":"D2","level":"warning","message":{"text":"PvrDecoder._decodePvr2 (cognitive 29): PvrDecoder._decodePvr2 has cognitive complexity 29 (threshold 15). Drivers by points: loops 8 (16 pts), ternaries 3 (7 pts), if/else 4, boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/pvr_decoder.dart"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"87968a3885deada2f3ba14ae4cddd32f4d448d3f6aedc6299a035f9e3fd8a3f4"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelUint1.== (cognitive 29): PixelUint1.== has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (27 pts), ternaries 1 (2 pts) (nesting depth added 18). 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":"lib/src/image/pixel_uint1.dart"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cec6896fb28fac095dd0ed06beb8c6295c8d20e2c413714996fd75cffd7981"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelUint16.== (cognitive 29): PixelUint16.== has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (27 pts), ternaries 1 (2 pts) (nesting depth added 18). 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":"lib/src/image/pixel_uint16.dart"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56eab3002c12acda5b1e69e4a217d98234018d9ebe4593a971f241b8cc87997"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelUint2.== (cognitive 29): PixelUint2.== has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (27 pts), ternaries 1 (2 pts) (nesting depth added 18). 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":"lib/src/image/pixel_uint2.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a59319f9ac1ad45b0d62c971cc99a5b7f48f46a9422853b0e8d2f898b0584b"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelUint8.== (cognitive 29): PixelUint8.== has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (27 pts), ternaries 1 (2 pts) (nesting depth added 18). 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":"lib/src/image/pixel_uint8.dart"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"01993f57331fa040925b678888692cc531c07790db55fc564764c714791a6965"}},{"ruleId":"D2","level":"warning","message":{"text":"TiffImage.decode (cognitive 28): TiffImage.decode has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 12, boolean chains 7, loops 3 (5 pts), if/else 2 (4 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae3482e9cf880cc8439f118c448e3260882ec82bbb8a53edb60d9eef200d311"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8LTransform.predictorInverseTransform (cognitive 28): VP8LTransform.predictorInverseTransform has cognitive complexity 28 (threshold 15). Drivers by points: loops 6 (17 pts), if/else 6 (11 pts) (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l_transform.dart"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b7913449f3cb8d504eb973e531871fc72c368c76911f96b4a67cebe2f11550"}},{"ruleId":"D2","level":"warning","message":{"text":"Image.remapChannels (cognitive 28): Image.remapChannels has cognitive complexity 28 (threshold 15). Drivers by points: loops 4 (15 pts), if/else 7 (11 pts), boolean chains 2 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image.dart"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b7c19c7abf2ea8bf9ff5067233edca7e906f59e4722a475b63cce4aaee94b4"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8._parseSegmentHeader (cognitive 27): VP8._parseSegmentHeader has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 3 (12 pts), loops 3 (9 pts), if/else 4 (6 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8.dart"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed619a82aa1019c41fe48f4b463d8e26dbb233370ab0b3bfd0b7f1e3c808b4d"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelFloat16.== (cognitive 27): PixelFloat16.== has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (27 pts) (nesting depth added 17). 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":"lib/src/image/pixel_float16.dart"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d816c547b88d1829e8002d2786a583f715a3fc875bec35bd1a74fd1546a7c9e"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelFloat32.== (cognitive 27): PixelFloat32.== has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (27 pts) (nesting depth added 17). 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":"lib/src/image/pixel_float32.dart"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"798e9adabf0f52d6c6bb23e340152f0e437f4ea96309a22a4482762d1fdcd5e2"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelFloat64.== (cognitive 27): PixelFloat64.== has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (27 pts) (nesting depth added 17). 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":"lib/src/image/pixel_float64.dart"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"7295de6c0c37fbd587e4a0bb8062fbd645d148b57ed7624cc4cb28ee0635fbf5"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelInt16.== (cognitive 27): PixelInt16.== has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (27 pts) (nesting depth added 17). 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":"lib/src/image/pixel_int16.dart"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a9aa19bf3eabf0f0cd34dbd4e5bb73fa0d1cfece5f1865fb51810acb89496a"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelInt32.== (cognitive 27): PixelInt32.== has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (27 pts) (nesting depth added 17). 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":"lib/src/image/pixel_int32.dart"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c7ba8565331b904dc5768a08c1084dc963e9986b370c1883cc43af236827c4"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelInt8.== (cognitive 27): PixelInt8.== has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (27 pts) (nesting depth added 17). 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":"lib/src/image/pixel_int8.dart"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ee98600ba1e4be06b0efc1ff3392e026e086ba251e503d9f1097423fae3897"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelUint32.== (cognitive 27): PixelUint32.== has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (27 pts) (nesting depth added 17). 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":"lib/src/image/pixel_uint32.dart"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b8e39a96385599ba297c99107641ec85e63085dc48ef09286e65d378dfc913"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelUint4.== (cognitive 27): PixelUint4.== has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (27 pts) (nesting depth added 17). 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":"lib/src/image/pixel_uint4.dart"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"847fa444808f850a111c388c1eec5a3bb813b5fac8c07312d42c3f2a9e1f0d6c"}},{"ruleId":"D2","level":"warning","message":{"text":"PsdImage.createImageFromChannels (cognitive 26): PsdImage.createImageFromChannels has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 7 (17 pts), if/else 3 (5 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/psd/psd_image.dart"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8a7050f427c2f5067b93af8b95730f97a858683665ef668e1ca6f5ef210b90"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageDataUint8.clear (cognitive 26): ImageDataUint8.clear has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 10 (20 pts), if/else 4, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_uint8.dart"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"63925b5d2b89b8bdba64193709272355ef6ed67edb7e1dc3512c612c7a1c7a84"}},{"ruleId":"D2","level":"warning","message":{"text":"_XmlFntParser._decodeEntities (cognitive 25): _XmlFntParser._decodeEntities has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/font/bitmap_font.dart"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"2780854baba6038a4f5a4906f472012d2c7d8c7f6d0c0b21f4a9b07d13bef28a"}},{"ruleId":"D2","level":"warning","message":{"text":"BmpInfo.decodePixel (cognitive 25): BmpInfo.decodePixel has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (11 pts), loops 2 (6 pts), ternaries 3 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/bmp/bmp_info.dart"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fbb7f63c9feb59c7bfb1220c5bb6d6ebb500f32f4560775099ab024c9a30c5"}},{"ruleId":"D2","level":"warning","message":{"text":"JpegData._readSOS (cognitive 25): JpegData._readSOS has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 9, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/jpeg_data.dart"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5a36910b746f812bf36748f61528a5d80ec0a6c79ba5ccc2e3a3a083c28582"}},{"ruleId":"D2","level":"warning","message":{"text":"GifDecoder._decode (cognitive 24): GifDecoder._decode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/gif_decoder.dart"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"abeadbef646dc2720375d0feb5b5403f3a5c2523c456e3c5945eebfce536251b"}},{"ruleId":"D2","level":"warning","message":{"text":"IcoDecoder._decodeFrame (cognitive 24): IcoDecoder._decodeFrame has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (6 pts), boolean chains 5, ternaries 2 (3 pts) (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":"lib/src/formats/ico_decoder.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4c4c0b8af6bf007dc19fcad6875490cf9d785ef68048c9a2a51a877fef4901"}},{"ruleId":"D2","level":"warning","message":{"text":"JpegData._readAppData (cognitive 23): JpegData._readAppData has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 11, if/else 8 (10 pts), error handling 1 (2 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/jpeg_data.dart"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ad547f50b53a836e88bc949e3abcdb1f528f2166408c78be3eb80ce7ae7432"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8L._readHuffmanCodeLengths (cognitive 23): VP8L._readHuffmanCodeLengths has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l.dart"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ecda9d8a30ba248549b692a691e6161c68cf8d155367f38542d7a8df8a6fadb"}},{"ruleId":"D2","level":"warning","message":{"text":"InternalExrRleCompressor.uncompress (cognitive 22): InternalExrRleCompressor.uncompress has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 5 (9 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_rle_compressor.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9692c4b1b6b3968b7b35150df95ebc94636e99412caba88259725cbef11370e"}},{"ruleId":"D2","level":"warning","message":{"text":"JpegData._read (cognitive 22): JpegData._read has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/jpeg_data.dart"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c778ebdc574335ce62169eb692ffd1288df287b30db77e4c9335347e17e2f4"}},{"ruleId":"D2","level":"warning","message":{"text":"PvrDecoder._decodeRgb4bpp (cognitive 22): PvrDecoder._decodeRgb4bpp has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 3 (12 pts), loops 4 (10 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (PvrDecoder._decodeRgba4bpp) 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":"lib/src/formats/pvr_decoder.dart"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c4550725f59a8c100a4e57769f09f09964b2181b9d7e53dd1569220ff2a4ed"}},{"ruleId":"D2","level":"warning","message":{"text":"PvrDecoder._decodeRgba4bpp (cognitive 22): PvrDecoder._decodeRgba4bpp has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 3 (12 pts), loops 4 (10 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (PvrDecoder._decodeRgb4bpp) 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":"lib/src/formats/pvr_decoder.dart"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b5268dbc88c9743da06a80c7b3e7a6bee3d0a281e12c1a2e91855b4fd2b592"}},{"ruleId":"D2","level":"warning","message":{"text":"LzwDecoder.decode (cognitive 22): LzwDecoder.decode has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (9 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_lzw_decoder.dart"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ce992da0e08be80b30471d1aeb18356976eaf23b016504108d3d1cfd65f57b"}},{"ruleId":"D2","level":"warning","message":{"text":"TiffDecoder._readHeader (cognitive 22): TiffDecoder._readHeader has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, error handling 1 (2 pts), loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff_decoder.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6106e06ff9aa1371b122f4cd048ede3e91ce88308eeedeb18c83c380b94890"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8LEncoder._selectMetaHuffman (cognitive 22): VP8LEncoder._selectMetaHuffman has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l_encoder.dart"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"7827992d2533bab30475615e20be71abeb1a08bc9927c7fbf94012849cc70f5e"}},{"ruleId":"D2","level":"warning","message":{"text":"ExrHuffman.unpackEncTable (cognitive 21): ExrHuffman.unpackEncTable has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (7 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_huffman.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eef071b0f250d7161d30fc1ff026111bcd7722a68d545a708fe1ce0eecc4578"}},{"ruleId":"D2","level":"warning","message":{"text":"PngDecoder._decode (cognitive 21): PngDecoder._decode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 7, ternaries 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_decoder.dart"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd3dfe5ddf2ed2a02920df55b8a900f0fa062ba4bfa9f6535028f60e90b63d6"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8L._readHuffmanCodes (cognitive 21): VP8L._readHuffmanCodes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l.dart"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b70a6f8421952c5c5f431e31520f3745be62657680ecb976fd2436c830adce8"}},{"ruleId":"D2","level":"warning","message":{"text":"GifDecoder._decodeImage (cognitive 20): GifDecoder._decodeImage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (7 pts), boolean chains 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/gif_decoder.dart"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dfa2f62a3a957415d21854aefdf95a0e6a1ba49d0e81dbf176acee3dd7f9e0"}},{"ruleId":"D2","level":"warning","message":{"text":"PnmDecoder._decodeFrame (cognitive 20): PnmDecoder._decodeFrame has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (6 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":"lib/src/formats/pnm_decoder.dart"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c8c8d598360fd2a1dd5bf94a47aedf5d8f7c4fda70ab26c4a68eafb1782ac0"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8._parseIntraMode (cognitive 20): VP8._parseIntraMode has cognitive complexity 20 (threshold 15). Drivers by points: loops 3 (9 pts), ternaries 6 (9 pts), if/else 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8.dart"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4b82d46fede84460e9a5c35150e77d20d95ac586bf5297e18be93e55c40ce0"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8EncProba.calculateLevelCosts (cognitive 20): VP8EncProba.calculateLevelCosts has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (15 pts), ternaries 1 (4 pts), if/else 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_proba.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8837fa535bbdab3c739d7ff759f56bd5351f4f182d981205ddea5af891ea866c"}},{"ruleId":"D2","level":"warning","message":{"text":"InternalExrPizCompressor.uncompress (cognitive 19): InternalExrPizCompressor.uncompress has cognitive complexity 19 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 5 (7 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_piz_compressor.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a108e9b5ea63fb6a54d53f65afe6f7fdededd174e400ea9615322f557c1e85a"}},{"ruleId":"D2","level":"warning","message":{"text":"PsdChannel._decodeRLE (cognitive 19): PsdChannel._decodeRLE has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/psd/psd_channel.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ff9c94125ecfff96a5b7ffde767685a94524b3f173947c95740f9f24782fce"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8._parseFilterHeader (cognitive 19): VP8._parseFilterHeader has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (6 pts), ternaries 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8.dart"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb8883ae4e60fd6171d41d0f5e24aa1fcc44fd52bd648bc410f2658510f562e"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8._doFilter (cognitive 19): VP8._doFilter has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (19 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8.dart"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"033695725829abb682c3a4946dd0d600cea848a182498f754cbab1914d828b8c"}},{"ruleId":"D2","level":"warning","message":{"text":"PngEncoder.encode (cognitive 18): PngEncoder.encode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_encoder.dart"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d986fb0231e789695305df433373fd402bff698516f00a03695abf195017890f"}},{"ruleId":"D2","level":"warning","message":{"text":"TiffFaxDecoder._readEOL (cognitive 18): TiffFaxDecoder._readEOL has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_fax_decoder.dart"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a1082c2568daf942441b96b0410b67badf1ba250b2e3e73be3d79fbefbbef0"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8._parseQuant (cognitive 18): VP8._parseQuant has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8.dart"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31a41288a72417fea47603484a4037cbe99788c0f702aaba75d219a1fc3aaf1"}},{"ruleId":"D2","level":"warning","message":{"text":"WebPDecoder._decode (cognitive 18): WebPDecoder._decode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp_decoder.dart"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca08834ca6f732c74b10aaae35cafce6bf0203104562b5d05e69ad5e80813b78"}},{"ruleId":"D2","level":"warning","message":{"text":"ExifData.toString (cognitive 17): ExifData.toString has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (8 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/exif/exif_data.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f705f188e5f2cb498b5731ea8ee1564b73272ca9f5e66fe1a77b23f9995ca70d"}},{"ruleId":"D2","level":"warning","message":{"text":"ExrHuffman.buildDecTable (cognitive 17): ExrHuffman.buildDecTable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_huffman.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"de88b07c65c7f82ef5dd0a5cae369bb30911a75016c4000abf63e44e99be43c7"}},{"ruleId":"D2","level":"warning","message":{"text":"TgaEncoder.encode (cognitive 17): TgaEncoder.encode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (7 pts), ternaries 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tga_encoder.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"48733a04d8532031f5bd42812563c17f2b4b04e59e48f2fb07674cc9b7c4a213"}},{"ruleId":"D2","level":"warning","message":{"text":"TiffFaxDecoder._nextNBits (cognitive 17): TiffFaxDecoder._nextNBits has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (17 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_fax_decoder.dart"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db48b893f079b7fd367c53e2b363aa7aec884a7006024b934308f9d780db738"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8._finishRow (cognitive 17): VP8._finishRow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8.dart"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a4916cd44981bd2ea9359e6a5cc6d2996affc19d16de8d1708702239696d66"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8Encoder._codeIntraModes (cognitive 17): VP8Encoder._codeIntraModes has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 4 (7 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_encoder.dart"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed92c9ddb2c7618a749f1fb872f6295ac0191b1712de57ae5eeeecb9bae1f26"}},{"ruleId":"D2","level":"warning","message":{"text":"Image._expandPalette (cognitive 17): Image._expandPalette has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 4 (6 pts), boolean chains 3, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image.dart"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da7d56554e411e57f005c0c5a6c60b81765ab40d734a43787e0f0ca57090558"}},{"ruleId":"D2","level":"warning","message":{"text":"GifEncoder.addFrame (cognitive 16): GifEncoder.addFrame has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (16 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/gif_encoder.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3defe74ac90bb5f1ea591bf35105953d084cf8478950dbe6058f8669f891cbec"}},{"ruleId":"D2","level":"warning","message":{"text":"JpegData._decodeBand (cognitive 16): JpegData._decodeBand has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 3 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/jpeg_data.dart"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc89668ccc5fed1ca1849bcf1fd999a4ed8ec5fe08dea13845752456fb48007"}},{"ruleId":"D2","level":"warning","message":{"text":"JpegEncoder._processDU (cognitive 16): JpegEncoder._processDU has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 5 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg_encoder.dart"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"889c851544384330730c14c52c2d9f05db8bee79ad53c333b8f45f8ccab49fb3"}},{"ruleId":"D2","level":"warning","message":{"text":"PsdImage.renderImage (cognitive 16): PsdImage.renderImage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/psd/psd_image.dart"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f38179c075336468cb0234d260e235db705e6765d725b56f5ff95491d87708"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8._parseProba (cognitive 16): VP8._parseProba has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), ternaries 1 (5 pts), if/else 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8.dart"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"62962dd6454aa325b694c537bd46bd03c4f7541d0ccc7ca3970ab388915db094"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8Quantizers._simplifySegments (cognitive 16): VP8Quantizers._simplifySegments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_quant.dart"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"4faae034fb9ab5904b73ab88a7cb5b715c3d9355dd32bb11ab3e7e829e87bc32"}},{"ruleId":"D2","level":"warning","message":{"text":"_MBAnalyzer._alphaOf (cognitive 16): _MBAnalyzer._alphaOf has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), if/else 2 (5 pts), loops 4 (5 pts) (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":"lib/src/formats/webp/vp8_segments.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e0790d74de541d3fd405fa09f034108638a892e25e0947ceec9c8f239fb1c0"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8L._decodeImageStream (cognitive 16): VP8L._decodeImageStream has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 1 (2 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":"lib/src/formats/webp/vp8l.dart"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7eb61ac04afd76f77197ce6105954bd47057a3976217ea40f1c52c569056c16"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8LEncoder.encodeStream (cognitive 16): VP8LEncoder.encodeStream has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l_encoder.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a297bcc9f830ade5b1d9ff4de93d9b39aaecc7463ee7adcb9cef2d10fa448d3d"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8LTransform.colorIndexInverseTransformAlpha (cognitive 16): VP8LTransform.colorIndexInverseTransformAlpha has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (6 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (VP8LTransform.colorIndexInverseTransform) 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":"lib/src/formats/webp/vp8l_transform.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6f9b12c772e15ba3c1470d2f21f157a59394ddeb7b1e640d5160630d540c54"}},{"ruleId":"D2","level":"warning","message":{"text":"VP8LTransform.colorIndexInverseTransform (cognitive 16): VP8LTransform.colorIndexInverseTransform has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (6 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (VP8LTransform.colorIndexInverseTransformAlpha) 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":"lib/src/formats/webp/vp8l_transform.dart"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"97773c6ada75610179a69dcaaa2f06d0780de0c997859efe1dfd8285177fd13c"}},{"ruleId":"D2","level":"warning","message":{"text":"WebPDecoder._getInfo (cognitive 16): WebPDecoder._getInfo has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp_decoder.dart"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6266f3bb81a3ac59bd9413c8a26b9afeca7360dbaa48d991910520167f321d"}},{"ruleId":"D2","level":"warning","message":{"text":"WebPEncoder.encode (cognitive 16): WebPEncoder.encode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, boolean chains 5, ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp_encoder.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"219bcd569fe32ec401cbcf339c9e2bf0f7078f5caebf3aaf597f7aeab948ef9e"}},{"ruleId":"D2","level":"warning","message":{"text":"Image._createImageData (cognitive 16): Image._createImageData has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image.dart"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7954c4ab799e378ebd503979d29015f298840c8713d0aea2453958489791e7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Command: TooManyMethods \u2014 127 methods. The bar is 30 methods; this is 97 over it, 4.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/command.dart"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"16de8b839e6a706e6aa8221776fb1d44fd2335919fe321976c9bd37a06117627"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TiffImage._decodeTile: MethodTooLong \u2014 _decodeTile runs 261 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 161 over it, 2.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0d7153e67e6d8f50c1bf927a3f9f48771ac0e443a3f1b9e397577f5d1e7b61"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VP8: ClassTooLong \u2014 980 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 580 over it, 2.45\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"89302148751deac9861a137c47adc80612f429c002f26ebe160034f3516d98d4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TiffFaxDecoder: ClassTooLong \u2014 970 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 570 over it, 2.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_fax_decoder.dart"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d40fa367e34bb5f0f64007d4207e6edfef5f6ccc27697fb0ae2acc3574b38ae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BmpEncoder.encode: MethodTooLong \u2014 encode runs 240 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 140 over it, 2.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/bmp_encoder.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"561fe835e006cf42e8edf681a4b4a652a8f95246d45142f2b3b620a19ff3a7f5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Command: ClassTooLong \u2014 925 significant lines (blank, comment-only and punctuation-only lines excluded), 127 methods. The bar is 400 significant lines; this is 525 over it, 2.31\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/command.dart"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e28a5cf5e6948ad580d2c635a76282e3612da76c18a707cceaaeccb3a594385"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Image: TooManyMethods \u2014 69 methods. The bar is 30 methods; this is 39 over it, 2.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":"lib/src/image/image.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2cbd71edf3d487f0e2dafd51f14513c86a6e0f0e6a906e92449f3bb29177c29"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PsdLayer.PsdLayer: MethodTooLong \u2014 PsdLayer runs 224 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 124 over it, 2.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/psd/psd_layer.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"187279aa6b39e63094e75e329c0626585b12e0e2a84201205ae7420e1a1513d4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VP8L: ClassTooLong \u2014 854 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 454 over it, 2.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87841884eaa70da2cad5e505536847a05e77c67cc3e6fcc8a16eb3fe519c341"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IfdDirectory: TooManyMethods \u2014 64 methods. The bar is 30 methods; this is 34 over it, 2.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/exif/ifd_directory.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b5b5ff986ac568804b3084c90efca499b0168ccd2e515476569343a12ff077"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VP8Filter: TooManyMethods \u2014 64 methods. The bar is 30 methods; this is 34 over it, 2.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_filter.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"df46bffa45d0eaef0d7779d03a983a6a3fa82aff1026f67b453e13c0cd73e7fe"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Image: ClassTooLong \u2014 808 significant lines (blank, comment-only and punctuation-only lines excluded), 69 methods. The bar is 400 significant lines; this is 408 over it, 2.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3812e855a2072a33b09b77a02cbdf3ffe8c9d09f0f366641881cad3ec25ec9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PixelUint1: TooManyMethods \u2014 60 methods. The bar is 30 methods; this is 30 over it, 2.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint1.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f334e1fa8b41b32938fa38ba819116a33ac3d03d0cc2e9c267794fa88fbe50b6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PixelUint2: TooManyMethods \u2014 60 methods. The bar is 30 methods; this is 30 over it, 2.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint2.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3ac52e994d8c60ca9387bf74162b7a3a710bf6f8d077c9240b4bd7a0350a4d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PngDecoder._startDecode: MethodTooLong \u2014 _startDecode runs 200 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_decoder.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"140dbc426bbd284158d5639152d2917df29e6f05c7bbf99e8de79d38b854538c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webp/vp8.dart: FileTooLong \u2014 993 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: VP8 (17-1612). The bar is 500 significant lines; this is 493 over it, 1.99\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde6076e68646f7096c2ce2c1cfd83d96190d15915dc5970fd4a22bfe81a108b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PixelUint4: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint4.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5115351ebfce3fa2e45c5a1f1feb91de7045237559ea9f8014ffd27864b9af6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tiff/tiff_fax_decoder.dart: FileTooLong \u2014 972 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: TiffFaxDecoder (4-1635). The bar is 500 significant lines; this is 472 over it, 1.94\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_fax_decoder.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"feea495dd8835da72a6d57913d52031875f01258006bc6936f4053690d486faa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PixelUint8: TooManyMethods \u2014 58 methods. The bar is 30 methods; this is 28 over it, 1.93\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint8.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"778808203a69aef9e97771de6015e4ff3d2466f2ea0c1453f874ec62db445565"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PixelFloat32: TooManyMethods \u2014 57 methods. The bar is 30 methods; this is 27 over it, 1.90\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_float32.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9513d4d87a83b0910f3aff345033b8e20bedf92413a6e42d093e4d5c44af010"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PixelUint16: TooManyMethods \u2014 57 methods. The bar is 30 methods; this is 27 over it, 1.90\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint16.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"deca0c2a58f8b724874167357313be47ec1b40d8ea8e0b62e3063ce2e2d348d2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PixelFloat16: TooManyMethods \u2014 56 methods. The bar is 30 methods; this is 26 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_float16.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a8e3146c6b18a9b7df79f2f5ae43042b7e2067e811bd3ee21c65c67be1a5b6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PixelFloat64: TooManyMethods \u2014 56 methods. The bar is 30 methods; this is 26 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_float64.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7557792630c5b56d3d1d2ab911acc002c77d3c35e20b9d9e37a14fbc08a76b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PixelInt16: TooManyMethods \u2014 56 methods. The bar is 30 methods; this is 26 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_int16.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d620bafaa55bba357766834328a297c18bae748e87c82977902d7da19556eeb3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PixelInt32: TooManyMethods \u2014 56 methods. The bar is 30 methods; this is 26 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_int32.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2792e164b3f0d95e9d8f81b2543fe26082932480ea4821802622c5b1c2a0bdc9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PixelInt8: TooManyMethods \u2014 56 methods. The bar is 30 methods; this is 26 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_int8.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75cc42bdd89d40668c0a93b5bd8d85ddd76c6b68f72ff20eedd1897aeac2235"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PixelUint32: TooManyMethods \u2014 56 methods. The bar is 30 methods; this is 26 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint32.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9380889daabc0d6b52205dcc183485cf6a8c7c6c95c5f7eee3683ae0dc751e7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: command/command.dart: FileTooLong \u2014 933 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: Command (116-1364). The bar is 500 significant lines; this is 433 over it, 1.87\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/command.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee412162baaa184ca5b847933a424a7f655850fa8a933150e7aaaac0de166e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webp/vp8l.dart: FileTooLong \u2014 895 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: VP8L (19-1509). The bar is 500 significant lines; this is 395 over it, 1.79\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab2cbc1e97e22540b3a3d016b5d55e0741aa9320a279006e647e91cf357e66a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PngDecoder: ClassTooLong \u2014 701 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 301 over it, 1.75\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_decoder.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"7725e0e468c8f8ec9355bee1cf178af8508b856a919d9222103312da6a01479e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PixelUndefined: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. Most of these members implement src.Color (30 of 43 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_undefined.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e46d7b048219d4133dc39505f097dfee48acd04cd5d70865dca30612861393"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: image/image.dart: FileTooLong \u2014 848 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: Image (54-1315). The bar is 500 significant lines; this is 348 over it, 1.70\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3273bb5fa9c190b006787eca933bb7c2a6c96f8fd191620890c7e1754410e6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JpegEncoder: ClassTooLong \u2014 666 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 266 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg_encoder.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b446b6685ec506371e2ad7dce77467ca68b0042b0f26fcb77fc8e99f49ec26c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExrPart.ExrPart: MethodTooLong \u2014 ExrPart runs 160 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_part.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4963462cfc772a8f82b2d939ab135d4f3a4657322869215725273a18a7faa7f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TiffImage.TiffImage: MethodTooLong \u2014 TiffImage runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6059e37777cc020bdc2fe817e60dbf2a61fefd821e548855cbba688d79c90d1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ColorUint1: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_uint1.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded6041775e46f0b5f1b61adb1690c770649eabd3de3387d8b3efe498175eb65"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ColorUint2: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_uint2.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6ca0b02d3ed488515ab41eee38e4f8339ddc9faaf771376206b9505885660a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ColorUint4: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_uint4.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"808386cb69ade349e5c87f2b00dc581c2e3b422f1e0e0e603223e4f2e0ba135f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PngDecoder._decodeFrame: MethodTooLong \u2014 _decodeFrame runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_decoder.dart"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b60a0b69128013e973c44033e216e8dbbd54789c0de763247e180efe0fb2717"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TiffImage: ClassTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded), 10 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":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"10872901d933287e86023a975907a113f882d720a91e753f9f6985cbfa50bcc1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ColorFloat16: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. Most of these members implement src.Color (30 of 36 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_float16.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"698ab17d8442965944350e8e45a17ce8a78243339a29b0ed9bbf05a98c13e88b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ColorFloat32: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. Most of these members implement src.Color (30 of 36 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_float32.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b84b9581c35dd625c9c063c242a778314ba84d40d18294a5f5dbcaa2cf2e6b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ColorFloat64: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. Most of these members implement src.Color (30 of 36 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_float64.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde5cd9b111a03aee9467ab12ef56b120c4d48d037f3f00eaa2a84f1d9008cc4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ColorInt16: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. Most of these members implement src.Color (30 of 36 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_int16.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b606321ed273bd89ee6e94d8140b63ff9d6d1e45be4fb66ef18f4e7f51b96085"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ColorInt32: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. Most of these members implement src.Color (30 of 36 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_int32.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e2a4e93e3040d15fb1d21e1a8c61ca931db5d9630cd6010e686e9173bb3ec5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ColorInt8: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. Most of these members implement src.Color (30 of 36 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_int8.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a9845eb1b8c67dd5c1ba6d8aa2fe6775b1591d930f6977f780a82768a40cee"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ColorUint16: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. Most of these members implement src.Color (30 of 36 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_uint16.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce62fb586bc88776cd16019666cb3783469e26eef620f64516a79eca19a6662"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ColorUint32: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. Most of these members implement src.Color (30 of 36 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_uint32.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"375c76a1ffde8b42922e946ec5b873ade76496371b90b3d7d4d78c241f2975af"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ColorUint8: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. Most of these members implement src.Color (30 of 36 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_uint8.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd454030529029cd28b28126de03167ba128071618e35a621632946835badaaa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VP8Decimate: ClassTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 188 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_rd.dart"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f77a2cf6be6545cf185ca5dc3994c0fa55252ba7213ed707a4307b2d06dcf7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: formats/png_decoder.dart: FileTooLong \u2014 730 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: PngDecoder (29-1018). The bar is 500 significant lines; this is 230 over it, 1.46\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_decoder.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a8fae25fe100adbc494ac3abd1e70bdbe11d47cbc60e89489903d707a1021b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JpegData: ClassTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded), 30 methods. The bar is 400 significant lines; this is 174 over it, 1.44\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/jpeg_data.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3b4729dd8f673e91a6b213f17e61c6855d23315d4980573ae7492587dd4f9c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConstColorUint8: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. Most of these members implement src.Color (30 of 33 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/const_color_uint8.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff001142034980e7c36fa8af3be153863bb2e6860e7c1ec090d0bd28f7f52d1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VP8: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1351816b45066ee42f763be0160741584f8b7d351b5837dac5536841cf64ed74"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: formats/jpeg_encoder.dart: FileTooLong \u2014 684 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: JpegEncoder (25-1428). The bar is 500 significant lines; this is 184 over it, 1.37\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg_encoder.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e7d25260b6c804d18764011c1115c6808d658e1ff0a55ab4b20e591ec4b054"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tiff/tiff_image.dart: FileTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: TiffImage (19-836). The bar is 500 significant lines; this is 174 over it, 1.35\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8816e53e43bc6ae36aec26c47041b65efebc1fe339fbaa596fd245ed29f4fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webp/vp8_rd.dart: FileTooLong \u2014 666 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: VP8Decimate (144-1020). The bar is 500 significant lines; this is 166 over it, 1.33\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_rd.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"394a57b75970a70b56f8b0ff7882f32d3b2275d7df03f4861834d52e132e54f4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BitmapFont._parseFnt: MethodTooLong \u2014 _parseFnt runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/font/bitmap_font.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d1dcde3b937c5ea45321f5728d0ad66b5f490ed5d35aa94400e493baf636f0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VP8L._decodeImageData: MethodTooLong \u2014 _decodeImageData runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l.dart"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6beebf31e2e7f69a236da2695bee58e730b6d68df1df93eb1ff26e7a662b2b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Color: 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":"lib/src/color/color.dart"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d2dd5cc52f34c62f10ed8bcdd511779e76d9ce92be55c4a85e4b7ac78a28b2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PvrDecoder._decodePvr2: MethodTooLong \u2014 _decodePvr2 runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/pvr_decoder.dart"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bcf0c31d45d0f60dc89eabd1091ae69b9205a2459744eb7d7396c17af8640c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PsdImage._blend: MethodTooLong \u2014 _blend runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/psd/psd_image.dart"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a0a0b27aa3ef638a3b927563acb57aff4e52267cf50ec6d53be93909669814"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VP8Filter: ClassTooLong \u2014 492 significant lines (blank, comment-only and punctuation-only lines excluded), 64 methods. The bar is 400 significant lines; this is 92 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_filter.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b402a0426841f23e38a034fbb5c3e229fbc8915d1dbd0f82e0efa168fd952b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: jpeg/jpeg_data.dart: FileTooLong \u2014 602 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: JpegData (28-901). The bar is 500 significant lines; this is 102 over it, 1.20\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/jpeg_data.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"473990a2e09f6b212fabd06c34a5826460c94bd75e05310bc477ea460cae9807"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GifDecoder: ClassTooLong \u2014 478 significant lines (blank, comment-only and punctuation-only lines excluded), 28 methods. The bar is 400 significant lines; this is 78 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/gif_decoder.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4159f9aa168393c76bda2409223cf4187a321c6819c9a3232d8159439ef1ad00"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VP8LTransform: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.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":"lib/src/formats/webp/vp8l_transform.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"883a359be4a04ed8152281b2d7a685be8789d22b48174591b1760981a61cb424"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VP8LEncoder._writeImageStream: MethodTooLong \u2014 _writeImageStream runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l_encoder.dart"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2f587318fc67fc4ff95c34dee4544fa44b20bbaa2e6c878b8ce11d22dbb574"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VP8L: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af4d93dbd7d6964051927772535d2678fa876b84bf1d99c496ed26183811bb4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TiffFaxDecoder.decodeT6: MethodTooLong \u2014 decodeT6 runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_fax_decoder.dart"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78262c0e056c25551a688d9696a887ae68db15f8bbc38d29d81211a9e85e1fb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VP8Decimate._trellisQuantizeBlock: MethodTooLong \u2014 _trellisQuantizeBlock runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_rd.dart"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d744bdfce88635a1c808cdaa8406676cd92291d5bdeeb5e762dd5b7f493f420"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PsdImage: ClassTooLong \u2014 435 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 35 over it, 1.09\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/psd/psd_image.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb328b63a3e26f552b24cb3696f421d07148a0b15561f9a43d540e4818f5931"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transform/_resize_bytes.dart: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/transform/_resize_bytes.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1846b3a23522b8a8682dd815ecb15ebdfc3e0519cc6b5db966539d101c6c5b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PsdImage: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/psd/psd_image.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06184f7f10c51e36084d963efacbc9d6990dcff34504623411bf0bbfa956677"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InputBuffer: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/util/input_buffer.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfaba3a06d6daea2d25c6b14239b2900c8e3223d2b6a98cfc049d42ae95eed35"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Image.getPixelCubic: MethodTooLong \u2014 getPixelCubic runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image.dart"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8abec0f371ba566ca09869dfffc7f27870973d4ef0c987b2266d990419f3a9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Image.fromBytes: MethodTooLong \u2014 fromBytes runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image.dart"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac51e497aab02086b1004812fca5a3d85d6b9c0ef2f7c57d3e1dd3736cec8a03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: exif/ifd_value.dart: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/exif/ifd_value.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81eff23b511f621a7e4b99d5eb43903a3a95e8c2ce788d00298e1bdafbf90c19"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 12 shared lines): lib/src/image/image_data_int16.dart:96-110 | lib/src/image/image_data_int32.dart:96-110 | lib/src/image/image_data_uint16.dart:104-118 | lib/src/image/image_data_uint32.dart:96-110 \u2014 These 4 members are variants of one another: a block of 12 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 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":"lib/src/image/image_data_int16.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1915cbb4a22b6117774b571e5198c5e50cf9c4066b466839cea6571fb2ce0e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/src/formats/webp/vp8_filter.dart:447-467 | lib/src/formats/webp/vp8_filter.dart:509-530 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_filter.dart"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f3ed0c887e8c2c8fa8538057a856b37966fd3ca49a692eec7b301d9bdd9200"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): lib/src/image/pixel_uint1.dart:312-343 | lib/src/image/pixel_uint2.dart:309-340 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint1.dart"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"099e0342c38d4b2b915cef5ee1d1c68025ef1d2b806c3b9ec813b6655c7cc0f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/src/image/image_data_int8.dart:96-110 | lib/src/image/image_data_uint8.dart:107-121 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_int8.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"2762f07cb80255eeeea9c72152a081937653883c64f4daaa74e2569a004ac5f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (12 members, 50\u002B identical tokens): lib/src/image/palette_int16.dart:37-47 | lib/src/image/palette_int16.dart:49-62 | lib/src/image/palette_int32.dart:37-47 | lib/src/image/palette_int32.dart:49-62 | lib/src/image/palette_int8.dart:37-47 | lib/src/image/palette_int8.dart:49-62 | lib/src/image/palette_uint16.dart:37-47 | lib/src/image/palette_uint16.dart:49-62 | lib/src/image/palette_uint32.dart:37-47 | lib/src/image/palette_uint32.dart:49-62 | lib/src/image/palette_uint8.dart:37-47 | lib/src/image/palette_uint8.dart:49-62 \u2014 These 12 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 12 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 12 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/palette_int16.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e404fa60f4f026cf4769012b16da1e09f53237dc5df8e3b97f4c3624ecd842e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): lib/src/image/pixel_float16.dart:293-323 | lib/src/image/pixel_float32.dart:261-291 | lib/src/image/pixel_float64.dart:261-291 | lib/src/image/pixel_int16.dart:265-295 | lib/src/image/pixel_int32.dart:265-295 | lib/src/image/pixel_int8.dart:265-295 | lib/src/image/pixel_uint32.dart:265-295 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_float16.dart"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea62f274cf8275b9ff51e6f5fcc6ed49885584028dfd21b5a141ed6fd38b479b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): lib/src/color/color_int16.dart:168-177 | lib/src/color/color_int32.dart:168-177 | lib/src/color/color_int8.dart:168-177 | lib/src/color/color_uint16.dart:168-177 | lib/src/color/color_uint32.dart:168-177 | lib/src/color/color_uint8.dart:172-181 \u2014 These 6 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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_int16.dart"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8da8fe2521dce3223a1f06ff1e2b60b9a5768998f66d5fdb931e2b4099affd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): lib/src/color/color_int16.dart:179-193 | lib/src/color/color_int32.dart:179-193 | lib/src/color/color_int8.dart:179-193 | lib/src/color/color_uint16.dart:179-193 | lib/src/color/color_uint32.dart:179-193 | lib/src/color/color_uint8.dart:183-197 \u2014 These 6 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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_int16.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"9017f101e5fb6c443611d601dcdc3f35925265f71dff04f85e1d453de5f4e2dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): lib/src/image/pixel_int16.dart:233-243 | lib/src/image/pixel_int32.dart:233-243 | lib/src/image/pixel_int8.dart:233-243 | lib/src/image/pixel_uint16.dart:265-275 | lib/src/image/pixel_uint32.dart:233-243 | lib/src/image/pixel_uint8.dart:264-274 \u2014 These 6 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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_int16.dart"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf7540926cb6871db034d1ce47cebac13ea3165764b2bc6cf5c98edde912895"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): lib/src/image/pixel_int16.dart:245-260 | lib/src/image/pixel_int32.dart:245-260 | lib/src/image/pixel_int8.dart:245-260 | lib/src/image/pixel_uint16.dart:277-292 | lib/src/image/pixel_uint32.dart:245-260 | lib/src/image/pixel_uint8.dart:276-291 \u2014 These 6 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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_int16.dart"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"65199753b19161e32a52b94870ac466a44649c2f4f8e346f8d411e9db8bc135a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/src/formats/exr/exr_piz_compressor.dart:43-140 | lib/src/formats/exr/exr_pxr24_compressor.dart:35-127 | lib/src/formats/exr/exr_rle_compressor.dart:31-100 | lib/src/formats/exr/exr_zip_compressor.dart:37-90 \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":"lib/src/formats/exr/exr_piz_compressor.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc502908769b30ba967befe11a09064b9cdc1dbb9c8e9fc30bd60f37e7c3e6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/src/formats/pvr_decoder.dart:533-595 | lib/src/formats/pvr_decoder.dart:597-660 | lib/src/formats/pvr_encoder.dart:89-190 | lib/src/formats/pvr_encoder.dart:192-295 \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":"lib/src/formats/pvr_decoder.dart"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"499ca9d72a6c5409bd175d2fb0381b7cacc767944773164eb8282df5c8ceac02"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/src/image/image_data_int16.dart:85-94 | lib/src/image/image_data_int32.dart:85-94 | lib/src/image/image_data_uint16.dart:93-102 | lib/src/image/image_data_uint32.dart:85-94 \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":"lib/src/image/image_data_int16.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6686c3f02afb52ce2ad96f81890bdeaabe027527e3106f2618c7587e1379538d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/src/image/palette_float32.dart:37-47 | lib/src/image/palette_float32.dart:49-62 | lib/src/image/palette_float64.dart:40-50 | lib/src/image/palette_float64.dart:52-65 \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":"lib/src/image/palette_float32.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c57b67cfa7fd2d9af6b8b16b2c8a4e82f9578dad62c69af551da022cc9a1a1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): lib/src/formats/webp/vp8_filter.dart:405-424 | lib/src/formats/webp/vp8_filter.dart:427-444 | lib/src/formats/webp/vp8_filter.dart:470-490 | lib/src/formats/webp/vp8_filter.dart:493-506 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_filter.dart"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7e953b01ecbfda6c6e6a99c157c36e866a349c754603217bf8322245206d07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): lib/src/formats/pvr_encoder.dart:297-322 | lib/src/formats/pvr_encoder.dart:324-349 \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":"lib/src/formats/pvr_encoder.dart"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3decfeb6d06d523808bd1fb4926148d70719050a4a717c63590b64a024955e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): lib/src/formats/png_decoder.dart:638-688 | lib/src/formats/png_decoder.dart:690-733 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_decoder.dart"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cb8135cad688db20fd397d7da01b0ef62fd707049ce1ba252c144dd920528a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): lib/src/formats/webp/webp_filters.dart:77-107 | lib/src/formats/webp/webp_filters.dart:109-139 | lib/src/formats/webp/webp_filters.dart:150-183 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 31 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/webp_filters.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0802aa0a8cb6d78b61e741f8cb08445b783b3e27552188ab0f56ba552710389e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): lib/src/formats/webp/vp8l_transform.dart:72-108 | lib/src/formats/webp/vp8l_transform.dart:110-141 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l_transform.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2796d83b2f9925213b3e042c8a0913fc45ea139b706d982774f3f6448862f2ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/src/formats/webp/vp8_rd.dart:583-604 | lib/src/formats/webp/vp8_rd.dart:616-634 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_rd.dart"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"56664ee8b0d0206a4e6d1a4c8a77464cdb5b593e6e9e34ca6b9f78434f4d79e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/src/formats/webp/vp8_filter.dart:128-139 | lib/src/formats/webp/vp8_filter.dart:142-156 \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":"lib/src/formats/webp/vp8_filter.dart"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"0801fe6cddb0c020576f812a20cf23ee2768870dac3092570804b0b6bf17c767"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): lib/src/formats/exr/exr_part.dart:284-305 | lib/src/formats/exr/exr_part.dart:307-328 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_part.dart"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe7a7a23fa7a3ab9f16622172feaf7e175f081ca0acc31382a9f9d661d4401a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): lib/src/formats/ico_decoder.dart:58-84 | lib/src/formats/psd_decoder.dart:51-76 \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":"lib/src/formats/ico_decoder.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa0eb478bd4d2af3a8953d4438af5938fd59cfbd94787a4cbf327ba4d991f05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): lib/src/image/pixel_uint1.dart:121-149 | lib/src/image/pixel_uint2.dart:121-149 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint1.dart"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9e8eb3654336a8e6a380d5ee1c43fb69a4e76b21e40970cf7b1886a73ee0c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): lib/src/formats/webp/vp8.dart:60-90 | lib/src/formats/webp/vp8l.dart:56-87 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fdc3319d4991bda2a0dafddd7e9256ebe2b81c33d7463f55df0c1b607c4c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/src/formats/webp/vp8l_transform.dart:315-323 | lib/src/formats/webp/vp8l_transform.dart:328-335 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l_transform.dart"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"f423722498194796e36ab3cfa13fab65c734c1a29b14c9eda90c8a2c8760c96b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/src/image/image_data_float16.dart:96-110 | lib/src/image/palette_float16.dart:50-63 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_float16.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"300dc819792bd86707d52b90a729daf7867d103cd5e9f1067fc3059717d9d4ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): lib/src/image/pixel_uint1.dart:170-188 | lib/src/image/pixel_uint2.dart:167-185 | lib/src/image/pixel_uint4.dart:170-188 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint1.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e7e0db33ba5b8e872927a0be82057cb599b7a31e82e379e009f7d744c74044"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): lib/src/formats/pvr/pvr_packet.dart:117-131 | lib/src/formats/pvr/pvr_packet.dart:133-151 | lib/src/formats/pvr/pvr_packet.dart:169-187 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/pvr/pvr_packet.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a6b69ed63316ee8bcf80b5e4cdc89bee2ee87c48e1e9f314d0cc13b3e236cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/src/formats/webp/vp8_filter.dart:101-112 | lib/src/formats/webp/vp8_filter.dart:114-125 \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":"lib/src/formats/webp/vp8_filter.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"193dfeb75e687f7f52e1e3dcc1060d2b61d31a1d1fd968d9f1b972870edc7e9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/src/formats/webp/vp8_bool_encoder.dart:73-94 | lib/src/formats/webp/vp8_bool_encoder.dart:96-116 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_bool_encoder.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadba88c9aca151c2a87cb57ab1623e560923eb68f5a452cc531b968b790b078"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/src/formats/png_encoder.dart:398-407 | lib/src/formats/png_encoder.dart:417-427 \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":"lib/src/formats/png_encoder.dart"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"877b00ed9d58cb227494359b194ad8faee92bd62844d287637f34b86ffcd69ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/src/formats/jpeg_encoder.dart:687-703 | lib/src/formats/jpeg_encoder.dart:724-741 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg_encoder.dart"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bc3627ceabb2251f9a7f599b35e91763beb00bb2226d201574d5482336342e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 19\u002B corresponding lines): lib/src/command/command.dart:422-440 | lib/src/command/command.dart:442-462 | lib/src/command/command.dart:494-518 | lib/src/command/command.dart:536-554 | lib/src/command/command.dart:556-580 | lib/src/command/command.dart:582-604 | lib/src/command/command.dart:614-634 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 19 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/command.dart"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"090f42c7701165045169a712149b44e65e6d4b244c847ddd7400d8598be000ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/src/formats/webp/vp8_filter.dart:182-188 | lib/src/formats/webp/vp8_filter.dart:190-196 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_filter.dart"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"04369db5be59a806ae33f4669d45ff15edee86594c83e7c70dbc842166d4585d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 4\u002B corresponding lines): lib/src/image/image_data_int16.dart:65-68 | lib/src/image/image_data_int32.dart:65-68 | lib/src/image/image_data_int8.dart:65-68 | lib/src/image/image_data_uint1.dart:79-82 | lib/src/image/image_data_uint16.dart:73-76 | lib/src/image/image_data_uint2.dart:79-82 | lib/src/image/image_data_uint32.dart:65-68 | lib/src/image/image_data_uint4.dart:85-88 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 4 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 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_int16.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5193d52e6c3518ffd495a4087b08ac20491d94bdb5c3d7eb38fbfd548bef2bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/src/command/command.dart:636-652 | lib/src/command/command.dart:670-690 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/command.dart"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5cc700d3a65ee4a1d8708adb77d87f3a0e8654ba8a8918b6f2b17d36ae1bc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/src/formats/jpeg/jpeg_util.dart:132-148 | lib/src/formats/jpeg_encoder.dart:705-722 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/jpeg_util.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabe9d6ef5d1239fa2110eef4d2c0246d3fc0d0360e3167ca1bc967473829974"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/src/command/filter/color_offset_cmd.dart:22-35 | lib/src/command/filter/copy_image_channels_cmd.dart:26-42 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/filter/color_offset_cmd.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"201de189301f0655b54c8a5330da7190cf8b204d12c3bcc6833d972718bea178"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/src/image/image_data_float16.dart:85-94 | lib/src/image/palette_float16.dart:38-48 \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":"lib/src/image/image_data_float16.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2265b0353e5ac21fb5333bb68eba8aac06e4d6b487f799043039e6272daa0809"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): lib/src/color/color_uint1.dart:20-25 | lib/src/color/color_uint2.dart:20-25 | lib/src/color/color_uint4.dart:22-27 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_uint1.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f0d3c8b299d24ca420394c31bf8eece9c09fc0891eb50f54df3a7b6b5e6ea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/src/command/filter/bulge_distortion_cmd.dart:27-42 | lib/src/command/filter/stretch_distortion_cmd.dart:23-36 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/filter/bulge_distortion_cmd.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2614763f32889fa3a644e8d3a9e62568423b1c2725945ac07aa6698b17a1d68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/src/color/color_float32.dart:28-33 | lib/src/color/color_float64.dart:28-33 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_float32.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4d62fce5b4c25d5a39ddfee5a29a476a95f9f5c309eba1ff2e6f9a53772c57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/src/command/command.dart:739-757 | lib/src/command/command.dart:1103-1117 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/command.dart"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"837691e33dd4d84a9249ec365fef617bef8ef5aa3ea9f668c9b3973f54c801d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 14\u002B corresponding lines): lib/src/command/draw/draw_char_cmd.dart:30-45 | lib/src/command/draw/draw_circle_cmd.dart:30-46 | lib/src/command/draw/draw_line_cmd.dart:34-52 | lib/src/command/draw/draw_polygon_cmd.dart:29-44 | lib/src/command/draw/draw_rect_cmd.dart:34-52 | lib/src/command/draw/draw_string_cmd.dart:34-51 | lib/src/command/draw/fill_circle_cmd.dart:30-46 | lib/src/command/draw/fill_polygon_cmd.dart:25-38 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/draw/draw_char_cmd.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8239e432593acb2cb0109b41e99c2ebe6bb547f84e4b6a14636593e3751a82e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/src/command/filter/pixelate_cmd.dart:22-35 | lib/src/command/filter/vignette_cmd.dart:25-39 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/filter/pixelate_cmd.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0692de059b079cc7438b889d6a562d1e9e091855ff6c28212c07284d18ac6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): lib/src/color/color_float16.dart:99-106 | lib/src/color/color_float16.dart:115-122 | lib/src/color/color_float16.dart:131-138 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_float16.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa0fc2fcf12ab105751a33bd98cb067bfb8c3c78ba5b28d0ab8a09d7204b3e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/src/command/command.dart:996-1010 | lib/src/command/command.dart:1119-1135 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/command.dart"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"73cabbc008f0aad3bb7d38f2e525d3f904e22f7425f0579650179bcfa9fd13d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): lib/src/color/color_float16.dart:27-31 | lib/src/color/color_float16.dart:33-38 | lib/src/color/color_float16.dart:188-197 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_float16.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d7ef73d6b94f21333d30d705a855d7a971dda41f37bc87bf9625a8a20f98c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): lib/src/formats/webp/vp8_filter.dart:77-81 | lib/src/formats/webp/vp8_filter.dart:83-87 | lib/src/formats/webp/vp8_filter.dart:89-93 | lib/src/formats/webp/vp8_filter.dart:95-99 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_filter.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdde35b7e03dcc3319ae95ec307c3356bb8702f61e54a96466ba36a69bec564d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 9\u002B corresponding lines): lib/src/image/image_data_uint1.dart:105-113 | lib/src/image/image_data_uint1.dart:115-123 | lib/src/image/image_data_uint2.dart:105-113 | lib/src/image/image_data_uint2.dart:115-123 | lib/src/image/image_data_uint4.dart:111-119 | lib/src/image/image_data_uint4.dart:121-129 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_uint1.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf243baa8a4371cec53f0df2199424340e4cd0eb82307e00761cb91f07350b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/src/formats/webp/vp8_filter.dart:60-66 | lib/src/formats/webp/vp8_filter.dart:68-74 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_filter.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9152cc83dfb662888d3860c0fad4a6887c9261e865a948496958a650f58cca35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): lib/src/command/command.dart:256-270 | lib/src/command/command.dart:272-287 | lib/src/command/command.dart:1012-1030 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/command.dart"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"947da4d5e6fc2d318ba521fcf72f96df87db132c4230a9cbb279b9ff540802f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/src/image/pixel_uint1.dart:108-116 | lib/src/image/pixel_uint2.dart:108-116 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint1.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f54d466ebc5bc8c716599020ee9964b31296311c0b78ce92dbfcb3e182f231f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/src/formats/psd/psd_image.dart:361-367 | lib/src/formats/psd/psd_image.dart:369-377 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/psd/psd_image.dart"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9e7406be519bf70b7034d1a0c2e7377dbad080f69b2dce4cd726f7844502f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/src/image/image_data_uint2.dart:20-25 | lib/src/image/image_data_uint4.dart:20-31 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_uint2.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"297d92134921394ef2f384bc2025a8eceac7758ec5d420f616d9541f7e7ace00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/src/formats/webp/vp8_filter.dart:554-560 | lib/src/formats/webp/vp8_filter.dart:606-612 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_filter.dart"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a82b39b2bc94f6a37e868ce41b92ec05de5c0a3d169920853d07718dd4877c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/src/image/pixel_uint8.dart:204-211 | lib/src/image/pixel_uint16.dart:204-211 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint8.dart"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd602d237f809f7a291f213456d701cfc510b9d4cfe0eff8e7bb87e1e315fc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/src/formats/webp/vp8_filter.dart:19-25 | lib/src/formats/webp/vp8_filter.dart:27-34 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_filter.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d5b3890e740f67339a719f1094b81f91280e8535d9c88996865419e6a2337c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 13\u002B corresponding lines): lib/src/command/command.dart:769-785 | lib/src/command/command.dart:787-801 | lib/src/command/command.dart:812-826 | lib/src/command/command.dart:864-880 | lib/src/command/command.dart:935-949 | lib/src/command/command.dart:955-967 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/command.dart"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ec081e04b80bda4cdc188edf8752f6921d316cb8dad1abdff6f71ab3ea8040"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/src/image/pixel_uint16.dart:168-175 | lib/src/image/pixel_uint32.dart:143-150 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint16.dart"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"14567ece498743a9e83f7d4d01512a72a14b12ddb59419dfa1383d556f380f7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/src/image/pixel_uint16.dart:186-193 | lib/src/image/pixel_uint32.dart:159-166 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint16.dart"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22210a4d792561af49be8b46ad7a2eaae8ea03776a349982196711ef1a1908a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/src/image/pixel_uint16.dart:195-202 | lib/src/image/pixel_uint8.dart:195-202 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint16.dart"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"857a604e82684ba4023c1de7a115938b20eaf778b0b68bc85868673bb8e6c793"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): lib/src/command/filter/bump_to_normal_cmd.dart:9-14 | lib/src/command/filter/drop_shadow_cmd.dart:15-22 | lib/src/command/filter/hdr_to_ldr_cmd.dart:9-14 | lib/src/command/filter/reinhard_tonemap_cmd.dart:13-18 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/filter/bump_to_normal_cmd.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a0dc90a0be2d7c9d1957fdd49e92c675e394cd6f6f9b33477b3b9ad04bf82d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/src/image/pixel_float16.dart:243-251 | lib/src/image/pixel_uint8.dart:252-262 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_float16.dart"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"194eb69c6ef04fc8d0f125d426f6810142a0a892e6cb01e7089e652ab6dad43a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/src/formats/png_decoder.dart:881-884 | lib/src/formats/png_encoder.dart:458-461 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_decoder.dart"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c90cc78c0b3d1db537548be01535a6b6f5c84f2b23a615b6785a9c7cc3aa8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 3\u002B corresponding lines): lib/src/formats/exr_decoder.dart:59-61 | lib/src/formats/gif_decoder.dart:189-191 | lib/src/formats/ico_decoder.dart:54-56 | lib/src/formats/jpeg_decoder.dart:82-84 | lib/src/formats/png_decoder.dart:540-542 | lib/src/formats/pnm_decoder.dart:63-65 | lib/src/formats/pvr_decoder.dart:240-242 | lib/src/formats/tga_decoder.dart:39-41 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 3 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 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr_decoder.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f5cfafa5591d5507c5e3047263552ca57ad3ea25368f1bd1c33e4858a3ae11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/src/formats/exr/exr_b44_compressor.dart:31-35 | lib/src/formats/exr/exr_compressor.dart:75-78 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_b44_compressor.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7650e8e7e26940824223ea0f7d09fb0a057cb30549e4315645d07d22dee73daf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50\u201351 lines \u00D7 2): lib/src/formats/jpeg_encoder.dart:565-614 | lib/src/formats/jpeg_encoder.dart:620-670 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/jpeg_encoder.dart:565\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg_encoder.dart"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abb5a972b99b4c2699e96da70798860b0064b62b872795472fffe3f7df91534"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38\u201342 lines \u00D7 2): lib/src/formats/tiff/tiff_fax_decoder.dart:242-279 | lib/src/formats/tiff/tiff_fax_decoder.dart:379-420 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/tiff/tiff_fax_decoder.dart:242\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_fax_decoder.dart"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6df0a73a8f48413b3846171a776199e95345acc27d0ca4019a83bba2024fcc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): lib/src/formats/jpeg_encoder.dart:382-417 | lib/src/formats/jpeg_encoder.dart:459-494 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/jpeg_encoder.dart:382\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":"lib/src/formats/jpeg_encoder.dart"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe1b3a531dd909190afc4ded0e904bccfc838ffdc3f57f6a8d762ee54add326"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201335 lines \u00D7 2): lib/src/formats/tiff/tiff_fax_decoder.dart:57-91 | lib/src/formats/tiff/tiff_fax_decoder.dart:542-573 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/tiff/tiff_fax_decoder.dart:57\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_fax_decoder.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7779f0adb9717dac164f788341ec075215899eabd94c6ff06153509ab9ce10d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): lib/src/formats/pvr_encoder.dart:161-190 | lib/src/formats/pvr_encoder.dart:265-295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/pvr_encoder.dart:161\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/pvr_encoder.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ca1ca44a9f874dea0439d44564e967fa027da787a61881a9c09d7b185d5dd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): lib/src/formats/exr/exr_rle_compressor.dart:72-100 | lib/src/formats/exr/exr_zip_compressor.dart:62-90 \u2014 before extracting anything, compare \u0060lib/src/formats/exr/exr_rle_compressor.dart\u0060 and \u0060lib/src/formats/exr/exr_zip_compressor.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/exr/exr_rle_compressor.dart:72\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_rle_compressor.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"52495e3421694a849add195acb5ca7d8b481d59779f5400fda6090ac1607cf42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): lib/src/image/pixel_uint16.dart:300-328 | lib/src/image/pixel_uint8.dart:299-327 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_uint16.dart\u0060 and \u0060lib/src/image/pixel_uint8.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/image/pixel_uint16.dart:300\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint16.dart"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"8748dcdb244282a80bac7ffdfcc64ad204d29db1b79fccdb0db7a9efe4633818"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 7): lib/src/image/pixel_float16.dart:296-323 | lib/src/image/pixel_float32.dart:264-291 | lib/src/image/pixel_float64.dart:264-291 | lib/src/image/pixel_int16.dart:268-295 | lib/src/image/pixel_int32.dart:268-295 | lib/src/image/pixel_int8.dart:268-295 | lib/src/image/pixel_uint32.dart:268-295 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_float16.dart\u0060 and \u0060lib/src/image/pixel_float32.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/image/pixel_float16.dart:296\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_float16.dart"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"806b1ae7eae53607686ba6fea47b6d26b11dd3c78a82781d70ed623256416851"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): lib/src/formats/jpeg_encoder.dart:344-370 | lib/src/formats/jpeg_encoder.dart:421-447 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/jpeg_encoder.dart:344\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg_encoder.dart"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f6e7edcacdfe80eed4aa6f1d2ecd6fd851ccbe7850e6ab38541d10d7d843cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): lib/src/formats/psd/psd_layer.dart:186-211 | lib/src/formats/psd/psd_layer.dart:213-238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/psd/psd_layer.dart:186\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/psd/psd_layer.dart"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db5bad99f7bb92b1b63fc8ce4bbae7599d5aebfa77c1060a0fc034d20b5fd41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 3): lib/src/image/pixel_uint1.dart:319-343 | lib/src/image/pixel_uint2.dart:316-340 | lib/src/image/pixel_uint4.dart:318-342 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_uint1.dart\u0060 and \u0060lib/src/image/pixel_uint2.dart\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/image/pixel_uint1.dart:319\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint1.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7b3df5f6f3a8b3ebeac88c32f84ef55208a87d03af263d3bdd826641d37d17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): lib/src/formats/tiff/tiff_fax_decoder.dart:108-131 | lib/src/formats/tiff/tiff_fax_decoder.dart:588-611 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/tiff/tiff_fax_decoder.dart:108\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/src/formats/tiff/tiff_fax_decoder.dart:133\u0060 calls \u0060_setToBlack\u0060 and \u0060lib/src/formats/tiff/tiff_fax_decoder.dart:612\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_fax_decoder.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"367c79a87d47958863d485756b62469440db4abe8544118ac0a6adfcd93cf7a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): lib/src/formats/pvr_decoder.dart:536-558 | lib/src/formats/pvr_decoder.dart:600-622 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/pvr_decoder.dart:536\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/pvr_decoder.dart"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07c236eb5b19c05225fa4db955728bb25f5b709c69579543161a64e272d00af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 2): lib/src/formats/tiff/tiff_image.dart:458-477 | lib/src/formats/tiff/tiff_image.dart:513-535 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/tiff/tiff_image.dart:458\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce9dd647a4e9b9f6c9e17f27dd08f44e28b492578e971ddfc4976d18e9292c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): lib/src/util/neural_quantizer.dart:171-190 | lib/src/util/neural_quantizer.dart:199-218 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/util/neural_quantizer.dart:171\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/util/neural_quantizer.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"73da2fffe4fc69811e953708b93351ca31d1047a3c49b5c4e2e47a2f5e5cf47b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): lib/src/formats/pvr_encoder.dart:90-108 | lib/src/formats/pvr_encoder.dart:193-211 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/pvr_encoder.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"defdc80c0cded4f595aca7c8d08c602baa3da417de6fb837dac56bf02c3c8af4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): lib/src/formats/exr/exr_piz_compressor.dart:46-62 | lib/src/formats/exr/exr_pxr24_compressor.dart:49-65 | lib/src/formats/exr/exr_rle_compressor.dart:36-52 | lib/src/formats/exr/exr_zip_compressor.dart:43-59 \u2014 before extracting anything, compare \u0060lib/src/formats/exr/exr_rle_compressor.dart\u0060 and \u0060lib/src/formats/exr/exr_zip_compressor.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/src/formats/exr/exr_rle_compressor.dart:34\u0060 calls \u0060OutputBuffer\u0060 and \u0060lib/src/formats/exr/exr_piz_compressor.dart:45\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_piz_compressor.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"86dc17bd3fb617187097fa59190ff2170e9ce86fa89f55d94a8af81de22ca683"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): lib/src/image/pixel_uint1.dart:291-307 | lib/src/image/pixel_uint2.dart:288-304 | lib/src/image/pixel_uint4.dart:290-306 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_uint1.dart\u0060 and \u0060lib/src/image/pixel_uint2.dart\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint1.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e74ce62e3b869633a07e3623452e067554b987692626bfd76e9e41fbdd1df37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): lib/src/formats/psd/psd_layer.dart:240-255 | lib/src/formats/psd/psd_layer.dart:266-282 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/psd/psd_layer.dart:240\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/psd/psd_layer.dart"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e4d9be836c8ee14ad5f0295880706448a033840428c3f1f7747a3fea1c8f47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 6): lib/src/image/pixel_int16.dart:245-260 | lib/src/image/pixel_int32.dart:245-260 | lib/src/image/pixel_int8.dart:245-260 | lib/src/image/pixel_uint16.dart:277-292 | lib/src/image/pixel_uint32.dart:245-260 | lib/src/image/pixel_uint8.dart:276-291 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_int16.dart\u0060 and \u0060lib/src/image/pixel_int32.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_int16.dart"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1fd69826f94142fd2f6ad499c8960f043a207c1ebeb6bf167d86495aa0b9ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): lib/src/formats/pvr_decoder.dart:553-568 | lib/src/formats/pvr_decoder.dart:617-632 | lib/src/formats/pvr_encoder.dart:126-141 | lib/src/formats/pvr_encoder.dart:229-244 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/pvr_decoder.dart:553\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/pvr_decoder.dart"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5f730de078da0f2ccf08273c0e07f3d566a15a84662721a1b6aa77be5cca19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): lib/src/formats/webp/vp8l.dart:271-286 | lib/src/formats/webp/vp8l.dart:312-327 | lib/src/formats/webp/vp8l.dart:349-363 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l.dart"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2900255fe465a09bd2bfcc822dc2fc4857b7cb128e45c0961d2f87d56b9be9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): lib/src/formats/webp/webp_filters.dart:78-92 | lib/src/formats/webp/webp_filters.dart:110-125 | lib/src/formats/webp/webp_filters.dart:151-165 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/webp/webp_filters.dart:78\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":"lib/src/formats/webp/webp_filters.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c9638a36ae80516ad6217c2dcce5b5a4cbea75a6cefc2de99ab2d355ee6f1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/src/formats/exr/exr_image.dart:200-215 | lib/src/formats/exr/exr_image.dart:288-303 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/exr/exr_image.dart:200\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_image.dart"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46d6b31505a992ea02c3eb31b32c3ccdedad575e4f32ff7358da9dd459fe4b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/src/formats/png_decoder.dart:857-872 | lib/src/formats/png_encoder.dart:437-452 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/png_decoder.dart:857\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060prevRow\u0060 to \u0060Uint8List?\u0060 in one and \u0060Uint8List\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_decoder.dart"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"db49a15560eb41ccfc22691c5cce1be2cab4b3ddfc54b2192fdee7a16594ba3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 6): lib/src/color/color_int16.dart:179-193 | lib/src/color/color_int32.dart:179-193 | lib/src/color/color_int8.dart:179-193 | lib/src/color/color_uint16.dart:179-193 | lib/src/color/color_uint32.dart:179-193 | lib/src/color/color_uint8.dart:183-197 \u2014 before extracting anything, compare \u0060lib/src/color/color_int16.dart\u0060 and \u0060lib/src/color/color_int32.dart\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_int16.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5ed0b552b154259a4e1506500c637200bfb9d94fe897c7c08f2ea9acbbe2e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/src/color/color_float32.dart:189-203 | lib/src/color/color_float64.dart:182-196 \u2014 before extracting anything, compare \u0060lib/src/color/color_float32.dart\u0060 and \u0060lib/src/color/color_float64.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_float32.dart"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf1715ad18be8abcd22f189a3c31ddd61de09d5b4084ac3c93cd9daf7aeb146"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/src/formats/exr/exr_wavelet.dart:85-99 | lib/src/formats/exr/exr_wavelet.dart:107-121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/exr/exr_wavelet.dart:85\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_wavelet.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae0f28b7b20658a35f4d4729ebf767b60bfd001c8c950ead1728542051df66b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/src/formats/webp/vp8l_transform.dart:74-88 | lib/src/formats/webp/vp8l_transform.dart:112-126 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/webp/vp8l_transform.dart:74\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l_transform.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7998cda4c779e0ac9f223f6a99e8d30d878bcb704643e4fb648bfa233d88ab97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/src/image/image_data_float32.dart:95-109 | lib/src/image/image_data_float64.dart:95-109 \u2014 before extracting anything, compare \u0060lib/src/image/image_data_float32.dart\u0060 and \u0060lib/src/image/image_data_float64.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_float32.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b93d0435b224da0d2e7a56d700c770c0f2715036c3729396b2b04b7ad50225"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6): lib/src/image/palette_int16.dart:49-62 | lib/src/image/palette_int32.dart:49-62 | lib/src/image/palette_int8.dart:49-62 | lib/src/image/palette_uint16.dart:49-62 | lib/src/image/palette_uint32.dart:49-62 | lib/src/image/palette_uint8.dart:49-62 \u2014 before extracting anything, compare \u0060lib/src/image/palette_int16.dart\u0060 and \u0060lib/src/image/palette_int32.dart\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/palette_int16.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa7a583481c91648ed4b7c3d4a13f5929ccf94202dc687607e0ec070b525bcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/src/image/palette_float32.dart:49-62 | lib/src/image/palette_float64.dart:52-65 \u2014 before extracting anything, compare \u0060lib/src/image/palette_float32.dart\u0060 and \u0060lib/src/image/palette_float64.dart\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/palette_float32.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"72da9695737688578e82835e701e1caad6b261adc39a43415db7626d1b5b501f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/src/image/pixel_float32.dart:243-256 | lib/src/image/pixel_float64.dart:243-256 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_float32.dart\u0060 and \u0060lib/src/image/pixel_float64.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_float32.dart"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9ee4d7f9dc310be97befe4052edd464095c88ad679735ae24ba21b72f9dae4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): lib/src/image/image_data_int16.dart:99-110 | lib/src/image/image_data_int32.dart:99-110 | lib/src/image/image_data_int8.dart:99-110 | lib/src/image/image_data_uint16.dart:107-118 | lib/src/image/image_data_uint32.dart:99-110 | lib/src/image/image_data_uint8.dart:110-121 \u2014 before extracting anything, compare \u0060lib/src/image/image_data_int16.dart\u0060 and \u0060lib/src/image/image_data_int32.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/image/image_data_int16.dart:99\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_int16.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db1b65fbbbc8e1a017224e43f58b6a001f276c125d399f22ba5111830db053a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): lib/src/color/color_uint1.dart:173-184 | lib/src/color/color_uint2.dart:159-170 | lib/src/color/color_uint4.dart:171-182 \u2014 before extracting anything, compare \u0060lib/src/color/color_uint1.dart\u0060 and \u0060lib/src/color/color_uint2.dart\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_uint1.dart"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"1853ee352c45bf47df991814ddba2f85419fe1ef40a8abc2ae447f37ee52b22d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): lib/src/image/pixel_uint1.dart:278-289 | lib/src/image/pixel_uint2.dart:275-286 | lib/src/image/pixel_uint4.dart:277-288 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_uint1.dart\u0060 and \u0060lib/src/image/pixel_uint2.dart\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint1.dart"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3ed9c3d727ba2eaedab073688a4e7aaf1e863f43dd2fe6fd9efe77ac7bc400"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/src/formats/png_decoder.dart:659-670 | lib/src/formats/png_decoder.dart:706-717 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/png_decoder.dart:659\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_decoder.dart"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"7520dd6c5f89a7e812ac1b1c4df90c85bd2520f1c13183fb1c441a2a3840f398"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): lib/src/image/palette_int16.dart:37-47 | lib/src/image/palette_int32.dart:37-47 | lib/src/image/palette_int8.dart:37-47 | lib/src/image/palette_uint16.dart:37-47 | lib/src/image/palette_uint32.dart:37-47 | lib/src/image/palette_uint8.dart:37-47 \u2014 before extracting anything, compare \u0060lib/src/image/palette_int16.dart\u0060 and \u0060lib/src/image/palette_int32.dart\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/palette_int16.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"533cedbd7152bd72e167d384bc66643e0bbd104b7a4dc448151d9d3b90b7cf3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): lib/src/image/pixel_int16.dart:233-243 | lib/src/image/pixel_int32.dart:233-243 | lib/src/image/pixel_int8.dart:233-243 | lib/src/image/pixel_uint16.dart:265-275 | lib/src/image/pixel_uint32.dart:233-243 | lib/src/image/pixel_uint8.dart:264-274 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_int16.dart\u0060 and \u0060lib/src/image/pixel_int32.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_int16.dart"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b2ff8f69b255cb37d8a5ebd964c718d59084444ce93f73c13a71891119b412"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/src/formats/jpeg_encoder.dart:83-93 | lib/src/formats/jpeg_encoder.dart:109-119 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/jpeg_encoder.dart:83\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg_encoder.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"253221d87a00159f0570e38cb7291e2df7fe8b506076f0b4d5401ab52c041867"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): lib/src/formats/tga_decoder.dart:176-185 | lib/src/formats/tga_decoder.dart:191-201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/tga_decoder.dart:191\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tga_decoder.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d833803e8ee9fd83bde75a858b8b4face751141d72aa6ce99eaeae7f2fc8464"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): lib/src/image/palette_float16.dart:40-48 | lib/src/image/palette_float16.dart:52-62 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/palette_float16.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff91bd693195306608d85215727b48ce987be7af1875615a7238b5cd0bc2db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/src/image/palette_float32.dart:37-47 | lib/src/image/palette_float64.dart:40-50 \u2014 before extracting anything, compare \u0060lib/src/image/palette_float32.dart\u0060 and \u0060lib/src/image/palette_float64.dart\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/palette_float32.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90460e457bb6f47bdb3b9dc6ac0f00529a8e92231628177f9c8bf9fb49194fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): lib/src/color/color_int16.dart:168-177 | lib/src/color/color_int32.dart:168-177 | lib/src/color/color_int8.dart:168-177 | lib/src/color/color_uint16.dart:168-177 | lib/src/color/color_uint32.dart:168-177 | lib/src/color/color_uint8.dart:172-181 \u2014 before extracting anything, compare \u0060lib/src/color/color_int16.dart\u0060 and \u0060lib/src/color/color_int32.dart\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_int16.dart"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8958d9d4b3b33ccbf482ed3cb9fa5f3092a68f9ddb8c5bcee96ec3545fe8d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): lib/src/image/image_data_int16.dart:85-94 | lib/src/image/image_data_int32.dart:85-94 | lib/src/image/image_data_uint16.dart:93-102 | lib/src/image/image_data_uint32.dart:85-94 \u2014 before extracting anything, compare \u0060lib/src/image/image_data_int16.dart\u0060 and \u0060lib/src/image/image_data_int32.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_int16.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"933201b01c50112766cf6aa693e81f0aca017d33cfabc96272984f73d41203bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/src/color/color_float32.dart:178-187 | lib/src/color/color_float64.dart:171-180 \u2014 before extracting anything, compare \u0060lib/src/color/color_float32.dart\u0060 and \u0060lib/src/color/color_float64.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_float32.dart"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0fd76fc08515ceb8e814d5a1bc8870db1b433f20de8694cf36fb65c0c0356b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): lib/src/formats/gif_decoder.dart:80-88 | lib/src/formats/gif_decoder.dart:157-166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/gif_decoder.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a1dab937d1d11d0246379ac3504da3727cb9fe247503f35dd7fe7327606ae2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 3): lib/src/formats/pvr_decoder.dart:336-341 | lib/src/formats/pvr_decoder.dart:342-351 | lib/src/formats/pvr_decoder.dart:355-364 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/pvr_decoder.dart:336\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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/src/formats/pvr_decoder.dart:353\u0060 calls \u0060Image\u0060 and \u0060lib/src/formats/pvr_decoder.dart:341\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/pvr_decoder.dart"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d6a375380eaaecbf3810c0c8babf964c104ee62f67300d9075c5c3bf863204"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/src/formats/tiff/tiff_image.dart:509-518 | lib/src/formats/tiff/tiff_image.dart:576-585 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/tiff/tiff_image.dart:509\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d695b50fd81fca7cbcd5ecffbb761b66908299d2b9eaf24f2bc5aa1c998fa04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/src/formats/tiff/tiff_image.dart:519-528 | lib/src/formats/tiff/tiff_image.dart:594-603 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/tiff/tiff_image.dart:519\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca132d39b2aece73dcda34d35d71ff4a281e023e538686343d54412410c7ad8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/src/formats/tiff/tiff_image.dart:529-538 | lib/src/formats/tiff/tiff_image.dart:612-621 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/tiff/tiff_image.dart:529\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63d9c3ccc5fd051fc05bcae8174856997d5ec4cf2b8ba2c3e1ae1138ff882f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/src/formats/webp/vp8l.dart:364-373 | lib/src/formats/webp/vp8l.dart:558-567 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/webp/vp8l.dart:364\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8l.dart"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d161d133324dd899d217628fed6ea99752de701c8008abfa4eb2cc0439fd79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/src/image/image_data_float32.dart:84-93 | lib/src/image/image_data_float64.dart:84-93 \u2014 before extracting anything, compare \u0060lib/src/image/image_data_float32.dart\u0060 and \u0060lib/src/image/image_data_float64.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_float32.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e27217e9c8841c6c05b4059342224f95c45cbd3272aa0905bc7c61bbe747a7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/src/image/image_data_int8.dart:85-94 | lib/src/image/image_data_uint8.dart:96-105 \u2014 before extracting anything, compare \u0060lib/src/image/image_data_int8.dart\u0060 and \u0060lib/src/image/image_data_uint8.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_int8.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52240dacbe273cf82aa824f991609e21e988ad00804e05eb7bea06d80667062"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): lib/src/util/output_buffer.dart:84-96 | lib/src/util/output_buffer.dart:101-117 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/util/output_buffer.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08609760d3f06d5a139669202dfb924bd87ca82c7e94be2acd824a67e5e70fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): lib/src/formats/psd/psd_layer.dart:193-201 | lib/src/formats/psd/psd_layer.dart:220-228 | lib/src/formats/psd/psd_layer.dart:245-253 | lib/src/formats/psd/psd_layer.dart:271-279 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/psd/psd_layer.dart:193\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/psd/psd_layer.dart"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"87903bf68578c45731a070e922386f3d9a2940d880d665cf03901703d58502a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/src/formats/bmp_encoder.dart:243-251 | lib/src/formats/bmp_encoder.dart:252-260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/bmp_encoder.dart:243\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/bmp_encoder.dart"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b87d4a156313aa07f21cf1a89b8a686bd784745072325b875ceb92d7fdcced5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/src/formats/pvr_decoder.dart:109-117 | lib/src/formats/pvr_decoder.dart:142-150 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/pvr_decoder.dart:109\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/src/formats/pvr_decoder.dart:118\u0060 calls \u0060readUint32\u0060 and \u0060lib/src/formats/pvr_decoder.dart:151\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/pvr_decoder.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"60583cb5e3e67d570caed996f36e7cebb04dd931da2a67a074f7d6d76a4e2a57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/src/image/pixel_float16.dart:158-166 | lib/src/image/pixel_float16.dart:175-183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_float16.dart"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c692e787b875e33a37eb9778948c2401867e7db7b8b09f34f3a884ee499e53e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/src/image/pixel_float32.dart:233-241 | lib/src/image/pixel_float64.dart:233-241 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_float32.dart\u0060 and \u0060lib/src/image/pixel_float64.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_float32.dart"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cb40378e24cf57476fe5d677cf5abe0bd07e28f82a9bceffd3f5bcd9d8a823"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/exif/exif_data.dart:70-77 | lib/src/exif/exif_data.dart:81-88 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/exif/exif_data.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"035d49da0f8afc08a49408522961a36136c7fc8ec30603fdc04f0cf58480fb32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/src/formats/exr/exr_pxr24_compressor.dart:80-93 | lib/src/formats/exr/exr_pxr24_compressor.dart:108-121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_pxr24_compressor.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12505123d9d2b3613250fee1980b4bdc29e833d0588f2e9fa120f1d8fbadcd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): lib/src/formats/pvr_encoder.dart:304-322 | lib/src/formats/pvr_encoder.dart:331-349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/pvr_encoder.dart:304\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/pvr_encoder.dart"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7365b3371df99e8af5677ec7adddf944a02c677a3d8093fb05e6cb6ccea57e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/image/pixel_uint8.dart:168-175 | lib/src/image/pixel_uint8.dart:186-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint8.dart"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3283ea078cc27359c6eedf92f48a339730c3270233ea66ae1f800e873a316ddb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/src/formats/tiff/tiff_image.dart:494-500 | lib/src/formats/tiff/tiff_image.dart:558-564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/tiff/tiff_image.dart:494\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"413e8eaa965e9b96076c0dc524c6ba2b89bd44cad55c9dc0ba870b31906db181"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/src/formats/webp/vp8.dart:1221-1227 | lib/src/formats/webp/vp8.dart:1243-1249 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/webp/vp8.dart:1221\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8.dart"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6e320e88162b918d8acfe7b77d08cf7887ad9d822955768dd73594112afd6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 12): lib/src/image/palette_int16.dart:39-44 | lib/src/image/palette_int16.dart:51-56 | lib/src/image/palette_int32.dart:39-44 | lib/src/image/palette_int32.dart:51-56 | lib/src/image/palette_int8.dart:39-44 | lib/src/image/palette_int8.dart:51-56 | lib/src/image/palette_uint16.dart:39-44 | lib/src/image/palette_uint16.dart:51-56 | lib/src/image/palette_uint32.dart:39-44 | lib/src/image/palette_uint32.dart:51-56 | lib/src/image/palette_uint8.dart:39-44 | lib/src/image/palette_uint8.dart:51-56 \u2014 before extracting anything, compare \u0060lib/src/image/palette_int16.dart\u0060 and \u0060lib/src/image/palette_int32.dart\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/image/palette_int16.dart:39\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/src/image/palette_int16.dart:58\u0060 calls \u0060toInt\u0060 and \u0060lib/src/image/palette_int16.dart:45\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/palette_int16.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e236d913d4849c8782f85070610f2eff2e41a07875591262a5ab851e26e4e96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): lib/src/image/palette_float32.dart:39-44 | lib/src/image/palette_float32.dart:51-56 | lib/src/image/palette_float64.dart:42-47 | lib/src/image/palette_float64.dart:54-59 \u2014 before extracting anything, compare \u0060lib/src/image/palette_float32.dart\u0060 and \u0060lib/src/image/palette_float64.dart\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/image/palette_float32.dart:39\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/src/image/palette_float32.dart:58\u0060 calls \u0060toDouble\u0060 and \u0060lib/src/image/palette_float32.dart:45\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/palette_float32.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"974a8d1a85a2654effd4ca79c304cb153d1afed6334bfbdf65a1c41b98ba3616"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/formats/webp/vp8_filter.dart:160-165 | lib/src/formats/webp/vp8_filter.dart:200-205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_filter.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fafab353ad088c74618e0ed34d3ee872378e96caa661965946bbcf1f98f9dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/color/color_uint1.dart:21-25 | lib/src/color/color_uint2.dart:21-25 \u2014 before extracting anything, compare \u0060lib/src/color/color_uint1.dart\u0060 and \u0060lib/src/color/color_uint2.dart\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/color/color_uint1.dart:21\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_uint1.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e7147915794033f0b7496e2b7f95a8a08e25cdfeb9fda40bbe21e5198ee1fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/src/formats/bmp/bmp_info.dart:260-266 | lib/src/formats/bmp/bmp_info.dart:280-286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/bmp/bmp_info.dart"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78a39f5a09acf932b9d0292144bca0bc93a73429a3255480d3b42c8c8adbb97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/formats/tga_decoder.dart:105-109 | lib/src/formats/tga_decoder.dart:171-175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tga_decoder.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"41385fd5f4aa12e8012b2826a0c719632ec4df6fcc299aa69495c5981b16255c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/formats/tga_decoder.dart:217-221 | lib/src/formats/tga_decoder.dart:293-297 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tga_decoder.dart"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad49b0627fd1690258b8aba15539f280010f62bfe3aa78d99f8fc6e7bfffb8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 19): lib/src/color/color_float16.dart:180-186 | lib/src/color/color_float32.dart:170-176 | lib/src/color/color_float64.dart:163-169 | lib/src/color/color_int16.dart:160-166 | lib/src/color/color_int32.dart:160-166 | lib/src/color/color_int8.dart:160-166 | lib/src/color/color_uint16.dart:160-166 | lib/src/color/color_uint32.dart:160-166 | lib/src/color/color_uint8.dart:164-170 | lib/src/image/pixel_float32.dart:225-231 | lib/src/image/pixel_float64.dart:225-231 | lib/src/image/pixel_int16.dart:225-231 | lib/src/image/pixel_int32.dart:225-231 | lib/src/image/pixel_int8.dart:225-231 | lib/src/image/pixel_uint1.dart:270-276 | lib/src/image/pixel_uint16.dart:257-263 | lib/src/image/pixel_uint2.dart:267-273 | lib/src/image/pixel_uint32.dart:225-231 | lib/src/image/pixel_uint4.dart:269-275 \u2014 before extracting anything, compare \u0060lib/src/color/color_float32.dart\u0060 and \u0060lib/src/color/color_float64.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 81 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/src/color/color_float16.dart:190\u0060 calls \u0060doubleToFloat16\u0060, \u0060toDouble\u0060 and \u0060lib/src/image/pixel_uint1.dart:280\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_float16.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"4712d82d0f8404699ebce020daa14e45b735b7e08dc84c46a6d04f583c6a822e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/color/color_float32.dart:65-70 | lib/src/color/color_float64.dart:57-62 \u2014 before extracting anything, compare \u0060lib/src/color/color_float32.dart\u0060 and \u0060lib/src/color/color_float64.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_float32.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8384b5a8c4a034edd61b80399043f7606bfa8e1d56ac222bca128d9adade9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): lib/src/color/color_float32.dart:82-88 | lib/src/color/color_float64.dart:74-80 | lib/src/color/color_int16.dart:72-78 | lib/src/color/color_int32.dart:72-78 | lib/src/color/color_int8.dart:72-78 | lib/src/color/color_uint16.dart:72-78 | lib/src/color/color_uint32.dart:72-78 | lib/src/color/color_uint8.dart:76-82 \u2014 before extracting anything, compare \u0060lib/src/color/color_float32.dart\u0060 and \u0060lib/src/color/color_float64.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_float32.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e95e1c4b2ca66ed30ae05f7cc301a2b6987cd193fdf1d3e257866a70e1f5c44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): lib/src/color/color_float32.dart:89-96 | lib/src/color/color_float32.dart:105-112 | lib/src/color/color_float32.dart:121-128 | lib/src/color/color_float64.dart:81-88 | lib/src/color/color_float64.dart:97-104 | lib/src/color/color_float64.dart:113-120 \u2014 before extracting anything, compare \u0060lib/src/color/color_float32.dart\u0060 and \u0060lib/src/color/color_float64.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_float32.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d62c5dfb85117a2c32bc13bc2c257a6d18cee16e344abd70f226cb4afa44142"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): lib/src/color/color_float32.dart:98-104 | lib/src/color/color_float64.dart:90-96 | lib/src/color/color_int16.dart:88-94 | lib/src/color/color_int32.dart:88-94 | lib/src/color/color_int8.dart:88-94 | lib/src/color/color_uint16.dart:88-94 | lib/src/color/color_uint32.dart:88-94 | lib/src/color/color_uint8.dart:92-98 \u2014 before extracting anything, compare \u0060lib/src/color/color_float32.dart\u0060 and \u0060lib/src/color/color_float64.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_float32.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36006086c4939cd4de981919f4ec1fa85c5f3cbcc178b3c20997cba2dfba051"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): lib/src/color/color_float32.dart:114-120 | lib/src/color/color_float64.dart:106-112 | lib/src/color/color_int16.dart:104-110 | lib/src/color/color_int32.dart:104-110 | lib/src/color/color_int8.dart:104-110 | lib/src/color/color_uint16.dart:104-110 | lib/src/color/color_uint32.dart:104-110 | lib/src/color/color_uint8.dart:108-114 \u2014 before extracting anything, compare \u0060lib/src/color/color_float32.dart\u0060 and \u0060lib/src/color/color_float64.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_float32.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a76bda976157655083048a87bd85c47bf38fc494915b5a0a13bdfef04a6216"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8): lib/src/color/color_float32.dart:156-164 | lib/src/color/color_float64.dart:149-157 | lib/src/color/color_int16.dart:146-154 | lib/src/color/color_int32.dart:146-154 | lib/src/color/color_int8.dart:146-154 | lib/src/color/color_uint16.dart:146-154 | lib/src/color/color_uint32.dart:146-154 | lib/src/color/color_uint8.dart:150-158 \u2014 before extracting anything, compare \u0060lib/src/color/color_float32.dart\u0060 and \u0060lib/src/color/color_float64.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_float32.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3931818776ac15aa672bdc04b9a3935ed874685b2cec741cbc657d4b0613ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): lib/src/color/color_int16.dart:55-60 | lib/src/color/color_int32.dart:55-60 | lib/src/color/color_int8.dart:55-60 | lib/src/color/color_uint16.dart:55-60 | lib/src/color/color_uint32.dart:55-60 | lib/src/color/color_uint8.dart:55-60 \u2014 before extracting anything, compare \u0060lib/src/color/color_int16.dart\u0060 and \u0060lib/src/color/color_int32.dart\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_int16.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6151e09b69f6a753ee98e881b4b8d9ec94e4361640672419d0f474d93c4754"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 18): lib/src/color/color_int16.dart:79-86 | lib/src/color/color_int16.dart:95-102 | lib/src/color/color_int16.dart:111-118 | lib/src/color/color_int32.dart:79-86 | lib/src/color/color_int32.dart:95-102 | lib/src/color/color_int32.dart:111-118 | lib/src/color/color_int8.dart:79-86 | lib/src/color/color_int8.dart:95-102 | lib/src/color/color_int8.dart:111-118 | lib/src/color/color_uint16.dart:79-86 | lib/src/color/color_uint16.dart:95-102 | lib/src/color/color_uint16.dart:111-118 | lib/src/color/color_uint32.dart:79-86 | lib/src/color/color_uint32.dart:95-102 | lib/src/color/color_uint32.dart:111-118 | lib/src/color/color_uint8.dart:83-90 | lib/src/color/color_uint8.dart:99-106 | lib/src/color/color_uint8.dart:115-122 \u2014 before extracting anything, compare \u0060lib/src/color/color_int16.dart\u0060 and \u0060lib/src/color/color_int32.dart\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_int16.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad7710e7764973f6451408d67e7cec8a45b71970a34c31391658e973b1aecfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): lib/src/color/color_uint1.dart:146-152 | lib/src/color/color_uint2.dart:132-138 | lib/src/color/color_uint4.dart:144-150 \u2014 before extracting anything, compare \u0060lib/src/color/color_uint1.dart\u0060 and \u0060lib/src/color/color_uint2.dart\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_uint1.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"83443925f7a1e124c472b303b4b676a89b67c120368468d5ebf49c6698c25bcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): lib/src/color/color_uint1.dart:163-171 | lib/src/color/color_uint2.dart:149-157 | lib/src/color/color_uint4.dart:161-169 \u2014 before extracting anything, compare \u0060lib/src/color/color_uint1.dart\u0060 and \u0060lib/src/color/color_uint2.dart\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_uint1.dart"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3833fc03926bff4b8b98516a07fcf0abf6c0e054cd1d3e82a7c67cd7c70f6d5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): lib/src/formats/exr/exr_b44_compressor.dart:25-29 | lib/src/formats/exr/exr_piz_compressor.dart:37-41 | lib/src/formats/exr/exr_pxr24_compressor.dart:29-33 | lib/src/formats/exr/exr_rle_compressor.dart:25-29 | lib/src/formats/exr/exr_zip_compressor.dart:31-35 \u2014 before extracting anything, compare \u0060lib/src/formats/exr/exr_rle_compressor.dart\u0060 and \u0060lib/src/formats/exr/exr_zip_compressor.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_b44_compressor.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd92a0b881a1bad3b35c12972b85a3ff0475be41fdaf3d66fe618c4628d9ac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): lib/src/formats/exr_decoder.dart:63-69 | lib/src/formats/pnm_decoder.dart:67-72 | lib/src/formats/pvr_decoder.dart:244-249 | lib/src/formats/tga_decoder.dart:43-49 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr_decoder.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"737466ec53777831425d7db594b18bc73512369e7c6ac3622b89e49fb7b43929"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/image/image_data_float32.dart:78-82 | lib/src/image/image_data_float64.dart:78-82 \u2014 before extracting anything, compare \u0060lib/src/image/image_data_float32.dart\u0060 and \u0060lib/src/image/image_data_float64.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_float32.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1d3ff7d3f4b024d5c0716fd945c152ba1d263d2894c67d8056707983ded2d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): lib/src/image/image_data_int16.dart:79-83 | lib/src/image/image_data_int32.dart:79-83 | lib/src/image/image_data_uint16.dart:87-91 | lib/src/image/image_data_uint32.dart:79-83 \u2014 before extracting anything, compare \u0060lib/src/image/image_data_int16.dart\u0060 and \u0060lib/src/image/image_data_int32.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_int16.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8b400920608724ded329c430e87da2c9e0954f513c5876c8a908c2272524bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/image/image_data_int8.dart:79-83 | lib/src/image/image_data_uint8.dart:90-94 \u2014 before extracting anything, compare \u0060lib/src/image/image_data_int8.dart\u0060 and \u0060lib/src/image/image_data_uint8.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_int8.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"20789a51a75c6fd6e8b38a73c1f514bf36697ca6b12938f6b83e872ca087da4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/src/image/palette_float32.dart:29-35 | lib/src/image/palette_float64.dart:32-38 \u2014 before extracting anything, compare \u0060lib/src/image/palette_float32.dart\u0060 and \u0060lib/src/image/palette_float64.dart\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/palette_float32.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c559eefddd522e437b2807602830759654a911ea9d40a4df4a48bec0eae62cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): lib/src/image/palette_float32.dart:74-81 | lib/src/image/palette_float64.dart:77-84 | lib/src/image/palette_int16.dart:74-81 | lib/src/image/palette_int32.dart:74-81 | lib/src/image/palette_int8.dart:74-81 | lib/src/image/palette_uint16.dart:74-81 | lib/src/image/palette_uint32.dart:74-81 \u2014 before extracting anything, compare \u0060lib/src/image/palette_float32.dart\u0060 and \u0060lib/src/image/palette_float64.dart\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/palette_float32.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"47051634fc28d02cb4b608e0c33c9a393b2116fc6adde7158015cb42603209e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): lib/src/image/palette_float32.dart:83-90 | lib/src/image/palette_float64.dart:86-93 | lib/src/image/palette_int16.dart:83-90 | lib/src/image/palette_int32.dart:83-90 | lib/src/image/palette_int8.dart:83-90 | lib/src/image/palette_uint16.dart:83-90 | lib/src/image/palette_uint32.dart:83-90 \u2014 before extracting anything, compare \u0060lib/src/image/palette_float32.dart\u0060 and \u0060lib/src/image/palette_float64.dart\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/palette_float32.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeba54fd11548e5bc495b8d71cb2af870f01381e6c61eb8d162f9443d5129167"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7): lib/src/image/palette_float32.dart:92-101 | lib/src/image/palette_float64.dart:95-104 | lib/src/image/palette_int16.dart:92-101 | lib/src/image/palette_int32.dart:92-101 | lib/src/image/palette_int8.dart:92-101 | lib/src/image/palette_uint16.dart:92-101 | lib/src/image/palette_uint32.dart:92-101 \u2014 before extracting anything, compare \u0060lib/src/image/palette_float32.dart\u0060 and \u0060lib/src/image/palette_float64.dart\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/palette_float32.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4feea98e6e4cb63f4f099a4f6c4ea6aec46149328dfd240cc44b2acb5907f5e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): lib/src/image/palette_int16.dart:29-35 | lib/src/image/palette_int32.dart:29-35 | lib/src/image/palette_int8.dart:29-35 | lib/src/image/palette_uint16.dart:29-35 | lib/src/image/palette_uint32.dart:29-35 | lib/src/image/palette_uint8.dart:29-35 \u2014 before extracting anything, compare \u0060lib/src/image/palette_int16.dart\u0060 and \u0060lib/src/image/palette_int32.dart\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/palette_int16.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9be9d21b23490c178d3285174b980383e26248f76878a323d6499f3e872c24d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): lib/src/image/pixel_float16.dart:99-104 | lib/src/image/pixel_float32.dart:87-92 | lib/src/image/pixel_float64.dart:87-92 | lib/src/image/pixel_int32.dart:87-92 | lib/src/image/pixel_int8.dart:87-92 | lib/src/image/pixel_uint16.dart:97-102 | lib/src/image/pixel_uint32.dart:87-92 | lib/src/image/pixel_uint8.dart:98-103 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_float16.dart\u0060 and \u0060lib/src/image/pixel_float32.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_float16.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9114fd752bae52c801bc2ebff2d97f28353a30a953d2346798a192ffd3295d9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 7): lib/src/image/pixel_float16.dart:109-121 | lib/src/image/pixel_float32.dart:97-109 | lib/src/image/pixel_float64.dart:97-109 | lib/src/image/pixel_int16.dart:97-109 | lib/src/image/pixel_int32.dart:97-109 | lib/src/image/pixel_int8.dart:97-109 | lib/src/image/pixel_uint32.dart:97-109 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_float16.dart\u0060 and \u0060lib/src/image/pixel_float32.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/src/image/pixel_float32.dart:111\u0060 calls \u0060nextPixel\u0060, \u0060moveNext\u0060 and \u0060lib/src/image/pixel_float64.dart:111\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_float16.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"df15752a02d80071d9f417c33b3a606a4fd1652bf15f3177b050390b09708b43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/image/pixel_float32.dart:116-121 | lib/src/image/pixel_float64.dart:114-119 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_float32.dart\u0060 and \u0060lib/src/image/pixel_float64.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 109 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/src/image/pixel_float32.dart:111\u0060 calls \u0060nextPixel\u0060, \u0060moveNext\u0060 and \u0060lib/src/image/pixel_float64.dart:109\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_float32.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49b0fb4d881614e694ba4b8f40ae71cd4b6d23b35b0a4b6415278956a3c5836"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): lib/src/image/pixel_float32.dart:143-150 | lib/src/image/pixel_float32.dart:159-166 | lib/src/image/pixel_float64.dart:143-150 | lib/src/image/pixel_float64.dart:159-166 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_float32.dart\u0060 and \u0060lib/src/image/pixel_float64.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_float32.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"336662aff576a29f972692cd3a29da3b26b27d8a09ea908ccf1580ac8d1cf762"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/image/pixel_float32.dart:175-182 | lib/src/image/pixel_float64.dart:175-182 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_float32.dart\u0060 and \u0060lib/src/image/pixel_float64.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_float32.dart"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"32643a388abf5d13e822b0711fec4022daff9dcd94483679ef1f1b3891cc7f08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): lib/src/image/pixel_float32.dart:210-219 | lib/src/image/pixel_float64.dart:210-219 | lib/src/image/pixel_int16.dart:210-219 | lib/src/image/pixel_int32.dart:210-219 | lib/src/image/pixel_int8.dart:210-219 | lib/src/image/pixel_uint32.dart:210-219 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_float32.dart\u0060 and \u0060lib/src/image/pixel_float64.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_float32.dart"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48d0ba293fb47c01454fafd511796efc40807b12f096c1961339955d2b59e0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): lib/src/image/pixel_float64.dart:168-173 | lib/src/image/pixel_int16.dart:168-173 | lib/src/image/pixel_int32.dart:168-173 | lib/src/image/pixel_int8.dart:168-173 | lib/src/image/pixel_uint32.dart:168-173 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_float64.dart\u0060 and \u0060lib/src/image/pixel_int16.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_float64.dart"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda7f6608fbdaa679679e64d61cd9617bd0864db1b047bca7d1fe5514aff7106"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): lib/src/image/pixel_int16.dart:114-119 | lib/src/image/pixel_int32.dart:114-119 | lib/src/image/pixel_int8.dart:114-119 | lib/src/image/pixel_uint16.dart:130-135 | lib/src/image/pixel_uint32.dart:114-119 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_int16.dart\u0060 and \u0060lib/src/image/pixel_int32.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_int16.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"4718e8b35c51c881b7e9768c58bc4f78db5fe68406c99bc0fe903c27d1b7107a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): lib/src/image/pixel_int16.dart:143-150 | lib/src/image/pixel_int16.dart:159-166 | lib/src/image/pixel_int32.dart:143-150 | lib/src/image/pixel_int32.dart:159-166 | lib/src/image/pixel_int8.dart:143-150 | lib/src/image/pixel_int8.dart:159-166 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_int16.dart\u0060 and \u0060lib/src/image/pixel_int32.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_int16.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fe3f65185b47407f4911a421eb3d47bb4b86986a9b7b977541f7e3077454f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): lib/src/image/pixel_int16.dart:175-182 | lib/src/image/pixel_int32.dart:175-182 | lib/src/image/pixel_int8.dart:175-182 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_int16.dart\u0060 and \u0060lib/src/image/pixel_int32.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_int16.dart"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25e99adce1d0205a59bb2199192528f63bbbfc6fc044aaa54f2efc306cecfd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): lib/src/image/pixel_uint1.dart:164-168 | lib/src/image/pixel_uint2.dart:161-165 | lib/src/image/pixel_uint4.dart:164-168 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_uint1.dart\u0060 and \u0060lib/src/image/pixel_uint2.dart\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint1.dart"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89f23b0e74a512b219f9b83282cd7c3e9b87e505f5f3541b81e65a12a8be4fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): lib/src/image/pixel_uint1.dart:216-225 | lib/src/image/pixel_uint2.dart:213-222 | lib/src/image/pixel_uint4.dart:215-224 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_uint1.dart\u0060 and \u0060lib/src/image/pixel_uint2.dart\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint1.dart"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe2d69a7402b0882560ea84c71466490e5abdd4693d9c19ca319e92f6ea4580"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): lib/src/image/pixel_uint1.dart:255-264 | lib/src/image/pixel_uint2.dart:252-261 | lib/src/image/pixel_uint4.dart:254-263 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_uint1.dart\u0060 and \u0060lib/src/image/pixel_uint2.dart\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint1.dart"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"130956a3f44c56985af85d15def6a866ef356255dfa827f81411630399deff7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/src/image/pixel_uint16.dart:107-119 | lib/src/image/pixel_uint8.dart:108-120 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_uint16.dart\u0060 and \u0060lib/src/image/pixel_uint8.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/src/image/pixel_uint8.dart:122\u0060 calls \u0060updateCache\u0060 and \u0060lib/src/image/pixel_uint16.dart:121\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint16.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"646cdbcac043b0ace8604134e7f1eac44dcebeff7763c032daedc8a936e1289e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/image/pixel_uint16.dart:121-125 | lib/src/image/pixel_uint8.dart:124-128 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_uint16.dart\u0060 and \u0060lib/src/image/pixel_uint8.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/src/image/pixel_uint8.dart:122\u0060 calls \u0060updateCache\u0060 and \u0060lib/src/image/pixel_uint16.dart:119\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint16.dart"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2a14b6c9ecff874b46702c56c7817f938df90b60f6ccca5c8d3a125e3fe1c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/image/pixel_uint16.dart:145-150 | lib/src/image/pixel_uint8.dart:145-150 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_uint16.dart\u0060 and \u0060lib/src/image/pixel_uint8.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint16.dart"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed8c8d5539d028d3ad87c8435dbd436a4f143526400aaa5a95954a4581b6462"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/image/pixel_uint16.dart:159-166 | lib/src/image/pixel_uint8.dart:159-166 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_uint16.dart\u0060 and \u0060lib/src/image/pixel_uint8.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint16.dart"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae41f3b69d49033e13a83f5ffec0eedb673f09d45c734073b3cc995cc3500aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/image/pixel_uint16.dart:177-184 | lib/src/image/pixel_uint8.dart:177-184 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_uint16.dart\u0060 and \u0060lib/src/image/pixel_uint8.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint16.dart"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c687f330367343ef3e8d29ca51c9ef8595e937f7d8b0b75c17d23b0d412ea4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/image/pixel_uint16.dart:244-251 | lib/src/image/pixel_uint8.dart:239-246 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_uint16.dart\u0060 and \u0060lib/src/image/pixel_uint8.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 110 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint16.dart"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4e9d41a14a8eebce0a6290aabae15392042d46e877a23ce3b2e2e70f1394fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/src/image/pixel_uint2.dart:151-159 | lib/src/image/pixel_uint4.dart:154-162 \u2014 before extracting anything, compare \u0060lib/src/image/pixel_uint2.dart\u0060 and \u0060lib/src/image/pixel_uint4.dart\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 95 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint2.dart"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e9872cb748d2adb4f4ebd7f1bc77203d7474c84ab3ed922086a4cdb25d0e42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/color/color_float32.dart:22-26 | lib/src/color/color_float64.dart:22-26 \u2014 before extracting anything, compare \u0060lib/src/color/color_float32.dart\u0060 and \u0060lib/src/color/color_float64.dart\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_float32.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b593383197423957c16092b7644ae56572dfb667dc3b89f1770a52e4f09dad6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): lib/src/color/color_int16.dart:20-24 | lib/src/color/color_int32.dart:20-24 | lib/src/color/color_int8.dart:20-24 | lib/src/color/color_uint16.dart:20-24 | lib/src/color/color_uint32.dart:20-24 | lib/src/color/color_uint8.dart:20-24 \u2014 before extracting anything, compare \u0060lib/src/color/color_int16.dart\u0060 and \u0060lib/src/color/color_int32.dart\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_int16.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9a84f53042263ade23ef5ea324067841d4ae4409a6bf9bfe9401433c4144ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): lib/src/color/color_int16.dart:26-31 | lib/src/color/color_int32.dart:26-31 | lib/src/color/color_int8.dart:26-31 | lib/src/color/color_uint16.dart:26-31 | lib/src/color/color_uint32.dart:26-31 | lib/src/color/color_uint8.dart:26-31 \u2014 before extracting anything, compare \u0060lib/src/color/color_int16.dart\u0060 and \u0060lib/src/color/color_int32.dart\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_int16.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"420d200197ef94184a52a47ec75e396f731095165266c1d3a25810c0eff8c7f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/color/color_uint1.dart:27-31 | lib/src/color/color_uint2.dart:27-31 \u2014 before extracting anything, compare \u0060lib/src/color/color_uint1.dart\u0060 and \u0060lib/src/color/color_uint2.dart\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_uint1.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f568ede4a1988f35101b87cbfc8d711d990c8a5945fb74ab520b08b7375b2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/color/color_uint1.dart:33-37 | lib/src/color/color_uint2.dart:33-37 \u2014 before extracting anything, compare \u0060lib/src/color/color_uint1.dart\u0060 and \u0060lib/src/color/color_uint2.dart\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_uint1.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb10ec94c7baccc65a5d81a51684b460141e7478d0d5d58c24df8618e231910b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/command/transform/copy_flip_cmd.dart:10-15 | lib/src/command/transform/flip_cmd.dart:9-14 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/transform/copy_flip_cmd.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"065565b39831618f0b8d36645c29d92e5762011cfae84f85f239272bea87e971"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 12): lib/src/image/image_data_float16.dart:70-77 | lib/src/image/image_data_float32.dart:69-76 | lib/src/image/image_data_float64.dart:69-76 | lib/src/image/image_data_int16.dart:70-77 | lib/src/image/image_data_int32.dart:70-77 | lib/src/image/image_data_int8.dart:70-77 | lib/src/image/image_data_uint1.dart:84-91 | lib/src/image/image_data_uint16.dart:78-85 | lib/src/image/image_data_uint2.dart:84-91 | lib/src/image/image_data_uint32.dart:70-77 | lib/src/image/image_data_uint4.dart:90-97 | lib/src/image/image_data_uint8.dart:81-88 \u2014 before extracting anything, compare \u0060lib/src/image/image_data_float32.dart\u0060 and \u0060lib/src/image/image_data_float64.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_float16.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31e0fab45433456314545f794e082b77277c10829c44f8b858ec3163c848d88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): lib/src/image/image_data_uint1.dart:27-31 | lib/src/image/image_data_uint2.dart:27-31 | lib/src/image/image_data_uint4.dart:33-37 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_uint1.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc506777a3a1ebfaee63259bb9c14e9c71cfe1185ffefe398c3f708b1e3cb62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): lib/src/image/image_data_uint1.dart:95-103 | lib/src/image/image_data_uint2.dart:95-103 | lib/src/image/image_data_uint4.dart:101-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 all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_uint1.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"062269d333769a072557b840ba8b6ce7f30df51f62cf260812205c62d9be5a7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/formats/pvr_decoder.dart:580-584 | lib/src/formats/pvr_decoder.dart:644-648 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/pvr_decoder.dart"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bb2820dae29f9a68ca69a4847dfd831e203d75d63a7768c77443b0927a5658"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/formats/webp/vp8_filter.dart:102-107 | lib/src/formats/webp/vp8_filter.dart:115-120 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/formats/webp/vp8_filter.dart:102\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":"lib/src/formats/webp/vp8_filter.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"055575fb743b4286448489455e4218ce5b05239434880cdc758820032bcd8cfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): lib/src/formats/webp/vp8_filter.dart:407-413 | lib/src/formats/webp/vp8_filter.dart:448-454 | lib/src/formats/webp/vp8_filter.dart:511-517 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_filter.dart"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea8748df02a86f9f3abfd4c23d200ba9ab67da729455e4927034075237991bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/formats/webp/vp8_filter.dart:458-463 | lib/src/formats/webp/vp8_filter.dart:521-526 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8_filter.dart"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3089a75bdc14a46e44fc5fe1a18133075125761b8e97bf8d1ec5aeeb2179e50"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Command (LCOM4 111): Command\u0027s methods fall into 111 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 111 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/command.dart"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1c0f0db2e3a2970ce6c9234fd66085afd6784351e93714b6de3eb8c5382f42"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ConstColorUint8 (LCOM4 39): ConstColorUint8\u0027s methods fall into 39 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 39 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/const_color_uint8.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f6654f1ee6300f237ee2c6c8caf2008b2054bcea9e60fab2608fd17c06db28"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ColorFloat16 (LCOM4 24): ColorFloat16\u0027s methods fall into 24 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 24 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_float16.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a97ca852b84710ea62ffec487587c70f82c08fe2a1eb31b94359f030cacffc9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ColorFloat32 (LCOM4 24): ColorFloat32\u0027s methods fall into 24 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 24 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_float32.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac233d20adc29b9a39b4144e941e3db92873a0c0a1b1f838466c1c4910c2ea6a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ColorFloat64 (LCOM4 24): ColorFloat64\u0027s methods fall into 24 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 24 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_float64.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"43fad67acb02b10e8fd3dfb5e6e6481ec376ed8b23c445949bbffe59f63678da"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ColorInt16 (LCOM4 24): ColorInt16\u0027s methods fall into 24 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 24 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_int16.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1ece03ec52b843a8704fc049e820e714adf16c47a2d1ef741a80fd077352da"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ColorInt32 (LCOM4 24): ColorInt32\u0027s methods fall into 24 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 24 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_int32.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a9e80314293c438bec815aa5f4c4b3885a571b5726735f8adf0ae1203849c3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ColorInt8 (LCOM4 24): ColorInt8\u0027s methods fall into 24 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 24 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_int8.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c596a376725ff5349facf14808d0182c5078a4641e38fec1d89543c2aec40a2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ColorUint16 (LCOM4 24): ColorUint16\u0027s methods fall into 24 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 24 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_uint16.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ade09dce76ddb7aed2b187c32e8af6c22d31367ba0378f85fde87bb78556537"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ColorUint32 (LCOM4 24): ColorUint32\u0027s methods fall into 24 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 24 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_uint32.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f93c0aa12ce6ccd58ac63c56a41b5b98f6421c359bc6e65fa07828dbb50de3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ColorUint8 (LCOM4 24): ColorUint8\u0027s methods fall into 24 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 24 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_uint8.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c722e80a3d830711f8db7479d619757404685008bc54593f26d29f14b6aa9c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ColorUint1 (LCOM4 22): ColorUint1\u0027s methods fall into 22 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 22 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_uint1.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"158508e871be8d4550893dd16cf74222e48dd6008e02a42c2d1038d9aaeef9f6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ColorUint2 (LCOM4 22): ColorUint2\u0027s methods fall into 22 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 22 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_uint2.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"09dbbd48901d568110c49f2ce7804c28852e05ba8ddfdcf8d433e9ec7dde1771"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ColorUint4 (LCOM4 22): ColorUint4\u0027s methods fall into 22 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 22 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_uint4.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43bfd3b19c4d4c7b3a88320086085e2bfa8544fa86fe783fe2a1ca836de61fe"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PixelUint32 (LCOM4 22): PixelUint32\u0027s methods fall into 22 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 22 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint32.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b997a285c78506140384dcff26d74ee4098681787d912b473ccf0e13b17484b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PixelFloat16 (LCOM4 21): PixelFloat16\u0027s methods fall into 21 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 21 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_float16.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bedebe1ef3e3ba1f8b053efb18e80f1b2b8b48495dde78f7cc12e819678850"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PixelFloat32 (LCOM4 21): PixelFloat32\u0027s methods fall into 21 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 21 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_float32.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81128c4a5e6dc6dd2e27b25888842a91df7bd966856dc089da9df9131049730"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PixelFloat64 (LCOM4 21): PixelFloat64\u0027s methods fall into 21 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 21 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_float64.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f45680e03334f077ae9583f9f4c3ed77ec41865427faafa0c5663d312d5ce79"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PixelInt16 (LCOM4 21): PixelInt16\u0027s methods fall into 21 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 21 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_int16.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"024aa1cecb6c9186957b25a7804fff43f00f91ccd78a830e8a9b1a1715819f0c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PixelInt32 (LCOM4 21): PixelInt32\u0027s methods fall into 21 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 21 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_int32.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acb80febf8a69f3abdb00ed3bcbdb0c2b25db2d13db3f95837abc88e297fe74"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PixelInt8 (LCOM4 21): PixelInt8\u0027s methods fall into 21 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 21 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_int8.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b190b937e7991ee896bc67f0967acf8abada6dc1fd98fe3eec0e72d7038256a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PixelUint16 (LCOM4 19): PixelUint16\u0027s methods fall into 19 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 19 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint16.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0139b79f0f28e89d749dbc97b3b448e3158182a4107abe261b63006456a0141"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PixelUint1 (LCOM4 18): PixelUint1\u0027s methods fall into 18 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 18 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint1.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0b7e5fd163bc55ecc08d959ec593758ceafb7be9ca119047bd9ac32fe4defa"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PixelUint2 (LCOM4 18): PixelUint2\u0027s methods fall into 18 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 18 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint2.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3887542b9ccd52870361a3cb9cbc9cb52f5bbdab569ee8e37b5b63022e9176c8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PixelUint4 (LCOM4 18): PixelUint4\u0027s methods fall into 18 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 18 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint4.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfbe5e7c2adc91fbc3e5e9873a8d9f5b573bfb76cf08d6c43090ede85557f00"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PixelUint8 (LCOM4 17): PixelUint8\u0027s methods fall into 17 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 17 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint8.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b543e8e294c3aad778c4b68261b45e647f22caa61b90a2dc0f94bd0050e931b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImageDataFloat16 (LCOM4 15): ImageDataFloat16\u0027s methods fall into 15 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 15 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_float16.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba290dc610406c4f485ea67d61ae28b44d06f8d3223883a61b6d442f8834b138"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImageDataFloat64 (LCOM4 15): ImageDataFloat64\u0027s methods fall into 15 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 15 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_float64.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d928f28de1f39884a720317d161baf91b9f277d5b13d318f9841eaaa5ac9a82"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImageDataInt16 (LCOM4 15): ImageDataInt16\u0027s methods fall into 15 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 15 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_int16.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"143ced36a221fcde137fcbe5b096ee6e092c8b14a9781bcb561818a3869a1a4e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImageDataInt32 (LCOM4 15): ImageDataInt32\u0027s methods fall into 15 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 15 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_int32.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc7c84df8b98efe41d566625a4eb53603187058a1967a48f0a2c35fb3bec827"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImageDataInt8 (LCOM4 15): ImageDataInt8\u0027s methods fall into 15 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 15 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_int8.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"215c14b158e4b837f8df3b6dc60b2ff5392c77df9dcc1d143f749e865ddc89ae"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImageDataUint1 (LCOM4 15): ImageDataUint1\u0027s methods fall into 15 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 15 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_uint1.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"de52d22995245db30a0db3ea259b4ec9571553145335d5f2b5f2051a4e7f41c9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImageDataUint16 (LCOM4 15): ImageDataUint16\u0027s methods fall into 15 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 15 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_uint16.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bae8afc1127eab295d4a2ca87ca59e435d1deee46517071bc7226aef023f038"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImageDataUint2 (LCOM4 15): ImageDataUint2\u0027s methods fall into 15 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 15 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_uint2.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d459342c3418b4de02e288e463e532dffcbaa8d6c73c1b277931b09923ed8c4c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImageDataUint32 (LCOM4 15): ImageDataUint32\u0027s methods fall into 15 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 15 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_uint32.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1127eed8bbfa17040b440383fdfac783fa266e8c1b7a7239d8a3bbb9bcff1253"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImageDataUint4 (LCOM4 15): ImageDataUint4\u0027s methods fall into 15 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 15 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_uint4.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e3dc335928ddba2de034a113d04e5cc2e0f4c815e2888a5400b89f41eccb46"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImageDataFloat32 (LCOM4 14): ImageDataFloat32\u0027s methods fall into 14 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 14 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_float32.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1e833abbad246206f801a40ad1799e59ec9522e5c92e89c023226f01401a97"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImageDataUint8 (LCOM4 14): ImageDataUint8\u0027s methods fall into 14 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 14 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data_uint8.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5f10cb5ce0963852144068cabc224c8b5100d3373862974296b5681874500f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PvrPacket (LCOM4 9): PvrPacket\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/pvr/pvr_packet.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6956c7f3b26d952608d0b52ab72052455d6e2013dc1ef6f6a7e632c28caeea36"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: OctreeQuantizer (LCOM4 5): OctreeQuantizer\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/util/octree_quantizer.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"74636dd8580bfbd928b9a381a5780ffc0c3591eff5fb7e1f37350e4ba5bee18d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ExifData (LCOM4 4): ExifData\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":"lib/src/exif/exif_data.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e47b897eca73446e5c393b2ee923e5e104fb01d7b8574b4b2d277ffa484c5b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: IfdValueUndefined (LCOM4 4): IfdValueUndefined\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":"lib/src/exif/ifd_value.dart"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a56de7c8691cabd07534a2ca621939f84d97a0e551c7ee5328697a1ce7cdc3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BmpInfo (LCOM4 4): BmpInfo\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":"lib/src/formats/bmp/bmp_info.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79ec9bc3e9b1d74c3f431f5ab98a78ab2d215980f82b097e2104806bab5ef2b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: InternalExrB44Compressor (LCOM4 4): InternalExrB44Compressor\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":"lib/src/formats/exr/exr_b44_compressor.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce43dda9e8bf375cc152897abc83fcd896ee328521d67e79acace7de1c0dd10e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: InternalExrRleCompressor (LCOM4 4): InternalExrRleCompressor\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":"lib/src/formats/exr/exr_rle_compressor.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b4d0e92ec3f2ebb78aa2b60cc98f5a1a68354e120c439101bd33dd174a7d24"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Image (LCOM4 4): Image\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":"lib/src/image/image.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2720166d7fbe4ae9d254c3c9e019491228c344c0795e0ddd06bb681b5d69496"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PaletteFloat16 (LCOM4 4): PaletteFloat16\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":"lib/src/image/palette_float16.dart"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f98d2b2895ad77f25c2d1eafdf8a8d7574a38536110f20328771e9d795bf18"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PaletteFloat32 (LCOM4 4): PaletteFloat32\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":"lib/src/image/palette_float32.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f675abe18048c86f054ca370fd58c023a42b389c050113c31bc76e2d0d8a82ba"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PaletteFloat64 (LCOM4 4): PaletteFloat64\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":"lib/src/image/palette_float64.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"44276aea77610b39bae2d0fc7f35b3f0c57e51389d919f7eb01996a570b1e772"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PaletteInt16 (LCOM4 4): PaletteInt16\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":"lib/src/image/palette_int16.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33b7a699b9c56ad474e8282eafc2e262f6e0c8192ff54ab7993851c67c76303"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PaletteInt32 (LCOM4 4): PaletteInt32\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":"lib/src/image/palette_int32.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eddf6039ef82d568f4d0ee61517a0a4d8b1e82a08982facc0a5c362469564c9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PaletteInt8 (LCOM4 4): PaletteInt8\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":"lib/src/image/palette_int8.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4f11784c8e30ef373525d617213e7b542da57bb917c6dd751ade79cef546ff"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PaletteUint16 (LCOM4 4): PaletteUint16\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":"lib/src/image/palette_uint16.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abd1d3deb28fb3955b5ba9be7c73ac62dbef161747e14087d3c98e1e011e090"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PaletteUint32 (LCOM4 4): PaletteUint32\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":"lib/src/image/palette_uint32.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6b0e011e44e213b414a809b0ad88f98ae356dbaa67e9947578434f54fef4a7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PaletteUint8 (LCOM4 4): PaletteUint8\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":"lib/src/image/palette_uint8.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc90db0818a02775cce6d675ceafb43efe3524afb48d47f886d5c259776b032b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/formats/jpeg/jpeg_data.dart: lib/src/formats/jpeg/jpeg_data.dart changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in JpegData._read at line 216. 2 of those changes were fix/bug commits, and the other 14 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:54:33 -07:00\u0027 --until=\u00272026-11-14 10:54:33 -07:00\u0027 --full-history --no-merges -- lib/src/formats/jpeg/jpeg_data.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/jpeg_data.dart"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d943c733d543f43f65fbdb8d24d77895ccf0430bc9f13ae42c414c50cfcee14"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/formats/png_decoder.dart: lib/src/formats/png_decoder.dart changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in PngDecoder._startDecode at line 66. 6 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:54:33 -07:00\u0027 --until=\u00272026-11-14 10:54:33 -07:00\u0027 --full-history --no-merges -- lib/src/formats/png_decoder.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_decoder.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccff2af5a5b6309a19c35a8cf8137f72f78fe09951bb9ccc3d00fa43658bdbc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/formats/tiff/tiff_image.dart: lib/src/formats/tiff/tiff_image.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 106 in TiffImage._decodeTile at line 335. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:54:33 -07:00\u0027 --until=\u00272026-11-14 10:54:33 -07:00\u0027 --full-history --no-merges -- lib/src/formats/tiff/tiff_image.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb9c7dd232f1ad339c2307bdbf19b4a70c4aa9f66a8f9cb3e4b8e568a6227c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/image/image.dart: lib/src/image/image.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in Image.getPixelCubic at line 716. 6 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:54:33 -07:00\u0027 --until=\u00272026-11-14 10:54:33 -07:00\u0027 --full-history --no-merges -- lib/src/image/image.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image.dart"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed28402b6c74079014a1837c405a07cbc513563a6107d5dcf8d71441ecb413b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/formats/bmp_encoder.dart: lib/src/formats/bmp_encoder.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 94 in BmpEncoder.encode at line 22. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:54:33 -07:00\u0027 --until=\u00272026-11-14 10:54:33 -07:00\u0027 --full-history --no-merges -- lib/src/formats/bmp_encoder.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/bmp_encoder.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f135ee093a3cb1cd154fecd63a739562dccf0f2558af832df13b993af14862f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/formats/jpeg/jpeg_scan.dart: lib/src/formats/jpeg/jpeg_scan.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in JpegScan.decode at line 64. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:54:33 -07:00\u0027 --until=\u00272026-11-14 10:54:33 -07:00\u0027 --full-history --no-merges -- lib/src/formats/jpeg/jpeg_scan.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/jpeg_scan.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22f2ab815ca48522903e46265ea2716090282cc549fb51b204cb05d43cfad5f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/font/bitmap_font.dart: lib/src/font/bitmap_font.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in BitmapFont._parseFnt at line 99. 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-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:54:33 -07:00\u0027 --until=\u00272026-11-14 10:54:33 -07:00\u0027 --full-history --no-merges -- lib/src/font/bitmap_font.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/font/bitmap_font.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9cfac3cff85fc7db018be459e38e62bf269b6976c812c13ac3ca4e9d328f05"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/formats/exr/exr_part.dart: lib/src/formats/exr/exr_part.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in ExrPart.ExrPart at line 47. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:54:33 -07:00\u0027 --until=\u00272026-11-14 10:54:33 -07:00\u0027 --full-history --no-merges -- lib/src/formats/exr/exr_part.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_part.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82de909d419509cd76801d7b771e60b9ccf7f10c4f2485227445149ffc656cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/formats/ico_decoder.dart: lib/src/formats/ico_decoder.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in IcoDecoder._decodeFrame at line 89. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:54:33 -07:00\u0027 --until=\u00272026-11-14 10:54:33 -07:00\u0027 --full-history --no-merges -- lib/src/formats/ico_decoder.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/ico_decoder.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"443294bfa39701e09d3ce3bcab7c63afe26e172ab88a33c55fd250b24b64f1fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/formats/bmp_decoder.dart: lib/src/formats/bmp_decoder.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in BmpDecoder._decodeFrame at line 63. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:54:33 -07:00\u0027 --until=\u00272026-11-14 10:54:33 -07:00\u0027 --full-history --no-merges -- lib/src/formats/bmp_decoder.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/bmp_decoder.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6419d556075eac123e67dc3d03988e2dea62a0cb3d6e5e1c52b5a456caf4af5b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/util/neural_quantizer.dart: lib/src/util/neural_quantizer.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in NeuralQuantizer._inxSearch at line 158. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:54:33 -07:00\u0027 --until=\u00272026-11-14 10:54:33 -07:00\u0027 --full-history --no-merges -- lib/src/util/neural_quantizer.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/util/neural_quantizer.dart"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a995f652993d1f15fe84b74f5ca78366048eecd72748a284ecfbcf97bf83fad"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/src/transform/resize.dart: lib/src/transform/resize.dart changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is _CubicRows.prepare at line 515), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CImproved speed, yellowish bug fixes, fixes\u201D; \u201CFix in-place resize with letterboxing\u201D; \u201Cfix: safely reuse resize buffers across supported paths\u201D; \u201Cfix: preserve in-place resizing with bounded memory\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:54:33 -07:00\u0027 --until=\u00272026-11-14 10:54:33 -07:00\u0027 --full-history --no-merges -- lib/src/transform/resize.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/transform/resize.dart"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba0ddd8149eeae007a35e05b11901f0afda2f44d0003276265059f6f1515da7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/src/image/pixel_uint16.dart: lib/src/image/pixel_uint16.dart changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is PixelUint16.== at line 297), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CImproved speed, yellowish bug fixes, fixes\u201D; \u201CFix 2 channel images as grayscale\u002Balpha\u201D; \u201CFix opaque alpha defaults and WebP alpha decode\u201D; \u201Cwebp fixes\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:54:33 -07:00\u0027 --until=\u00272026-11-14 10:54:33 -07:00\u0027 --full-history --no-merges -- lib/src/image/pixel_uint16.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint16.dart"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f4a35f9abeb2f3edb1285335be6ae6f11848af8f5a7399615eb00edd76f838"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/src/image/pixel_uint1.dart: lib/src/image/pixel_uint1.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 12 (its worst body is PixelUint1.== at line 312), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CImproved speed, yellowish bug fixes, fixes\u201D; \u201CFix 2 channel images as grayscale\u002Balpha\u201D; \u201CFix opaque alpha defaults and WebP alpha decode\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:54:33 -07:00\u0027 --until=\u00272026-11-14 10:54:33 -07:00\u0027 --full-history --no-merges -- lib/src/image/pixel_uint1.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint1.dart"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"5830142fc533a7b011619e4fe28a5e359a0054800e5a9ecd49fc6b2c4b25b351"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/src/image/pixel_uint2.dart: lib/src/image/pixel_uint2.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 12 (its worst body is PixelUint2.== at line 309), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CImproved speed, yellowish bug fixes, fixes\u201D; \u201CFix 2 channel images as grayscale\u002Balpha\u201D; \u201CFix opaque alpha defaults and WebP alpha decode\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:54:33 -07:00\u0027 --until=\u00272026-11-14 10:54:33 -07:00\u0027 --full-history --no-merges -- lib/src/image/pixel_uint2.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint2.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba3b2d2162fd208c0059d19eab73232e287ff8807ed709a339591a5be8bcfc9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/src/image/pixel_uint4.dart: lib/src/image/pixel_uint4.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 11 (its worst body is PixelUint4.== at line 311), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CImproved speed, yellowish bug fixes, fixes\u201D; \u201CFix 2 channel images as grayscale\u002Balpha\u201D; \u201CFix opaque alpha defaults and WebP alpha decode\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 10:54:33 -07:00\u0027 --until=\u00272026-11-14 10:54:33 -07:00\u0027 --full-history --no-merges -- lib/src/image/pixel_uint4.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint4.dart"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5301c3257bc133591177e3a5ee47c69bf8bcad33907cb4c9eabcd547f48064"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 42 significant file(s) lose their only recent owner: lib/src/formats/gif_decoder.dart, lib/src/formats/webp/vp8_filter.dart, lib/src/formats/psd/psd_image.dart, lib/src/formats/pvr_decoder.dart, lib/src/exif/exif_data.dart, lib/src/util/neural_quantizer.dart, lib/src/util/color_util.dart, lib/src/formats/exr/exr_part.dart (\u002B34 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"716127cc75652cc631e4394a3d3e3d97c00e6ff313c8fa596e927db79859fb43"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 11 significant file(s) lose their only recent owner: lib/src/formats/webp/vp8l_encoder.dart, lib/src/formats/webp/vp8_tables.dart, lib/src/formats/webp/vp8l_backward_refs.dart, lib/src/formats/webp/vp8_encoder.dart, lib/src/formats/webp/vp8l_huffman_encoder.dart, lib/src/formats/webp/vp8_residual.dart, lib/src/formats/webp/vp8_segments.dart, lib/src/formats/webp/vp8_alpha.dart (\u002B3 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"029b4f80d78524173367999e808ddd32a55cd7014f6d8ebfe9745f412fbba337"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (54 single-owned of 191 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 191 of the 402 production source files in this repository met that bar). They are anonymized user #3 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: lib/src/command/formats/gif_cmd.dart."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: how do you do this with package:web? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/image_http_input.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5499dfa676d96966f2ec78157514e943290649b2f6b07966d10fbccdc57f268f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: how do you do this with package:web? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/image_http_input.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd27597eb1a4958b045057fabd750e2949b499d1634160337ceb391e1c13396"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: how do you do this with package:web? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/image_http_input.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a7bdd8c2b23151a123af64c9b88590e4774468aac155602fa4a5aae0a8581e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: how do you do this with package:web? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/test_formats.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b43103bc01653b28d0d72a1eb361b421473d5dc82e7eb8c5debdc202cc2a26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: how do you do this with package:web? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/test_formats.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"7280e4f28977cc37e9e8410c16ff7294a167182407d23f4876047217a0c77522"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: parse exif \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_decoder.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"954fa8742b1ad20470b0c0a28a4ab35fedc2a76796375efd573003b42b322b68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support encoding HDR images to TIFF. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/tiff_encoder.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31927ae082bea4883ffa815da50c79dbc2d45a3521d2e4d5ec12cf463358b2c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO support indexed and duotone images. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/psd/psd_image.dart"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"097c02f8e20b677aa61db2770b2cdd28a1c47ed2a9054748892be21102acc634"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO support sub-levels (for rip/mip-mapping). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_image.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f1d6fb43bff5c4c60e6b4a8f0977cf94b9d97b3ff0e19dedd7c6aeccd11b8a"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060_emitAlphaRGB\u0060 spells \u0060RGB\u0060 where 66 names in the project spell it \u0060Rgb\u0060: 66 of 68 names in project repository.src spell the token \u0060Rgb\u0060 (66 of 68; unit: names in project repository.src containing \u0060Rgb\u0060). Peers: Color.setRgb (lib/src/color/color.dart:88); ColorFloat16.setRgb (lib/src/color/color_float16.dart:188); ColorFloat32.setRgb (lib/src/color/color_float32.dart:178); ColorFloat64.setRgb (lib/src/color/color_float64.dart:171); ColorInt16.setRgb (lib/src/color/color_int16.dart:168). Rename to \u0060_emitAlphaRgb\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8.dart"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c5deda210bf509e1762c102cec105e2aed07a0b9f4f04987da7fada103ab5b"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060_emitFancyRGB\u0060 spells \u0060RGB\u0060 where 66 names in the project spell it \u0060Rgb\u0060: 66 of 68 names in project repository.src spell the token \u0060Rgb\u0060 (66 of 68; unit: names in project repository.src containing \u0060Rgb\u0060). Peers: Color.setRgb (lib/src/color/color.dart:88); ColorFloat16.setRgb (lib/src/color/color_float16.dart:188); ColorFloat32.setRgb (lib/src/color/color_float32.dart:178); ColorFloat64.setRgb (lib/src/color/color_float64.dart:171); ColorInt16.setRgb (lib/src/color/color_int16.dart:168). Rename to \u0060_emitFancyRgb\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8.dart"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba1f7fa290a1f966e256f71df9ca66af2a1ffd75a96a41bc34a44ca2d607fad"}},{"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":"341e0e23b7bfe280e79b4e96681c71055dc357ed494a527ec241e9a29a64801d"},"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":"6766b35cce0f38ae9362794fd651f0aa16217f202731662322c1a50ec58808c4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d89a9f4ac8687dcb009ed046b8c82154823538678fab7070b5615888b851e167"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 2 of 191 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 191 of the 402 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: lib/src/filter/histogram_equalization.dart, lib/src/filter/solarize.dart. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/filter/histogram_equalization.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"051a06e6e555e1a085379f254f0e050eb5738d2d976638c59c8e0957e690ef7b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/filter/solarize.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4aeca84c5303b0d230c99c9f402a1f74906df42bd80c095b9dd5695b4f34648"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: _jpeg_quantize_html.dart \u2194 _jpeg_quantize_io.dart: \u0060lib/src/formats/jpeg/_jpeg_quantize_html.dart\u0060 and \u0060lib/src/formats/jpeg/_jpeg_quantize_io.dart\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006078baa23d\u0060 Faster JPEG color conversion, fix flip both; \u0060da5db335\u0060 fix analyzer error; \u006046c87a4a\u0060 fix jpeg with adobe rgb color transformation \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/_jpeg_quantize_html.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"311a9b9f2bf1379025ec9996bf13ce994af39070929408f27cbc165027b7e164"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: png_decoder.dart \u2194 png_encoder.dart: \u0060lib/src/formats/png_decoder.dart\u0060 and \u0060lib/src/formats/png_encoder.dart\u0060 change together 54% of the time (15 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 15 shared commits counted here, the most recent 3 are \u0060f4f80903\u0060 Parse and round-trip the PNG cICP (colour-space) chunk; \u006088a2d9f4\u0060 Add physical pixel size handling for PNG.; \u00608ce5ac8d\u0060 clean up analyzer errors \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/png_decoder.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ffb30d8101b8a5f0066f127abf89d7ec4cf6c76325824fa7af38df9c798660"}},{"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":"7e37904db2ccbc85e059aeb48973ed8e1f6e6831834f4b40800c83663672d401"},"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":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/exr_viewer.html"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"15585fd5b4ee35a525292782536c44a4936915363840c510dca05c5307be110e"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/test_formats.html"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b75b924ebe3b9a8df98378d93a0f136b558b6124f74aa4c20004cae5b887b73"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/test_jpeg_encoder.html"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecd9a364a4df62039987384bd46a9507930f7718d62d2b42b3d56d47b7e7036"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/image_http_input.html"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c0b9428ba967c427505706418e2b8d03844f24ece41762095083678cf87dcb"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/exr_viewer.html"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a25fb74db8b73956eb286638dfede7b631f86a5b7c265471559fb340c6dade"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/filter_lab.html"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"5442b44178697c58b58426577c6c4500724119100f0e1ff0b846d7977f6e769a"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/filter_lab.html"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04d6f57e98948335546a540f009823dd48f668605fdb84704328a7097f9a199"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/image_http_input.html"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6a7e1bb5a1a053418ea0e752201a2b9f55ea11faf52b71c64563859ef9fab8"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/test_formats.html"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31d50cbaa02eebe8b382331a9053eada77d5e2c56b9c2feb8f4c204af9d392e"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/test_jpeg_encoder.html"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6984e87f6a4b6f36fea934522d1c8a76cc9bd3dc82617e8d06de0f6d33c1e307"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/web_test.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38b41b5f87db6c909284d80cf42819f7e2d80672892c744062dbd3adc3c94a9"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/web_test.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c693cf780d21200b4036f669b063a3332e1b791a8eaf57111e54bc49ba6456f4"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/web_test_wasm.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ec8e25a5b56e16838c03b8794ca1c50a475034b8ab7d00491eeead3826b233"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/web_test_wasm.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa90618f56dd74a4f5243074fd2b61ab99aa3d3b7981d99f4d6f58241a84cad9"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.ui-state-focus\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/res/filter_lab.css"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0339adf207f70204e143d9d6245ba55dde7037d8deb358980eea0ef3b9638b27"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: Color (30 abstract methods): \u0060Color\u0060 declares 30 abstract methods: \u0060length\u0060, \u0060maxChannelValue\u0060, \u0060maxIndexValue\u0060, \u0060format\u0060, \u0060isLdrFormat\u0060, \u0060isHdrFormat\u0060, \u0060hasPalette\u0060, \u0060palette\u0060, \u0060[]\u0060, \u0060[]=\u0060, \u0060index\u0060, \u0060r\u0060, \u0060g\u0060, \u0060b\u0060, \u0060a\u0060, \u0060rNormalized\u0060, \u0060gNormalized\u0060, \u0060bNormalized\u0060, \u0060aNormalized\u0060, \u0060luminance\u0060, \u0060luminanceNormalized\u0060, \u0060getChannel\u0060, \u0060getChannelNormalized\u0060, \u0060set\u0060, \u0060setRgb\u0060, \u0060setRgba\u0060, \u0060clone\u0060, \u0060convert\u0060, \u0060==\u0060, \u0060hashCode\u0060. Counted over its public methods with no body, once per name; concrete methods and \u0060_\u0060-private members are not counted, because no implementer that extends it is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color.dart"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d200e06753af0004c4956d2bf011109e115e37f198a7b47d4cd51da78f206a1"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: ImageData (18 abstract methods): \u0060ImageData\u0060 declares 18 abstract methods: \u0060clone\u0060, \u0060format\u0060, \u0060formatType\u0060, \u0060isHdrFormat\u0060, \u0060bitsPerChannel\u0060, \u0060maxChannelValue\u0060, \u0060maxIndexValue\u0060, \u0060lengthInBytes\u0060, \u0060length\u0060, \u0060buffer\u0060, \u0060rowStride\u0060, \u0060getRange\u0060, \u0060getColor\u0060, \u0060getPixel\u0060, \u0060setPixelR\u0060, \u0060setPixelRgb\u0060, \u0060setPixelRgba\u0060, \u0060clear\u0060. Counted over its public methods with no body, once per name; concrete methods and \u0060_\u0060-private members are not counted, because no implementer that extends it is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image_data.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2a9ec957de2da23b791f9dd929e62eb17fa02c57afcbc61290ea1cb19c52c2"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: Palette (17 abstract methods): \u0060Palette\u0060 declares 17 abstract methods: \u0060lengthInBytes\u0060, \u0060buffer\u0060, \u0060maxChannelValue\u0060, \u0060clone\u0060, \u0060format\u0060, \u0060setRgb\u0060, \u0060setRgba\u0060, \u0060set\u0060, \u0060get\u0060, \u0060getRed\u0060, \u0060setRed\u0060, \u0060getGreen\u0060, \u0060setGreen\u0060, \u0060getBlue\u0060, \u0060setBlue\u0060, \u0060getAlpha\u0060, \u0060setAlpha\u0060. Counted over its public methods with no body, once per name; concrete methods and \u0060_\u0060-private members are not counted, because no implementer that extends it is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/palette.dart"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0446abbab11d52f2f21bf2a9ed0fec9f60fd73a3686d1fc000bfbb145fb8e1"}},{"ruleId":"IC1","level":"note","message":{"text":"Member throws UnsupportedError: \u0060executeCommandAsync\u0060\u0027s body only throws an UnsupportedError or an UnimplementedError that gives its reason \u2014 sometimes a deliberate refusal, often an unfinished stub. Confirm it\u0027s intentional."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/_executor.dart"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f260eff15439eb64c3d2e3f4f0ec14e743c9f5768874e327914458dbb9f052c"}},{"ruleId":"IC1","level":"note","message":{"text":"Member throws UnsupportedError: \u0060executeCommandImage\u0060\u0027s body only throws an UnsupportedError or an UnimplementedError that gives its reason \u2014 sometimes a deliberate refusal, often an unfinished stub. Confirm it\u0027s intentional."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/_executor.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3528df1218047c536a86a68e6fbd4c7080405c4c5a5516238e190696a91c888"}},{"ruleId":"IC1","level":"note","message":{"text":"Member throws UnsupportedError: \u0060executeCommandImageAsync\u0060\u0027s body only throws an UnsupportedError or an UnimplementedError that gives its reason \u2014 sometimes a deliberate refusal, often an unfinished stub. Confirm it\u0027s intentional."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/_executor.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbfc48c6f65962f8dd8dca77b431b6dd8fdcde46905e81c441bdc61e2e0aa52"}},{"ruleId":"IC1","level":"note","message":{"text":"Member throws UnsupportedError: \u0060executeCommandBytes\u0060\u0027s body only throws an UnsupportedError or an UnimplementedError that gives its reason \u2014 sometimes a deliberate refusal, often an unfinished stub. Confirm it\u0027s intentional."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/_executor.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d09d032e1f2248efcf71a087af4ac461a9f3eeba33c4980b805da801420fdd9"}},{"ruleId":"IC1","level":"note","message":{"text":"Member throws UnsupportedError: \u0060executeCommandBytesAsync\u0060\u0027s body only throws an UnsupportedError or an UnimplementedError that gives its reason \u2014 sometimes a deliberate refusal, often an unfinished stub. Confirm it\u0027s intentional."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/_executor.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6d23b6fd9da5eecdfc7a3b7954a1358e4c2beec198e8bb70e3cb389cd1a22a"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060_readColorModeData\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/psd/psd_image.dart"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf9e21d5189dbb8cbe6dfc07d67f5f01d7c76a7d6a671a348917590fb1951c8"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060_ditherRow\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/webp/vp8.dart"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"f399ac6e22ecfa72bca5dcf2b1f9c44813bf582f3154b65bb848d595975f613f"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060updateCache\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_uint8.dart"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c6cf673b5c041520df0495c453f01d9a68989dfc2763a7f07c3094fe56b458"}},{"ruleId":"IC1","level":"note","message":{"text":"Member throws UnsupportedError: \u0060readFile\u0060\u0027s body only throws an UnsupportedError or an UnimplementedError that gives its reason \u2014 sometimes a deliberate refusal, often an unfinished stub. Confirm it\u0027s intentional."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/util/_file_access.dart"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"248d97aa25355605e26edc126c93c0055200c3835e60855b8ac5c1417d74bb76"}},{"ruleId":"IC1","level":"note","message":{"text":"Member throws UnsupportedError: \u0060writeFile\u0060\u0027s body only throws an UnsupportedError or an UnimplementedError that gives its reason \u2014 sometimes a deliberate refusal, often an unfinished stub. Confirm it\u0027s intentional."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/util/_file_access.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da55ffb2064be206635d77262434b390dd9b06f29176abca517115a5d20ee6c"}},{"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":"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/build.yaml"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(newWidth == null || newHeight == null) \u0026\u0026 padding == null\u0060 appears character-identically in 3 files \u2014 lib/src/command/command.dart, lib/src/command/transform/copy_expand_canvas_cmd.dart, lib/src/transform/copy_expand_canvas.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/command.dart"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabbf7edad3aa8fa7766d5cff14559f305d16906078f9a1767b69c8a312c7d89"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_outCache == null || _outCache!.length != len\u0060 appears character-identically in 2 files \u2014 lib/src/formats/exr/exr_rle_compressor.dart, lib/src/formats/exr/exr_zip_compressor.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/exr/exr_rle_compressor.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecd9faea1cc82c6c9d07bcf57fc29d8c202d046df28913d9b64a781f7226ffd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060blend == BlendMode.alpha \u0026\u0026 color.a == 0\u0060 appears character-identically in 2 files \u2014 lib/src/draw/draw_polygon.dart, lib/src/draw/fill_polygon.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/draw/draw_polygon.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e480d567071edb72eefe5231a930ab351166db38fe7177560f4c2cc377d505f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060image.format == Format.uint8 \u0026\u0026 !image.hasPalette \u0026\u0026 image.numChannels \u003E= 3\u0060 appears character-identically in 2 files \u2014 lib/src/formats/jpeg_encoder.dart, lib/src/util/octree_quantizer.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg_encoder.dart"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"95de8f257dbe33dc554fe90d4ff60349d1a9379c5b0d2543d05cf2986ba1e8c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060linearBlend \u0026\u0026 interpolation != Interpolation.nearest\u0060 appears character-identically in 2 files \u2014 lib/src/filter/bulge_distortion.dart, lib/src/filter/stretch_distortion.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/filter/bulge_distortion.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a9236bc79d96e1558f032eb2c712f350de80904a124d2620918bf03d5a5240"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060linearBlend \u0026\u0026 interpolation != Interpolation.nearest \u0026\u0026 !src.hasPalette\u0060 appears character-identically in 3 files \u2014 lib/src/transform/copy_resize.dart, lib/src/transform/copy_resize_crop_square.dart, lib/src/transform/resize.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/transform/copy_resize.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f91854245b7fb1bebe889b03604148e7e4a80ec00986ae8c70674854300900e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060marker != JpegMarker.eoi \u0026\u0026 !input.isEOS\u0060 appears character-identically in 2 files \u2014 lib/src/formats/jpeg/jpeg_data.dart, lib/src/formats/jpeg/jpeg_util.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/jpeg_data.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca0abc054f6918d7a59f2d7311692e3d3f7cb10016ee825f069c3aa32672daa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mask == null \u0026\u0026 frame.format == Format.uint8 \u0026\u0026 frame.numChannels \u003E= 3\u0060 appears character-identically in 4 files \u2014 lib/src/filter/edge_glow.dart, lib/src/filter/gamma.dart, lib/src/filter/grayscale.dart, lib/src/filter/sobel.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/filter/edge_glow.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e554bb25a53189dfa245e81699ceb40667617a2fa190e5f8344ffb0b6929473"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060newWidth != null \u0026\u0026 newHeight != null \u0026\u0026 padding != null\u0060 appears character-identically in 2 files \u2014 lib/src/command/command.dart, lib/src/command/transform/copy_expand_canvas_cmd.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/command/command.dart"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d5a746b894e0688fac36ad755a26bd3f6cd94567b0a18cc5282f48b96b38e1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060order == ChannelOrder.abgr || order == ChannelOrder.argb || order == ChannelOrder.bgra\u0060 appears character-identically in 2 files \u2014 lib/src/image/image.dart, lib/src/image/image_data.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image.dart"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"7169132bbab899d62edb71ebdc8a9ffe4eb9c75f4229ea51d235ca0bd2e0b926"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060other is Color \u0026\u0026 other.length == length \u0026\u0026 other.hashCode == hashCode\u0060 appears character-identically in 13 files \u2014 lib/src/color/color_float16.dart, lib/src/color/color_float32.dart, lib/src/color/color_float64.dart, lib/src/color/color_int16.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/color/color_float16.dart"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff7c634a61894c1d89cfa943135a89de30e91afa3f64f32a260b1d30e7305bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p[1 \u002B row] == 0 \u0026\u0026 p[2 \u002B row] == 0 \u0026\u0026 p[3 \u002B row] == 0 \u0026\u0026 p[4 \u002B row] == 0 \u0026\u0026 p[5 \u002B row] == 0 \u0026\u0026 p[6 \u002B row] == 0 \u0026\u0026 p[7 \u002B row] == 0\u0060 appears character-identically in 2 files \u2014 lib/src/formats/jpeg/_jpeg_quantize_html.dart, lib/src/formats/jpeg/_jpeg_quantize_io.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/_jpeg_quantize_html.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82f5e2cb421e83e023d6519be3df2697c51dbd5470f92ee56668a5d21aa1311"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p[p1] == 0 \u0026\u0026 p[p2] == 0 \u0026\u0026 p[p3] == 0 \u0026\u0026 p[p4] == 0 \u0026\u0026 p[p5] == 0 \u0026\u0026 p[p6] == 0 \u0026\u0026 p[p7] == 0\u0060 appears character-identically in 2 files \u2014 lib/src/formats/jpeg/_jpeg_quantize_html.dart, lib/src/formats/jpeg/_jpeg_quantize_io.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/_jpeg_quantize_html.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb203963e6b350acdc9aa66cd04125c577cfe4bf322305d6e73f31a29ad51bd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060soiCheck[0] != 0xff || soiCheck[1] != 0xd8\u0060 appears character-identically in 2 files \u2014 lib/src/formats/jpeg/jpeg_data.dart, lib/src/formats/jpeg/jpeg_util.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/jpeg/jpeg_data.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a147f36924e942a41cf9fd312b7bf40886705a49a50584d892ee00233b9e36c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060src.exif.imageIfd.hasOrientation \u0026\u0026 src.exif.imageIfd.orientation != 1\u0060 appears character-identically in 2 files \u2014 lib/src/transform/copy_resize.dart, lib/src/transform/resize.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/transform/copy_resize.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb527a73c66c228eaa7d8aac1fbf59a18cbf901404c5076f6c42c0aa9b8d7f4b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060width != null \u0026\u0026 height != null \u0026\u0026 maintainAspect == true\u0060 appears character-identically in 2 files \u2014 lib/src/transform/copy_resize.dart, lib/src/transform/resize.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/transform/copy_resize.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0084051b1ef114c72f1381db02a8e820d2e58a0f854d128a4fe60998d3307a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x \u003C 0 || x \u003E= width || y \u003C 0 || y \u003E= height\u0060 appears character-identically in 2 files \u2014 lib/src/image/image.dart, lib/src/image/image_data.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/image.dart"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed454784ee1a47030a3a931b34453e3f8f19d3dad90c694252dae5b485538853"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x \u003E= 0 \u0026\u0026 x \u003C (image.width - 1) \u0026\u0026 y \u003E= 0 \u0026\u0026 y \u003C (image.height - 1)\u0060 appears character-identically in 12 files \u2014 lib/src/image/pixel_float16.dart, lib/src/image/pixel_float32.dart, lib/src/image/pixel_float64.dart, lib/src/image/pixel_int16.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/image/pixel_float16.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"29cea2116baa848e90221516dc328a2004473bd6cb61e4f843bc8a7b73205d94"}},{"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":"web/filter_lab.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fa1168f5f46f2be49db08380117a9627f772ed0b72a904e3aef64b2249be32"}},{"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":"lib/src/formats/formats.dart"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27ae00ca35ae7e7b97fb952b0377b4a2d52f15ad3fab4f8a2c64819ed404887"}},{"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":"lib/src/formats/formats.dart"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfaa50b1f70ee736d68003c3f41f77642365d15a9cd7ad89e73356eb2b060fd9"}},{"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":"lib/src/formats/gif_decoder.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fc3a5343f2ed7c61759c4334bf1297261bc5ccb2e0fe6b5b969a3459290481"}},{"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":"lib/src/formats/gif_decoder.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0885c0d0f3791a022b327b603ff8b2bec672c48a6415f7939d7909369ae8c60"}},{"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":"lib/src/formats/ico_decoder.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdaa6135b9fe0bcc8f3b7bf87ccac85d5553c01a6805103ed0dd9be950d834c"}},{"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":"lib/src/formats/jpeg_decoder.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"880b91814e5c67e3a817054957d3aa0ea6102c8b69b60634d586a39f8e181bcf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\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":"lib/src/formats/pnm_decoder.dart"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f74b897a33027d21e81927c245d4ab683ec76215ed9f7b8836ca785f4959d9"}},{"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":"lib/src/formats/psd_decoder.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ababe754b0e19e2ad5208c3983a9dc97153da67c9a8077183ced087e9bd0edc9"}},{"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":"lib/src/formats/pvr_decoder.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ecdb3f13b6e4ec60c494a4fa16a3dca7d582fa0e8691f1805be0cf6dca2d23"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (error)\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":"lib/src/formats/tiff_decoder.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef29ea5f77ce4019b238d47b90b26d295787043367db26fbb24cc8bce93b94a"}},{"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":"lib/src/formats/webp_decoder.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"704eab72e8e708bba8aa8dcf1c099062d59e8611bcf4d87f3ade3650193f6495"}},{"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":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5097a44bdc556ad347f5259462bbb0415907fbe17fc42c063e20e88d10d271"}},{"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":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ddeb5ebf72b69c90b11ff5bbdcdbcc3e438d0486b3d2c4412003dd3a5583dd"}},{"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":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd46a09bc33a79f5a52c7c4c267adda62b360e0675bd612c874aec83fabec7c"}},{"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":"lib/src/formats/tiff/tiff_image.dart"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfdfcf933b4d715868ca48cbb31d4b17b015e79f29b918649c9090c6f67fbec"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_parseNextInt\u0060 turns every thrown error into \u00600\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the error or rethrow it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the \u0060catch\u0060 or in the \u0060///\u0060 doc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/formats/pnm_decoder.dart"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"207ebb3db7f0cba94d771672f23e8bfe5c9334a3f310d1fc1f3360d1ff52eb76"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"Reliance on Component That is Not Updateable","shortDescription":{"text":"Reliance on Component That is Not Updateable"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"}]},{"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-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"}]}],"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":5,"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."]}]}