{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"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":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX1","name":"Captive dependencies","shortDescription":{"text":"Captive dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/AX1"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"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":"DM4","name":"Rich vs anemic domain model","shortDescription":{"text":"Rich vs anemic domain model"},"helpUri":"https://codehealth.canine.dev/dimensions/DM4"},{"id":"DM5","name":"Encapsulated state","shortDescription":{"text":"Encapsulated state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM5"},{"id":"DM6","name":"Domain \u2194 infrastructure boundary","shortDescription":{"text":"Domain \u2194 infrastructure boundary"},"helpUri":"https://codehealth.canine.dev/dimensions/DM6"},{"id":"ED4","name":"Outbox / dual-write","shortDescription":{"text":"Outbox / dual-write"},"helpUri":"https://codehealth.canine.dev/dimensions/ED4"},{"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":"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":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"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":"OnlineGalleryPaginationService.load (cyclomatic 95): OnlineGalleryPaginationService.load has cyclomatic complexity 95 (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/presentation/providers/online_gallery_pagination_service.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e989a04e5bd8c8f6b6fa2391b61a42f0a13d7d58d689f6e2283fb9c7237dc578"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryRandomLoaderService.load (cyclomatic 76): OnlineGalleryRandomLoaderService.load has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/online_gallery_random_loader_service.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf96857c6bd3a14013798e8b3fcd09d79656897cd4634979736dc59db8c918c"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryFavoritesLoaderService.load (cyclomatic 74): OnlineGalleryFavoritesLoaderService.load has cyclomatic complexity 74 (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/presentation/providers/online_gallery_favorites_loader_service.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6868eb9dcf46eaa23e0adc145dcda4f050e06784c03ff30a2cbf745fd2161cb"}},{"ruleId":"D1","level":"warning","message":{"text":"_OfficialRecipeEngine._furryCharacter (cyclomatic 64): _OfficialRecipeEngine._furryCharacter has cyclomatic complexity 64 (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/data/services/official_random_prompt_generator.dart"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"320f1e9092f28a7881670807d3f8b14a8dbb84ba4a799ffacffd5f2b862f3e6b"}},{"ruleId":"D1","level":"warning","message":{"text":"MetadataImportOptions.selectedCountFor (cyclomatic 63): MetadataImportOptions.selectedCountFor has cyclomatic complexity 63 (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/data/models/metadata/metadata_import_options.dart"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a87014a0e8476a6c5a4ae0a87fd1f7868165a39f1f622b86b843052886ab859"}},{"ruleId":"D1","level":"warning","message":{"text":"_DanbooruPostCardState._buildCard (cyclomatic 62): _DanbooruPostCardState._buildCard has cyclomatic complexity 62 (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/presentation/widgets/danbooru_post_card.dart"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"810e53ed601a1d92b7a301d7305f3d734985051ddd513a4ca7b9ce4f3d6c8a8a"}},{"ruleId":"D1","level":"warning","message":{"text":"_DetailTopBarActions._buildActions (cyclomatic 61): _DetailTopBarActions._buildActions has cyclomatic complexity 61 (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/presentation/widgets/common/image_detail/components/detail_top_bar.dart"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9ef5c06e68587870d5c49aa3aea7a252ecd59d3dd56763c98251654009c24c"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentChatEventController.handle (cyclomatic 56): AgentChatEventController.handle has cyclomatic complexity 56 (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/presentation/agent_chat/services/agent_chat_event_controller.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8576dea8bba930542ca56c9bada02b20fee69a18bfbb179b416d7119666006"}},{"ruleId":"D1","level":"warning","message":{"text":"WarmupMessageLocalizer._localizeKnownMessage (cyclomatic 54): WarmupMessageLocalizer._localizeKnownMessage has cyclomatic complexity 54 (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/presentation/utils/warmup_message_localizer.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8056cba4a4637f4997c275587ac37e8baaf40e1ba97c616965445b2e3ec004a6"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAiResponsesAdapter.completeAgent (cyclomatic 52): OpenAiResponsesAdapter.completeAgent has cyclomatic complexity 52 (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/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b25e23e1c4c273c629155bfdccbcb6e16eac5b46f2c57af88b718b93ba5c38f"}},{"ruleId":"D1","level":"warning","message":{"text":"GalleryDetailInfoPanel.build (cyclomatic 52): GalleryDetailInfoPanel.build has cyclomatic complexity 52 (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/presentation/widgets/online_gallery/gallery_detail_info_panel.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2958ff2f7bdc28f8b2baecb20177afdbbe23b59d90c64db566ea00f3a0c1532"}},{"ruleId":"D1","level":"warning","message":{"text":"AnthropicMessagesAdapter.completeAgent (cyclomatic 50): AnthropicMessagesAdapter.completeAgent 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/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0faf6ed70d906f78e54257e8d7cb983b76c6dec4ccde04169a7fecbb5943ce"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageGenerationCoordinator.execute (cyclomatic 49): ImageGenerationCoordinator.execute 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/presentation/providers/generation/image_generation_coordinator.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"975556c02fdabf15ddd850e6cb9298210d16db60e6851b6a7be30896ee91f827"}},{"ruleId":"D1","level":"warning","message":{"text":"GenerationPreparationService.prepareForKind (cyclomatic 48): GenerationPreparationService.prepareForKind has cyclomatic complexity 48 (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/presentation/agent_chat/services/generation_preparation_service.dart"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ff01030cbec707455be2db5a5180f09730c3baf46f16d19e9d857e698109b1"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAiChatCompletionsAdapter.completeAgent (cyclomatic 48): OpenAiChatCompletionsAdapter.completeAgent has cyclomatic complexity 48 (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/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0312b2d0ce79dd28fb9475d19dfb8edfe375cf577406174ecbda7d973e36fc6"}},{"ruleId":"D1","level":"warning","message":{"text":"_QuickTagCloudToolbarState.build (cyclomatic 48): _QuickTagCloudToolbarState.build has cyclomatic complexity 48 (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/presentation/widgets/online_gallery/quick_tag_cloud_toolbar.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b28e33bd877ed2c8dac831d51445131e49f94c3700ec8b0a10d14ec2ee2604e"}},{"ruleId":"D1","level":"warning","message":{"text":"AiTagGenerationInfoSection.build (cyclomatic 47): AiTagGenerationInfoSection.build has cyclomatic complexity 47 (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/presentation/widgets/online_gallery/ai_tag_generation_info_section.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bad81011692cde8aa42cff5c8cd06fab939667591a7c836dd9be33ca398ef9"}},{"ruleId":"D1","level":"warning","message":{"text":"PortableRecordCodec.decode (cyclomatic 46): PortableRecordCodec.decode 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/data/cloud_sync/portable_record_codec.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e4c5ef731c2087ebe418976dfc4909d848f09f7ad8bb7c50c2bde9f731b6ff"}},{"ruleId":"D1","level":"warning","message":{"text":"GeminiGenerateContentAdapter.completeAgent (cyclomatic 46): GeminiGenerateContentAdapter.completeAgent 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/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58d144fb947765301b11e8167f7686a746904b37fe0880a6d22ea126f0c4a48"}},{"ruleId":"D1","level":"warning","message":{"text":"InputHandler.handleKeyEvent (cyclomatic 46): InputHandler.handleKeyEvent 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/presentation/widgets/image_editor/core/input_handler.dart"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c160d3d3a46eeeec80e7f13cc56777c0befc9bdb2155d7caa19fd8a11d0e2c5"}},{"ruleId":"D1","level":"warning","message":{"text":"TagSubCategoryHelper.classifyTag (cyclomatic 45): TagSubCategoryHelper.classifyTag has cyclomatic complexity 45 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: TagSubCategoryHelper.getDisplayName (cyclomatic 70) 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/data/models/prompt/tag_category.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab99bed9bf28515f8c918b5b43aa9dd4fce10c3ee0c7581a9a995dadd20c4755"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageCardSurface._buildSurface (cyclomatic 44): ImageCardSurface._buildSurface has cyclomatic complexity 44 (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/presentation/widgets/common/image_card_surface.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b39311d735e3423a7f224c1615b2e46113d7333e1216fbb7f4fe3c6adddb1b1"}},{"ruleId":"D1","level":"warning","message":{"text":"nai_inpaint_parity_browser.main (cyclomatic 44): nai_inpaint_parity_browser.main has cyclomatic complexity 44 (threshold 15). Most of this is not in the body itself: 3 of the 44 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 377, 299, 354, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/diagnostics/nai_inpaint_parity_browser.cjs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"5360d349b9448fcc620d05666d5ba37f1672f42519288341fde71e94f3df091e"}},{"ruleId":"D1","level":"warning","message":{"text":"_OfficialRecipeEngine._legacyCharacter (cyclomatic 42): _OfficialRecipeEngine._legacyCharacter has cyclomatic complexity 42 (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/data/services/official_random_prompt_generator.dart"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec466e627c1f09731954f5dad996b2b7e23b417e05faf7bef963c9cd4b5d8b1"}},{"ruleId":"D1","level":"warning","message":{"text":"ContiguousRegionSelector.selectRgba (cyclomatic 40): ContiguousRegionSelector.selectRgba has cyclomatic complexity 40 (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/core/utils/contiguous_region_selector.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0268cc0ac883e9f5769e45eef4848bbf6d219d5a563a788d199144d533376a05"}},{"ruleId":"D1","level":"warning","message":{"text":"_AgentChatComposerState._editor (cyclomatic 39): _AgentChatComposerState._editor has cyclomatic complexity 39 (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/presentation/agent_chat/widgets/agent_chat_composer.dart"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb51940bdda66f5260ed090d9b4a84726b858cc9665c3a6d94bf42ed07fc508c"}},{"ruleId":"D1","level":"warning","message":{"text":"AssistantModelCatalog._resolvePiProvider (cyclomatic 38): AssistantModelCatalog._resolvePiProvider has cyclomatic complexity 38 (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/presentation/prompt_assistant/models/assistant_model_capability.dart"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"16391465c329deead4d3e93687ba2e0c94c8b8bef250b3110d980c86ee7bd381"}},{"ruleId":"D1","level":"warning","message":{"text":"AuthNotifier._restoreStoredSession (cyclomatic 37): AuthNotifier._restoreStoredSession has cyclomatic complexity 37 (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/data/services/auth_provider.dart"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"932978fe116066945cac9a279223c2319ed7e42e4567e929d32c93fca7de1dce"}},{"ruleId":"D1","level":"warning","message":{"text":"GeminiGenerateContentAdapter._buildAgentPayload (cyclomatic 37): GeminiGenerateContentAdapter._buildAgentPayload has cyclomatic complexity 37 (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/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bead0e72695201401303315db592826084760b40e1e005633cd1bf18287b5c"}},{"ruleId":"D1","level":"warning","message":{"text":"_OnlineGalleryContentPresenter._buildResolvedPostCard (cyclomatic 37): _OnlineGalleryContentPresenter._buildResolvedPostCard has cyclomatic complexity 37 (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/presentation/screens/online_gallery/online_gallery_content.dart"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"316db96ce715433f5ec49b167376ddaae1161639aa38ff753f6e78c063117f7d"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryLocalFavoritesRepository.query (cyclomatic 36): OnlineGalleryLocalFavoritesRepository.query has cyclomatic complexity 36 (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/data/repositories/online_gallery_local_favorites_repository.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f914986f6d176e5f492fed43e304199a27952749354b9a68f7d7f1c8d55831e"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentChatNotifier._sendMessage (cyclomatic 36): AgentChatNotifier._sendMessage 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/presentation/agent_chat/providers/agent_chat_notifier.dart"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e7f65716e8d6f2037b1e5ce3b111a442d9f32b60458531b9e2f3dd8a4a1ca0"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryErrorMapper.map (cyclomatic 35): OnlineGalleryErrorMapper.map has cyclomatic complexity 35 (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/data/services/online_gallery/online_gallery_error_mapper.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4eb24a965a2b6bf569576cdf1c9ebc7634df05e6b38acec1d91f4ff22ba8c6b"}},{"ruleId":"D1","level":"warning","message":{"text":"_OfficialRecipeEngine.generateFurry (cyclomatic 34): _OfficialRecipeEngine.generateFurry has cyclomatic complexity 34 (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/data/services/official_random_prompt_generator.dart"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8836a11201dd0d6871dc7ae747528ff59cf80038020ad3877c6f9fe05dbde4a"}},{"ruleId":"D1","level":"warning","message":{"text":"PreciseRefImageCodec.detectExtension (cyclomatic 34): PreciseRefImageCodec.detectExtension has cyclomatic complexity 34 (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/data/services/precise_ref_portable_importer.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"228515008af97cfcfeff7e0e173ccbedf41a4889b86babf605c3adbba126a012"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentChatMessages.build (cyclomatic 34): AgentChatMessages.build has cyclomatic complexity 34 (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/presentation/agent_chat/widgets/agent_chat_messages.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a28f0c88cd5190a6e14e0492cb1cdd18def9f2df0adae51d9dbf42fc945546c"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageGenerationCoordinator._runRequest (cyclomatic 34): ImageGenerationCoordinator._runRequest has cyclomatic complexity 34 (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/presentation/providers/generation/image_generation_coordinator.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3a64979c858a840cefc10c953d09d086818a72ccd87f3891c3105b385b0cc2"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorResultExporter.buildEditorResult (cyclomatic 34): EditorResultExporter.buildEditorResult has cyclomatic complexity 34 (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/presentation/widgets/image_editor/export/editor_result_exporter.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42654e21fd57d128fb88bd39cd72d8c115f09d4f951314f96796a5bce4a0f74"}},{"ruleId":"D1","level":"warning","message":{"text":"_TagEditorViewState._key (cyclomatic 34): _TagEditorViewState._key has cyclomatic complexity 34 (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/presentation/widgets/prompt/tag_editor_view.dart"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"310d9ceb0ef1f406dcd5b2aab44d0a8d503fd324d4a2c5e4e691fd714fe7ec06"}},{"ruleId":"D1","level":"warning","message":{"text":"QuickTagCloudQueryEngine.matchingRecords (cyclomatic 33): QuickTagCloudQueryEngine.matchingRecords has cyclomatic complexity 33 (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/data/datasources/remote/online_gallery/quick_tag_cloud_query_engine.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c331f8ca7d9e994d1d16b45f44d5885302d723957a7acdcab3cad5439587aff"}},{"ruleId":"D1","level":"warning","message":{"text":"GalleryStreamScanner._processSingleFile (cyclomatic 33): GalleryStreamScanner._processSingleFile has cyclomatic complexity 33 (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/data/services/gallery/gallery_stream_scanner.dart"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc918a3d8ad94194dbd3cea3d34d27364cb7afcccdcc365bea66188a72d6a57"}},{"ruleId":"D1","level":"warning","message":{"text":"_AgentChatComposerState._contextIndicator (cyclomatic 33): _AgentChatComposerState._contextIndicator has cyclomatic complexity 33 (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/presentation/agent_chat/widgets/agent_chat_composer.dart"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"498283c68ff9ccc0a92333e89597af1ce5066d756a04d93459050672247f3c6e"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentChatMessages._messageTile (cyclomatic 33): AgentChatMessages._messageTile has cyclomatic complexity 33 (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/presentation/agent_chat/widgets/agent_chat_messages.dart"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db2f1bcd04e2c2f37f7e7a544eaa541a2d778f243585ec7bb91728c95ef73e3"}},{"ruleId":"D1","level":"warning","message":{"text":"McpImageResponseService.prepare (cyclomatic 33): McpImageResponseService.prepare has cyclomatic complexity 33 (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/presentation/mcp/services/mcp_image_response_service.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe25f7fa430959c2e3939f20a6033a4d3de62a3d2017d280d037096c45307255"}},{"ruleId":"D1","level":"warning","message":{"text":"_PrivacySettingsSectionState.build (cyclomatic 33): _PrivacySettingsSectionState.build has cyclomatic complexity 33 (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/presentation/screens/settings/sections/privacy_settings_section.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5ae2ae0fbfc639b6ac715361a6787c1230deb6224ece95f983845a3ab5a241"}},{"ruleId":"D1","level":"warning","message":{"text":"SqliteGalleryAlbumRepository._moveAlbumToSlot (cyclomatic 32): SqliteGalleryAlbumRepository._moveAlbumToSlot has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/datasources/gallery_album_repository.dart"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e23d2131a1579ba5ccffb8ded0a71125effea491d3da64e26b819c7fc486691"}},{"ruleId":"D1","level":"warning","message":{"text":"SafeWebReader._isBlockedIpv4 (cyclomatic 32): SafeWebReader._isBlockedIpv4 has cyclomatic complexity 32 (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/core/network/web_access/safe_web_reader.dart"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"2417c013dd4a4a78f6587ed23e4b9fca9984d061da767d80b8f754e24077d60c"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionJsonlCodec.encode (cyclomatic 30): SessionJsonlCodec.encode has cyclomatic complexity 30 (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/core/agent/harness/session/jsonl/session_jsonl_codec.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"28680044d8957c6d933c7baeaecbccf0624b5df026cac04af87714931c6dfb2d"}},{"ruleId":"D1","level":"warning","message":{"text":"SkillArchiveExtractor._preflightZipHeaders (cyclomatic 30): SkillArchiveExtractor._preflightZipHeaders has cyclomatic complexity 30 (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/core/agent/skill_archive_extractor.dart"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9330193c1854e885f4af327c7ed21b30fc9c1ded05a5c661a5cec5b398b667"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionOrchestrator.query (cyclomatic 30): CompletionOrchestrator.query has cyclomatic complexity 30 (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/core/autocomplete/completion_orchestrator.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"021323640d6405ca8f33b6c15f3c0cac295ecf1eeed8a113a30254192b837f5c"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentSkillsCloudSyncAdapter.validateRecord (cyclomatic 30): AgentSkillsCloudSyncAdapter.validateRecord has cyclomatic complexity 30 (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/data/cloud_sync/agent_cloud_sync_adapters.dart"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"807163a8822ea70101d51e8ee3fe76fa1b56570f276c5e89b914fba02f617999"}},{"ruleId":"D1","level":"warning","message":{"text":"MetadataImportOptions.selectedCount (cyclomatic 30): MetadataImportOptions.selectedCount has cyclomatic complexity 30 (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/data/models/metadata/metadata_import_options.dart"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e38ce35ee6e005bee26906c326e8aa231c9c1d01409cfd60fbe0c6b624b68f6"}},{"ruleId":"D1","level":"warning","message":{"text":"_OfficialRecipeEngine.generateLegacy (cyclomatic 30): _OfficialRecipeEngine.generateLegacy has cyclomatic complexity 30 (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/data/services/official_random_prompt_generator.dart"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71e0b1d4f8974d04b1f042875189f07b6e1125efabe3ba0ce78d9384a572997"}},{"ruleId":"D1","level":"warning","message":{"text":"GalleryCategoryNotifier._moveCategoryToSlot (cyclomatic 30): GalleryCategoryNotifier._moveCategoryToSlot has cyclomatic complexity 30 (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/presentation/providers/gallery_category_provider.dart"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"937593d91c86863c5ddffbaec5899053a8da987ed0c36f384d6b7f80ffadbbc1"}},{"ruleId":"D1","level":"warning","message":{"text":"_ImagePreviewWidgetState._buildGeneratedImageCard (cyclomatic 30): _ImagePreviewWidgetState._buildGeneratedImageCard has cyclomatic complexity 30 (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/presentation/screens/generation/widgets/image_preview.dart"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"179d8f2535054fe024a21d959bc75505ce84ddfec6bea23d8ac6f78fb1e08b0d"}},{"ruleId":"D1","level":"warning","message":{"text":"_Img2ImgUpscaleSectionState.build (cyclomatic 30): _Img2ImgUpscaleSectionState.build has cyclomatic complexity 30 (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/presentation/screens/generation/widgets/img2img_upscale_section.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c27f049e948a57820f80551bc020db2c5f1ae8a0128f00ca54c217feee17b6"}},{"ruleId":"D1","level":"warning","message":{"text":"CardActionButtons.build (cyclomatic 30): CardActionButtons.build has cyclomatic complexity 30 (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/presentation/widgets/common/card_action_buttons.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c2e1f30e775e239ed4daa8459c0cbb6ddf4b07c56bcb0e20f7d36d0528bc56"}},{"ruleId":"D1","level":"warning","message":{"text":"_DanbooruPostCardState._buildActions (cyclomatic 30): _DanbooruPostCardState._buildActions has cyclomatic complexity 30 (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/presentation/widgets/danbooru_post_card.dart"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"84064f56f5a0b259f33f7c9ea353a4c6052a3c05a2c769d42e405d63ae8fc35f"}},{"ruleId":"D1","level":"warning","message":{"text":"_CategoryItemState.build (cyclomatic 30): _CategoryItemState.build has cyclomatic complexity 30 (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/presentation/widgets/gallery/gallery_category_tree_view.dart"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e62f71f3a7db76a57710f6b93178f12b3c728a89946c6cccd0ac9109ca5a37c"}},{"ruleId":"D1","level":"warning","message":{"text":"_UnifiedPromptInputState._handleHardwareKeyEvent (cyclomatic 30): _UnifiedPromptInputState._handleHardwareKeyEvent has cyclomatic complexity 30 (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/presentation/widgets/prompt/unified/unified_prompt_input.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd60018bd9e190100d608904c602b08aeef3192c73d587c841e20bda59e57d83"}},{"ruleId":"D1","level":"warning","message":{"text":"CooccurrenceDataPackService._install (cyclomatic 29): CooccurrenceDataPackService._install has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/autocomplete/cooccurrence_data_pack_service.dart"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b286af75fdf12ba1441bbb217ec3adc2b41cf9d7418f5aa57d5e5bd553c4c6b"}},{"ruleId":"D1","level":"warning","message":{"text":"WebDavCapabilityProbe.run (cyclomatic 29): WebDavCapabilityProbe.run has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/backend/webdav_capability_probe.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eaff1b28d74da7b385fb9df9e91a2eecac57d70b774a96634aecd97a9aad482"}},{"ruleId":"D1","level":"warning","message":{"text":"HiveStorageHelper._migrateFromOldLocation (cyclomatic 29): HiveStorageHelper._migrateFromOldLocation has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/hive_storage_helper.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ea9ce4ae0a268bbf3fc7197e7a7724061536506af089a7f0ced7c7ae80f3f6"}},{"ruleId":"D1","level":"warning","message":{"text":"GenerationSettingsService.updateSettings (cyclomatic 29): GenerationSettingsService.updateSettings has cyclomatic complexity 29 (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/presentation/agent_chat/services/generation_settings_service.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5d456dd929fb1f5c7dab067c09552f57864b2215cadfc29dae24a7092cc512"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageGenerationNotifier.generate (cyclomatic 29): ImageGenerationNotifier.generate has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/image_generation_provider.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c24075eee70bbd482d7f8df17baadd29e28d4af10a425f2ee10ae8c4a051f0"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptInputEditor.build (cyclomatic 29): PromptInputEditor.build has cyclomatic complexity 29 (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/presentation/screens/generation/widgets/prompt_input_editor.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"28708ef3cd518291ac06907e0b2dafd53de7319c658740959d3776548b487ff7"}},{"ruleId":"D1","level":"warning","message":{"text":"_VibeCategoryItemState.build (cyclomatic 29): _VibeCategoryItemState.build has cyclomatic complexity 29 (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/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef39963c76abf02216f603f346c79ae307619c180ba865208901edc76dcc834d"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageCardController.update (cyclomatic 29): ImageCardController.update has cyclomatic complexity 29 (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/presentation/widgets/common/image_card_controller.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2e36ae1d1ec35325a8244ea7bfb74d45c884bdc5dcf9f8ba2f15171280886d"}},{"ruleId":"D1","level":"warning","message":{"text":"NAIImageRequestBuilder.build (cyclomatic 28): NAIImageRequestBuilder.build has cyclomatic complexity 28 (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/core/network/request_builders/nai_image_request_builder.dart"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cf6c704e791c194d466ae2a42ad4a6cd20fce1d82dd3f6c26bb43ed307ae97"}},{"ruleId":"D1","level":"warning","message":{"text":"NaiImageMetadata.upgradeFromRawJsonIfNeeded (cyclomatic 28): NaiImageMetadata.upgradeFromRawJsonIfNeeded 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/data/models/gallery/nai_image_metadata.dart"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"431bc44402cc8d8bfee9933bdae862334b8191cd06c9323ac082c459a9865eb4"}},{"ruleId":"D1","level":"warning","message":{"text":"_WatermarkEditorScreenState._buildActions (cyclomatic 28): _WatermarkEditorScreenState._buildActions 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/presentation/screens/watermark/watermark_editor_screen.dart"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"40858962f01134881e46a5ea021cdb98f074ded4098e045a351388d21626a1f0"}},{"ruleId":"D1","level":"warning","message":{"text":"CloudRecordMerger.merge (cyclomatic 27): CloudRecordMerger.merge has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/record_merge.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c4902b1e72938aed1ee648d87e43b7a1af16f3c6a63e5649e3b301860260cf"}},{"ruleId":"D1","level":"warning","message":{"text":"SpreadKernel._spread (cyclomatic 27): SpreadKernel._spread has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/services/pixel_snap/internal/spread_kernel.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e65562e3e882049e9fafd8352c33d275ea5962745ca02e4e382454f2f22c98a"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentChatConfig.fromJson (cyclomatic 27): AgentChatConfig.fromJson has cyclomatic complexity 27 (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/data/models/agent/agent_settings.dart"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf7bf60fb017a06d98a594468522035d49bee77f9086b7a33af7a7b1af48eac"}},{"ruleId":"D1","level":"warning","message":{"text":"_OfficialRecipeEngine._characterPromptCharacter (cyclomatic 27): _OfficialRecipeEngine._characterPromptCharacter has cyclomatic complexity 27 (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/data/services/official_random_prompt_generator.dart"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b31a76cb2369dce549c2ba667a0fbdedf99ab7037ecfd0f48a589e42746003"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryToolbox._executeBrowse (cyclomatic 27): OnlineGalleryToolbox._executeBrowse has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/online_gallery_toolbox.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"553fd76a9047519057039d11bd122a320fff9730cc97e4890e49d2edc29fd829"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryToolbarAuthControls._buildUserButton (cyclomatic 27): OnlineGalleryToolbarAuthControls._buildUserButton has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_auth.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac3ad0e6a64d1bd95bd905ffdb9356c6c9fd7545a49d240add5635bd258fd1c"}},{"ruleId":"D1","level":"warning","message":{"text":"_VibeCardState._buildCard (cyclomatic 27): _VibeCardState._buildCard has cyclomatic complexity 27 (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/presentation/screens/vibe_library/widgets/vibe_card.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ec445e579357879d1e6767d44abc23bd5ed1e5a0e6f387404c086400024fe5"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageWorkflowLauncher._openEditor (cyclomatic 27): ImageWorkflowLauncher._openEditor has cyclomatic complexity 27 (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/presentation/services/image_workflow_launcher.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd0b0f3307625731304b6581cf6dbe20311ada5960e4efe3cfb2ae95590a659"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactIconButton.build (cyclomatic 27): CompactIconButton.build has cyclomatic complexity 27 (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/presentation/widgets/common/compact_icon_button.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8a5dd269bde008ede0ad74eea42eb3d8b3069102c2e883cc6b46b35c7d1042"}},{"ruleId":"D1","level":"warning","message":{"text":"_MetadataImportDialogState._buildPromptSection (cyclomatic 27): _MetadataImportDialogState._buildPromptSection has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/metadata/metadata_import_dialog.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5b476a3808d0b5199e3ad8e1860f76caeeeb2ae0588980e8633b9b012f8461"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptWeightEditing._resolveTarget (cyclomatic 27): PromptWeightEditing._resolveTarget has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/prompt_weight_editing.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"8155f905acbc182815b93004783a315618a832380969eb7df65e893ec6edf237"}},{"ruleId":"D1","level":"warning","message":{"text":"_OfficialRecipeEngine.generateCharacterPrompts (cyclomatic 26): _OfficialRecipeEngine.generateCharacterPrompts 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/data/services/official_random_prompt_generator.dart"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"e763a0dcbad3970108decd2cede61212e315c93874b4ceb445131e91bfefe577"}},{"ruleId":"D1","level":"warning","message":{"text":"GenerationCharacterOrchestrator.normalizeExplicit (cyclomatic 26): GenerationCharacterOrchestrator.normalizeExplicit 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/presentation/agent_chat/services/generation_character_orchestration.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec006919206f6ca652a37c9693ecc67fb651e45cfe12bd97c3e97366fd8cfb49"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAiChatCompletionsAdapter._maxTokensField (cyclomatic 26): OpenAiChatCompletionsAdapter._maxTokensField has cyclomatic complexity 26 (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/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2b919aecc2c97cf2c2b32f82e537ed70b31167c901e57d76573aebcb22e480"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageGenerationNotifier._reduce (cyclomatic 26): ImageGenerationNotifier._reduce has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/image_generation_provider.dart"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cbc2aeea05e1e003c321c4a596f48b320f53de90582bf4ef707b5af33f9c12"}},{"ruleId":"D1","level":"warning","message":{"text":"_OnlineGalleryScreenState._handleGalleryStateChanged (cyclomatic 26): _OnlineGalleryScreenState._handleGalleryStateChanged has cyclomatic complexity 26 (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/presentation/screens/online_gallery/online_gallery_screen.dart"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"539e7507af23343b88764460737941edfe427256ebb2f64b54da39fed0824ddd"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryToolbarSourceControls._buildSecondaryControls (cyclomatic 26): OnlineGalleryToolbarSourceControls._buildSecondaryControls 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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_source_controls.dart"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b710f88c4c7ac52d87b71f21633f00c3491503c48fa0c10a5500ead0e22bc0"}},{"ruleId":"D1","level":"warning","message":{"text":"GenerationPromptTransferService.replaceMainPrompt (cyclomatic 26): GenerationPromptTransferService.replaceMainPrompt 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/presentation/services/generation_prompt_transfer_service.dart"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fd2ef57e52bfa09f7778951ff88d2df5633a332f86888e5640cd2264affa5c"}},{"ruleId":"D1","level":"warning","message":{"text":"_CollapsibleImagePanelState.build (cyclomatic 26): _CollapsibleImagePanelState.build has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/collapsible_image_panel.dart"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3e7af682780a9f8f6a6b82b60abad644ff479d874c27aa518bd25b87b1976b"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageCardFrame.build (cyclomatic 26): ImageCardFrame.build has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/image_card_frame.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"793d817c0cb08f8ca0adf04013c3690e61aa89acf7cc064ae6c2b6a4c46193dc"}},{"ruleId":"D1","level":"warning","message":{"text":"_LocalGalleryToolbarState.build (cyclomatic 26): _LocalGalleryToolbarState.build 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/presentation/widgets/gallery/local_gallery_toolbar.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"102b30ad8f766a5716fbff20964a4be6058f541320b3663742e291f2ae07888b"}},{"ruleId":"D1","level":"warning","message":{"text":"_AutoSaveToggleChipState.build (cyclomatic 26): _AutoSaveToggleChipState.build has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/generation/auto_save_toggle_chip.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f52924e2a779ba02c31b3e20fd82354407636449770e850cee73cb5e13a1be"}},{"ruleId":"D1","level":"warning","message":{"text":"SkillArchiveExtractor.extract (cyclomatic 25): SkillArchiveExtractor.extract 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/core/agent/skill_archive_extractor.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5902625e85462e8c5623721d42cf81817206279ba05803f72c1f6848f72c9d60"}},{"ruleId":"D1","level":"warning","message":{"text":"SkillInstallTransactionManager.recoverTransaction (cyclomatic 25): SkillInstallTransactionManager.recoverTransaction 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/core/agent/skill_install_transaction.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f32ac1a7f945e62aad1dc5119786f9f2cdda6f86032cafdf167ac97bb51db6e"}},{"ruleId":"D1","level":"warning","message":{"text":"BackendHttp.request (cyclomatic 25): BackendHttp.request 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/core/cloud_sync/backend/backend_http.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2748edcf3e9987432891592751221f971445275363f9e4cd42e1711cf5ca29e"}},{"ruleId":"D1","level":"warning","message":{"text":"WebDavOperationInventory.findExisting (cyclomatic 25): WebDavOperationInventory.findExisting 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/core/cloud_sync/backend/webdav_operation_inventory.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f920d3c821c958aa25f5ebdbfbb7a9b9aec2ade2c3abfc141f75f68c0429aa0d"}},{"ruleId":"D1","level":"warning","message":{"text":"PipeParser._splitPipeSegments (cyclomatic 25): PipeParser._splitPipeSegments 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/core/utils/comfyui_prompt_parser/pipe_parser.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc94ad91e0b9f347f4d02d537a1c071e4600888fe3544a1a11271b6d2386712"}},{"ruleId":"D1","level":"warning","message":{"text":"NaiPromptExportCodec._project (cyclomatic 25): NaiPromptExportCodec._project 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/data/models/gallery/nai_prompt_export_codec.dart"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"98929d0eeee804c75e5c320f16bf88e16864629975bddd33a298b89edebb1b68"}},{"ruleId":"D1","level":"warning","message":{"text":"_ArchiveRecord.parse (cyclomatic 25): _ArchiveRecord.parse has cyclomatic complexity 25 (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/data/services/precise_ref_library_archive_service.dart"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"c108b6eb1889efad7cb5b9bfb9752e3a95caa7edb23e1a2c8b3ec8256a010872"}},{"ruleId":"D1","level":"warning","message":{"text":"_AgentChatResourcePickerBodyState._buildLocalGallery (cyclomatic 25): _AgentChatResourcePickerBodyState._buildLocalGallery 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/presentation/agent_chat/widgets/agent_chat_resource_widgets.dart"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fd1ef3164ec6eb1c2ca679223424f9b0629f8b2503c7c650d4947bba45f2a9"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentChatThreadModel.fromMessages (cyclomatic 25): AgentChatThreadModel.fromMessages 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/presentation/agent_chat/widgets/agent_chat_turn.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5a2575a2fc51bb8b282d33a71dab3b6df2860f1b0814e31d1ee8e85f837ea3"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAiResponsesAdapter._buildAgentPayload (cyclomatic 25): OpenAiResponsesAdapter._buildAgentPayload 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/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ea18637fba51fecec31657fdb64f9ada57c64d01cf41cf598de8043714053b"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageSendActionDispatcher.handle (cyclomatic 25): ImageSendActionDispatcher.handle has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/services/image_send_action_dispatcher.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba74304486ea1a46e18001cc45ffe7b0c90e60831e5e948a06b360216cc67fac"}},{"ruleId":"D1","level":"warning","message":{"text":"_AutocompleteWrapperState._onKeyEvent (cyclomatic 25): _AutocompleteWrapperState._onKeyEvent 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/presentation/widgets/autocomplete/autocomplete_wrapper.dart"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c88dff8772046271cc3af7f001cc4037301cc58508ebd0487803d23391ec1c4"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionState.applyMutation (cyclomatic 24): SessionState.applyMutation 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/core/agent/harness/session/session_state.dart"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5aacbe123abe6a9f63719cc912aa76dff5af83e2cb6e8981f11598874830fd"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionState._matchesRecordQuery (cyclomatic 24): SessionState._matchesRecordQuery has cyclomatic complexity 24 (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/core/agent/harness/session/session_state.dart"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2d5bbf7f590b00a572fc5308a52df6702fa4fc338b474791068cccdc75665e"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptTokenParser.editChangesActiveToken (cyclomatic 24): PromptTokenParser.editChangesActiveToken has cyclomatic complexity 24 (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/core/autocomplete/prompt_token_parser.dart"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f71b2dedd4b506269e5cb1396cda6448acf2ffce2bec123e10aeb06d55f68f2"}},{"ruleId":"D1","level":"warning","message":{"text":"VibeFileParser._extractEncodingDetails (cyclomatic 24): VibeFileParser._extractEncodingDetails 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/core/utils/vibe_file_parser.dart"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03509d4a70a675fdefa81ccc2c5ab7d2607b8558c5b721a9b10faf6dd7134ee"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentToolPermissionController.beforeToolCall (cyclomatic 24): AgentToolPermissionController.beforeToolCall has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/agent_tool_permission_controller.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac616361cf0f6436946bfaf18ba4d8c5de9c640a0f0e959e736d45c8833254be"}},{"ruleId":"D1","level":"warning","message":{"text":"AnthropicMessagesAdapter.buildAgentPayload (cyclomatic 24): AnthropicMessagesAdapter.buildAgentPayload 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/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc624bc2f9934bdf8b1d4d7c40ed22ba6eb741ab37bbd40864ace0921aba013"}},{"ruleId":"D1","level":"warning","message":{"text":"HistoryImageCard.build (cyclomatic 24): HistoryImageCard.build has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/widgets/history_panel/history_image_card.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7b96350e0892560d73869ea878a1df14677f4ce56b8d2f96049c3d52e9dc37"}},{"ruleId":"D1","level":"warning","message":{"text":"MosaicEditorActionsBar.build (cyclomatic 24): MosaicEditorActionsBar.build has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/mosaic/mosaic_editor_actions_bar.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"462afc234b2d857b387bca7f7a8ad92e55b59c0df5c842e5107c4f83614bad54"}},{"ruleId":"D1","level":"warning","message":{"text":"_PreciseRefSelectorDialogState.build (cyclomatic 24): _PreciseRefSelectorDialogState.build has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/precise_ref_library/widgets/precise_ref_selector_dialog.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b2c5a16e1783748a7f3d1e1b08f26ba4398e9c7b4111f052b3a34b111099b1"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionOverlay.build (cyclomatic 24): CompletionOverlay.build has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/autocomplete/completion_overlay.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c4ce41d4752b1ddebbecedb77e8111ffee3aae7a538621498ee556a254dbcb"}},{"ruleId":"D1","level":"warning","message":{"text":"_PromptCopyDialogState._buildExportOptions (cyclomatic 24): _PromptCopyDialogState._buildExportOptions 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/presentation/widgets/common/image_detail/components/prompt_copy_dialog.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"500684464f1908d19fe065e3dd8a2fc976f321911814e6e073f8827986003d39"}},{"ruleId":"D1","level":"warning","message":{"text":"_AlbumItemState.build (cyclomatic 24): _AlbumItemState.build has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/gallery/gallery_album_tree_view.dart"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa15153ef7c107bfc8d784d3d46ad3b56ea511b0c1f8d8792177234af8bd0aff"}},{"ruleId":"D1","level":"warning","message":{"text":"MagicWandController.apply (cyclomatic 24): MagicWandController.apply 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/presentation/widgets/image_editor/controllers/magic_wand_controller.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"776298d1fe2c4778d2c85cba6196b6131d1701731c6cb1b54e80b5dd34b35b91"}},{"ruleId":"D1","level":"warning","message":{"text":"_NavRailAccountButtonState._showAccountMenu (cyclomatic 24): _NavRailAccountButtonState._showAccountMenu has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/navigation/nav_rail_account_button.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe944f18a6e51781927a95c53dfd533e9c3b2c4b72c2acc3be7becb0f307ac8"}},{"ruleId":"D1","level":"warning","message":{"text":"krita_bridge_direct_probe_no_write._main (cyclomatic 24): krita_bridge_direct_probe_no_write._main has cyclomatic complexity 24 (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":"tool/krita/krita_bridge_direct_probe_no_write.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a6d6dbfc27e307b1fe70485cae6908f6056427ef4d61471494c5b13f852b71"}},{"ruleId":"D1","level":"warning","message":{"text":"_DriveFile.fromJson (cyclomatic 23): _DriveFile.fromJson has cyclomatic complexity 23 (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/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd670df8274e702931b461b80522ef8ca95370cf9a28ddc5cb4c3d3809006935"}},{"ruleId":"D1","level":"warning","message":{"text":"BoundedTransferScheduler.run (cyclomatic 23): BoundedTransferScheduler.run 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/core/cloud_sync/bounded_transfer_scheduler.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a84be6cd28ef8215d23d93ddb10aa123ea83c47a07690a6eed6ff0d207042b"}},{"ruleId":"D1","level":"warning","message":{"text":"NAIImageRequestBuilder.buildBaseParameters (cyclomatic 23): NAIImageRequestBuilder.buildBaseParameters has cyclomatic complexity 23 (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/core/network/request_builders/nai_image_request_builder.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe60be59be3d5c3ca323153c8e41ea730a16ffb2ac93cdca20de18606a3ea96"}},{"ruleId":"D1","level":"warning","message":{"text":"NaiPromptParser._splitByDelimiters (cyclomatic 23): NaiPromptParser._splitByDelimiters 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/core/utils/nai_prompt_parser.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fd73a091b641374ff27bb800130bb6b8760d4cb20e7d18384c0c3a06552dda"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptEditDocument._parse (cyclomatic 23): PromptEditDocument._parse 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/core/utils/prompt_edit_document.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1781440dbe5df513ed49391bb43087ff8e97920939dfce99a6de3102bbeb6c"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptTagUtils.splitTopLevel (cyclomatic 23): PromptTagUtils.splitTopLevel 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/core/utils/prompt_tag_utils.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ed48d07f90ba08f728d62b190b70c8cda79f1427bacde8f1ca7e1a79da22b6"}},{"ruleId":"D1","level":"warning","message":{"text":"WatermarkLogoService._detectExtension (cyclomatic 23): WatermarkLogoService._detectExtension has cyclomatic complexity 23 (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/core/watermark/watermark_logo_service.dart"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"3568db9f4ce17616d4e077598c6bcbf5bbbad533525037d59e684ef62630f47b"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptAssistantConfigState._isUntouchedLegacyPollinationsDefault (cyclomatic 23): PromptAssistantConfigState._isUntouchedLegacyPollinationsDefault has cyclomatic complexity 23 (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/data/models/prompt_assistant/prompt_assistant_models.dart"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05dc86c551b0b32a188c7dec2b9391b778cda16b5dfcadd1323630e57db1ace"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAiChatCompletionsAdapter._mapAgentMessage (cyclomatic 23): OpenAiChatCompletionsAdapter._mapAgentMessage 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/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4422049a5c27b10ec204d94a00fb1644ebaca0d7729c463bd26db6884d6998"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageGenerationService._execute (cyclomatic 23): ImageGenerationService._execute has cyclomatic complexity 23 (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/presentation/providers/generation/image_generation_service.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c604a7beaa630268cbd9e0bfb059e03eba1193eaf9cfd5b722c87584b8371c4"}},{"ruleId":"D1","level":"warning","message":{"text":"_AutocompleteWrapperState._buildOverlay (cyclomatic 23): _AutocompleteWrapperState._buildOverlay has cyclomatic complexity 23 (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/presentation/widgets/autocomplete/autocomplete_wrapper.dart"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe1de0654d52ad4ed42ecde700b14d95b776c3c0fc4a8eb7e2203645c1729f0"}},{"ruleId":"D1","level":"warning","message":{"text":"_BulkProgressDialogState.build (cyclomatic 23): _BulkProgressDialogState.build 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/presentation/widgets/bulk_progress_dialog.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e96e99892f05b33d22f1182be1231886fcae60da82db31f0da53fd4019657d"}},{"ruleId":"D1","level":"warning","message":{"text":"_FavoriteIconButtonState.build (cyclomatic 23): _FavoriteIconButtonState.build 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/presentation/widgets/common/animated_favorite_button.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"52df14c24555311603beb127d2ebe8633aeb31a20996d01a85bdcead9e4125b0"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalDropActionCoordinator.processDroppedFile (cyclomatic 23): GlobalDropActionCoordinator.processDroppedFile has cyclomatic complexity 23 (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/presentation/widgets/drop/global_drop_action_coordinator.dart"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fe128cf0720b9c086958baae1bfa652eb0df62fa715978b79e471cfed7e0d4"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryCardLeftStatusOverlays.build (cyclomatic 23): OnlineGalleryCardLeftStatusOverlays.build has cyclomatic complexity 23 (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/presentation/widgets/online_gallery/online_gallery_card_status_overlays.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80841b3d753477246106b1da09799488e4b05da96f662bde29c6d2ffb065207"}},{"ruleId":"D1","level":"warning","message":{"text":"TagEditorSession.apply (cyclomatic 23): TagEditorSession.apply 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/presentation/widgets/prompt/tag_editor_session.dart"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53d6634b87c8f7965fe26b7899ac21ab1668807747f39e14a74ef2035bb1830"}},{"ruleId":"D1","level":"warning","message":{"text":"_TaskListItemState.build (cyclomatic 23): _TaskListItemState.build has cyclomatic complexity 23 (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/presentation/widgets/queue/task_list_item.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a1c1581307c86c0045b24eb040125e6939497fef04de706ccb64d7a531f126"}},{"ruleId":"D1","level":"warning","message":{"text":"SkillArchiveService.exportSkills (cyclomatic 22): SkillArchiveService.exportSkills 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/core/agent/skill_archive_service.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"339fca0d73dffc34e25779af16c25328995f7ff7c7c598579ccecd16ebc5cb09"}},{"ruleId":"D1","level":"warning","message":{"text":"ResumableSnapshotUploader.resume (cyclomatic 22): ResumableSnapshotUploader.resume has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/snapshot_uploader.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"989114ee781e1eaa41c1b13ce00a1a55190879d1b874f67307bf7a01146e8500"}},{"ruleId":"D1","level":"warning","message":{"text":"NAIImageRequestBuilder.buildVibeTransferParameters (cyclomatic 22): NAIImageRequestBuilder.buildVibeTransferParameters 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/core/network/request_builders/nai_image_request_builder.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa429721ec05b798866cbc6c125676a4734ef3ff44c7f40e096d4357fd138934"}},{"ruleId":"D1","level":"warning","message":{"text":"VerifiedResumableDownloader._downloadToPartFile (cyclomatic 22): VerifiedResumableDownloader._downloadToPartFile 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/core/services/verified_resumable_downloader.dart"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"075ba546e46f125d2a6b1da189d0e219332b8573afe8edcc7afb6f47225fe24f"}},{"ruleId":"D1","level":"warning","message":{"text":"NaiGenerationResponseProcessor.processMessagePackStream (cyclomatic 22): NaiGenerationResponseProcessor.processMessagePackStream 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/data/datasources/remote/nai_generation_response_processor.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9d48d5f8b45dde04becb83341c8ce42aaff541fc08ebdc64dafcccdd4182f4"}},{"ruleId":"D1","level":"warning","message":{"text":"FilterCriteria.hasFilters (cyclomatic 22): FilterCriteria.hasFilters has cyclomatic complexity 22 (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/data/services/gallery/gallery_filter_service.dart"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b596fb176cc7e3ebfa4e0b4719f8d8a03d5f311e83d3463a65f39d69ce064d0"}},{"ruleId":"D1","level":"warning","message":{"text":"FilterCriteria.cacheKey (cyclomatic 22): FilterCriteria.cacheKey has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/gallery/gallery_filter_service.dart"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2edffd2cf2fb34a62eaaad77bf89b709bc871769fb444bf73ac5b3b4c1b763e"}},{"ruleId":"D1","level":"warning","message":{"text":"QuickTagCloudParser.parseCodex (cyclomatic 22): QuickTagCloudParser.parseCodex has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/online_gallery/quick_tag_cloud_parser.dart"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cb1646e91ee3961cbcc3693d9e1831605fcc999f8f2be45e3bc2b4375add4d"}},{"ruleId":"D1","level":"warning","message":{"text":"_MobileGenerateButton.build (cyclomatic 22): _MobileGenerateButton.build has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/mobile_generation_chrome.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8af90ac520bb55435e51983cfbff175baadb31db4ed75390d77b12e218f9d2"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryScrollPrefetchCoordinator._requestNextIfNeeded (cyclomatic 22): OnlineGalleryScrollPrefetchCoordinator._requestNextIfNeeded has cyclomatic complexity 22 (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/presentation/screens/online_gallery/online_gallery_scroll_prefetch_coordinator.dart"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c63bceecc23525ff676fccf0a3d020e3aee1164588c4d2fd52127bac4913378"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryScrollPrefetchCoordinator.jumpToPageTarget (cyclomatic 22): OnlineGalleryScrollPrefetchCoordinator.jumpToPageTarget has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/online_gallery/online_gallery_scroll_prefetch_coordinator.dart"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"70598c6bb66c9fc22217695cbe732a02d322bc2dfcc84e263d541cafe96b5b6b"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryScrollPrefetchCoordinator.scheduleVisiblePrefetch (cyclomatic 22): OnlineGalleryScrollPrefetchCoordinator.scheduleVisiblePrefetch 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/presentation/screens/online_gallery/online_gallery_scroll_prefetch_coordinator.dart"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"92229884df5bea0167d14431e5b311cd0b42e85bf9e16f2aa7fdeb868e06cf67"}},{"ruleId":"D1","level":"warning","message":{"text":"_StorageSettingsSectionState.build (cyclomatic 22): _StorageSettingsSectionState.build 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/presentation/screens/settings/sections/storage_settings_section.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b392482a8c405bc7da6c48eaa9005db868e8df2165c34ac31c845df73ff8d198"}},{"ruleId":"D1","level":"warning","message":{"text":"_EntryCardState.build (cyclomatic 22): _EntryCardState.build has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/tag_library_page/widgets/entry_card.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"49353e6742f189658872dcdb192c175c32acd0cda2afa7558529dbe603ef4bde"}},{"ruleId":"D1","level":"warning","message":{"text":"_ElevatedCardState.build (cyclomatic 22): _ElevatedCardState.build has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/elevated_card.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e000155c5c9dd1f3e18466aba393f333ce5957126d06236906e7439b2cab9c8a"}},{"ruleId":"D1","level":"warning","message":{"text":"_ImageDetailViewerState._buildMainContent (cyclomatic 22): _ImageDetailViewerState._buildMainContent has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/image_detail/image_detail_viewer.dart"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a722a95b19448299e311c1a2f1460290ece843ce5be6d197c4ac062f229748e"}},{"ruleId":"D1","level":"warning","message":{"text":"TagEditorSession._changed (cyclomatic 22): TagEditorSession._changed 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/presentation/widgets/prompt/tag_editor_session.dart"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51f112571624b0b7ffbd1e438feffa29a611befe152a4c44440e63f4ba8b56b"}},{"ruleId":"D1","level":"warning","message":{"text":"_TagEditorViewState._action (cyclomatic 22): _TagEditorViewState._action has cyclomatic complexity 22 (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/presentation/widgets/prompt/tag_editor_view.dart"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b6fa9f8b0269a470a18a0bd6417737b0e2af920d15fad4c74099245b5e2abc"}},{"ruleId":"D1","level":"warning","message":{"text":"ReadHarnessTool.executeWithContext (cyclomatic 21): ReadHarnessTool.executeWithContext 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/core/agent/harness/tools/read.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8770deb49f8d285ca100647c09b858bdfc89a28edc8077ce9a76e89cb34b380"}},{"ruleId":"D1","level":"warning","message":{"text":"LoopbackCloudDriveOAuthClient._validatedIdentity (cyclomatic 21): LoopbackCloudDriveOAuthClient._validatedIdentity 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/core/cloud_sync/oauth/loopback_oauth_client.dart"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d855dfd62ce24a69f27f915a35f46e42265853b63342e29e70ce10073dcd96"}},{"ruleId":"D1","level":"warning","message":{"text":"CharacterPromptBlockParser.parse (cyclomatic 21): CharacterPromptBlockParser.parse 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/core/utils/character_prompt_block_parser.dart"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b342e4ad26a0e5a981844eae09d03ed3f465bcbf5b4d83a70899bc3429aed9"}},{"ruleId":"D1","level":"warning","message":{"text":"InpaintMaskUtils.fillMaskRegionAtPoint (cyclomatic 21): InpaintMaskUtils.fillMaskRegionAtPoint 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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c718ac056b9945f29e0e40e195edd21c213bc219ea5d9e91ece967729ff1d12"}},{"ruleId":"D1","level":"warning","message":{"text":"InpaintMaskUtils._officialWorkerBlur (cyclomatic 21): InpaintMaskUtils._officialWorkerBlur has cyclomatic complexity 21 (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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8f64ec3dbf99b23dd8aac6e568b4d61e2aaf135c9eaec0b7a93ff743e42fa7"}},{"ruleId":"D1","level":"warning","message":{"text":"NovelAiVibeCodec.validateSingleMap (cyclomatic 21): NovelAiVibeCodec.validateSingleMap 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/core/utils/novelai_vibe_codec.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bc170727950c73675be2df749ed5e8edf7675e9f9a56e7847be26b1d5e650b"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptEditDocument._span (cyclomatic 21): PromptEditDocument._span 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/core/utils/prompt_edit_document.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efe54928c2b44d067106b888a3e6cf8f066388459d1b46e3c2c21c7fd1655ac"}},{"ruleId":"D1","level":"warning","message":{"text":"VibeFileParser._parsePngIsolate (cyclomatic 21): VibeFileParser._parsePngIsolate 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/core/utils/vibe_file_parser.dart"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd4fa51675c2f709a4e6e2f49f7dbfc32488ae90987f1b3579e3f3931bde878"}},{"ruleId":"D1","level":"warning","message":{"text":"CloudSyncOperationStorage._validRecordIndex (cyclomatic 21): CloudSyncOperationStorage._validRecordIndex 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/data/cloud_sync/cloud_sync_operation_storage.dart"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"731a7cefa317e04d545d33016c2c41caa897a0f08f1b43ff9a914576b1e72a0a"}},{"ruleId":"D1","level":"warning","message":{"text":"AiTagGallerySourceAdapter._fetchList (cyclomatic 21): AiTagGallerySourceAdapter._fetchList 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/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"532ca1c8cbc4ab2fb1db814a9c3cce6df98131dafd27090b802e4d15b1c6f81c"}},{"ruleId":"D1","level":"warning","message":{"text":"AiTagGenerationInfo.toJson (cyclomatic 21): AiTagGenerationInfo.toJson has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/models/online_gallery/ai_tag_generation_info.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"808291347a96645d7eb7f70c6564901440fb0f51e60e3fcb97e31d6e81f510ab"}},{"ruleId":"D1","level":"warning","message":{"text":"CharacterCountResolver.getCountTag (cyclomatic 21): CharacterCountResolver.getCountTag 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/data/services/character_count_resolver.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2015c287318cb169a6677d727d1c1a4c15d26cdca093d76244f86716e570ced"}},{"ruleId":"D1","level":"warning","message":{"text":"TagToolbox._searchTags (cyclomatic 21): TagToolbox._searchTags 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/presentation/agent_chat/services/tag_toolbox.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7fb630c2118b41c3c3da3114df41fe4a89b75fa2baa68806f489f0e2b64e34"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryBlacklistNotifier.pushToCloud (cyclomatic 21): OnlineGalleryBlacklistNotifier.pushToCloud 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/presentation/providers/online_gallery_blacklist_provider.dart"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ae4083443f08dd764018e016d2ad27f6bb001e8c61ea239cf27e05071bca88"}},{"ruleId":"D1","level":"warning","message":{"text":"SubscriptionNotifier.build (cyclomatic 21): SubscriptionNotifier.build has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/subscription_provider.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7898534ef3b73976e939623a32b211abc31a45aa2838a02a1c9a12fcdc5894d9"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryGrid.build (cyclomatic 21): OnlineGalleryGrid.build has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/online_gallery/online_gallery_grid.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d63f31c80f4fdb4452bae7be96f832fc61f0d97387cf854d22be4c0fd109e35"}},{"ruleId":"D1","level":"warning","message":{"text":"_VibeLibraryContentViewState._sendEntryToGenerationWithParams (cyclomatic 21): _VibeLibraryContentViewState._sendEntryToGenerationWithParams 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/presentation/screens/vibe_library/widgets/vibe_library_content_view.dart"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0dbd30c74e6633828f7e3a1a926875f50a011320ab64f6f86e06e036fff2c5"}},{"ruleId":"D1","level":"warning","message":{"text":"WatermarkEditorControls.build (cyclomatic 21): WatermarkEditorControls.build 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/presentation/screens/watermark/watermark_editor_controls.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19efbadd7a09e9c1a6959a7190dad7e33cd301c225c397b720b815f8e1bad99"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageCardActionCatalog.build (cyclomatic 21): ImageCardActionCatalog.build has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/image_card_actions.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd613d2ef3df4b79499a4a8590a8d00af69f8719c9d1e6285e8434be819a32b"}},{"ruleId":"D1","level":"warning","message":{"text":"acceptance_report._manual_evidence_from_args (cyclomatic 21): acceptance_report._manual_evidence_from_args has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"krita_plugin/acceptance_report.py"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2914674660efee98496aa096f65cbe2a5081e652dd5dab7b8cebab4a6c7011"}},{"ruleId":"D1","level":"warning","message":{"text":"ThreeWayMerger.merge (cyclomatic 20): ThreeWayMerger.merge 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/core/cloud_sync/merge.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"0460aacf21db79ee9b7ea88f759dabb2b40fbb9704f7ec903c2e838b1149cb6b"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorCompressionPlan.resolve (cyclomatic 20): EditorCompressionPlan.resolve 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/core/utils/editor_compression_utils.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4affd4931d1cc8aaf8f9d81bb8a14357f3727531d6b38e2715d4e6011b3ceb"}},{"ruleId":"D1","level":"warning","message":{"text":"PngShareSource.parse (cyclomatic 20): PngShareSource.parse 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/core/utils/png_share_source.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"695e206955307694958edfa448f96db32c651f81c7d4e616aeae6d08fb77356d"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptEditDocument.emphasisRanges (cyclomatic 20): PromptEditDocument.emphasisRanges 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/core/utils/prompt_edit_document.dart"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"a962a34c2d032c9f6a1bf53f8107d25827ac48900d49088768a48bc03ef0edaf"}},{"ruleId":"D1","level":"warning","message":{"text":"VibeFileParser._extractBundleFromPngIsolate (cyclomatic 20): VibeFileParser._extractBundleFromPngIsolate 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/core/utils/vibe_file_parser.dart"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbea1447fa06fab72ffa5b72dd3bdb586f15a9697030e81041fd91eefdfe8457"}},{"ruleId":"D1","level":"warning","message":{"text":"VibeImageEmbedder._extractEncodingFromVibe (cyclomatic 20): VibeImageEmbedder._extractEncodingFromVibe 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/core/utils/vibe_image_embedder.dart"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"373eaab9c6dc7a1342756f44cdb7da120e90795dc7bde91c393acbb9a2b8d255"}},{"ruleId":"D1","level":"warning","message":{"text":"WatermarkRenderService.render (cyclomatic 20): WatermarkRenderService.render 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/core/watermark/watermark_render_service.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e3895db32601ad812139effc0f11f50a7a2bd079ed23b0e3fd53ab15cf2c41"}},{"ruleId":"D1","level":"warning","message":{"text":"VerifiedBlobStore.putStream (cyclomatic 20): VerifiedBlobStore.putStream 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/data/cloud_sync/verified_blob_store.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1eebf8fd1ff7d5f8d32c24960f595a13653b95abeb7efae286dbcfe35dec3e"}},{"ruleId":"D1","level":"warning","message":{"text":"AiTagGallerySourceAdapter._parseMetadata (cyclomatic 20): AiTagGallerySourceAdapter._parseMetadata 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/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fdd7d315ce9c23c4aa6f528efaf056fdc14d3a447caa441624e4dad35c5953"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryLocalFavoritesRepository._migrateQuickTagCloudFavorites (cyclomatic 20): OnlineGalleryLocalFavoritesRepository._migrateQuickTagCloudFavorites 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/data/repositories/online_gallery_local_favorites_repository.dart"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c303c7883b948e1d94c4b10972576aa2036442ae281afc4d61cc48140fd9ec"}},{"ruleId":"D1","level":"warning","message":{"text":"AuthState.parseError (cyclomatic 20): AuthState.parseError 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/data/services/auth_provider.dart"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3e0acfec1bb2c5f2550bf698a18d245dc15577582f490bccd1ea4c90369ccd"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalOnnxModelService._inferKind (cyclomatic 20): LocalOnnxModelService._inferKind has cyclomatic complexity 20 (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/data/services/local_onnx_model_service.dart"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82e3abaa6d7f90793beb0974c4e9e6721bd15afc3ff6d0d5f714e6155c9fc0b"}},{"ruleId":"D1","level":"warning","message":{"text":"AiTagGenerationParser.parse (cyclomatic 20): AiTagGenerationParser.parse 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/data/services/metadata/ai_tag_generation_parser.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f42623049644dd17315b0f5e237c534a0c063aece38cf119173bc95d961bbf"}},{"ruleId":"D1","level":"warning","message":{"text":"MetadataWorkerPool._initializeWorkers (cyclomatic 20): MetadataWorkerPool._initializeWorkers 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/data/services/metadata/metadata_worker_pool.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c741a6b6671d573eb64a83815a61b4b367cff8863bbd34ad206b6035e3b4b4b"}},{"ruleId":"D1","level":"warning","message":{"text":"QuickTagCloudParser.normalizeImages (cyclomatic 20): QuickTagCloudParser.normalizeImages has cyclomatic complexity 20 (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/data/services/online_gallery/quick_tag_cloud_parser.dart"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f15ea48f99c7b980f8266f4ef8dc5ec8d8f6817638770fe157104f892b23a19"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentImagePresentationService.present (cyclomatic 20): AgentImagePresentationService.present 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/presentation/agent_chat/services/image_presentation_toolbox.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"af11f864d78ef376034ca88b753e8ffdc88e0656bb37f9f0b2697c3d4278e3ff"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentChatPanelCoordinator._send (cyclomatic 20): AgentChatPanelCoordinator._send 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/presentation/agent_chat/widgets/agent_chat_panel_coordinator.dart"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58de523ebc6149ebf16ec8252b7cf6d300c01087b89293158b1b97ff1b87fb8"}},{"ruleId":"D1","level":"warning","message":{"text":"_AgentChatWorkTrailState.build (cyclomatic 20): _AgentChatWorkTrailState.build 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/presentation/agent_chat/widgets/agent_chat_turn.dart"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69acb822652382a84abf6bfb7544cf06ed89358f7bbf54ad0504638939dc4b7"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptAssistantService._detectImageMime (cyclomatic 20): PromptAssistantService._detectImageMime has cyclomatic complexity 20 (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/presentation/prompt_assistant/services/prompt_assistant_service.dart"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fec63555102ae8683b5b976c6f26f8608de252d1c8f9fc6780aec5843e64c37"}},{"ruleId":"D1","level":"warning","message":{"text":"FixedTagsNotifier.restoreUsageSnapshot (cyclomatic 20): FixedTagsNotifier.restoreUsageSnapshot 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/presentation/providers/fixed_tags_provider.dart"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b28c71978d396399475a080d14f06a7af48e68fe5c39bb6d85a0bb940d2259f"}},{"ruleId":"D1","level":"warning","message":{"text":"GenerationImageBatchActions._packSelectedImages (cyclomatic 20): GenerationImageBatchActions._packSelectedImages 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/presentation/screens/generation/services/generation_image_batch_actions.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9d9e803b64839e6ef2b4e1b30e4c0cf8d4766e8ac9312b657753bb5f66d049"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalGalleryActionCoordinator.packSelectedImages (cyclomatic 20): LocalGalleryActionCoordinator.packSelectedImages has cyclomatic complexity 20 (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. This is NOT this file\u0027s highest cyclomatic complexity: LocalGalleryActionCoordinator.routeImageAction (cyclomatic 21) 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/presentation/screens/local_gallery/local_gallery_action_coordinator.dart"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49c9a424eb19cf33ecb635ed81101d55757008cfc9d6ada3b00f67b6c606063"}},{"ruleId":"D1","level":"warning","message":{"text":"AssistantTaskThinkingField.build (cyclomatic 20): AssistantTaskThinkingField.build has cyclomatic complexity 20 (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/presentation/screens/settings/widgets/assistant_task_thinking_field.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"043c908eae2fa9bf2b71773ea7544917f15f8652634e8dcfb1a263cad0c36c86"}},{"ruleId":"D1","level":"warning","message":{"text":"_HeatmapChartState.build (cyclomatic 20): _HeatmapChartState.build has cyclomatic complexity 20 (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/presentation/screens/statistics/widgets/charts/heatmap_chart.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"14178a1849981b2bc61e36cf2e8114882d309ec4ffb10f550db9fa370830c5e4"}},{"ruleId":"D1","level":"warning","message":{"text":"_VibeExportDialogAdvancedState._export (cyclomatic 20): _VibeExportDialogAdvancedState._export 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/presentation/screens/vibe_library/widgets/vibe_export_dialog_advanced.dart"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"01431d408077d97e54e4360876cabdfadc154e988170873baa6e2792cfda2584"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateCheckDialog._buildActions (cyclomatic 20): UpdateCheckDialog._buildActions 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/presentation/widgets/common/update_check_dialog.dart"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c61631356003603303a9ec45a329d966c988c61ce699110f4d01eea56fa43fe"}},{"ruleId":"D1","level":"warning","message":{"text":"_GalleryCategoryTreeViewState._buildCategoryNode (cyclomatic 20): _GalleryCategoryTreeViewState._buildCategoryNode has cyclomatic complexity 20 (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/presentation/widgets/gallery/gallery_category_tree_view.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a5c7e2ba250b48fa1f58fec176c6d2467b8fb31754732e12290bcbae135b29"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorSessionInitializer._loadInitialImage (cyclomatic 20): EditorSessionInitializer._loadInitialImage 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/presentation/widgets/image_editor/controllers/editor_session_initializer.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a356fa9255dd74eaba7c0dc1b4e3f28588f92235c210902e6502160ac3aaf8c"}},{"ruleId":"D1","level":"warning","message":{"text":"_Model3dEditorScreenState.build (cyclomatic 20): _Model3dEditorScreenState.build 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/presentation/widgets/model3d_editor/model3d_editor_screen.dart"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c6416a48a8da929bd3428b75ddf23b1b95a5aa9212c46f36ed9be31d53d2f0"}},{"ruleId":"D1","level":"warning","message":{"text":"_GalleryDetailActionRailState._entries (cyclomatic 20): _GalleryDetailActionRailState._entries has cyclomatic complexity 20 (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/presentation/widgets/online_gallery/gallery_detail_action_rail.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9b293818fdf29feea2952f47b7e22dbfc0d8f338d62af801273935bbc62bfb"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueTaskDetailView.build (cyclomatic 20): QueueTaskDetailView.build has cyclomatic complexity 20 (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/presentation/widgets/queue/task_list_item.dart"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c60a76bd0ec52d6195193c2df88ebaeaa7c09ae1579741cd9459d2f7003bd7"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentProfileService.previewImport (cyclomatic 19): AgentProfileService.previewImport has cyclomatic complexity 19 (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/core/agent/agent_profile_service.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"340afa9550e7b5cdff25154a3cc13d11dcdaba5618ac183f72965fb90c7f0f62"}},{"ruleId":"D1","level":"warning","message":{"text":"DanbooruCompletionSource.search (cyclomatic 19): DanbooruCompletionSource.search 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/core/autocomplete/danbooru_completion_source.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d589d83814003ec2b78e237e5a97816030074d6db25a27a0d3ecfac28fa256bb"}},{"ruleId":"D1","level":"warning","message":{"text":"SnapshotManifest.SnapshotManifest (cyclomatic 19): SnapshotManifest.SnapshotManifest 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/core/cloud_sync/models.dart"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"45223a55502484f7df336c12fd556a63fac571b8110e755b75e4d6af98cd0e92"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptTokenCounterService._normalizePromptForCounting (cyclomatic 19): PromptTokenCounterService._normalizePromptForCounting has cyclomatic complexity 19 (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/core/services/prompt_token_counter_service.dart"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2e4dd8fb5a74efd706968319eabd7f8db26d1cae96dd0e4cb8ee3706c26dce"}},{"ruleId":"D1","level":"warning","message":{"text":"InpaintMaskUtils.prepareNovelAiInpaintMaskArtifacts (cyclomatic 19): InpaintMaskUtils.prepareNovelAiInpaintMaskArtifacts has cyclomatic complexity 19 (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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"958826ca8b337b943c740a4f243e8869718c29c7d716809e968b1e9623d1eda9"}},{"ruleId":"D1","level":"warning","message":{"text":"NovelAiVibeCodec._imageMimeType (cyclomatic 19): NovelAiVibeCodec._imageMimeType has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/novelai_vibe_codec.dart"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3032089a75d5eb431e59e460b2748f49ff374407fd38ca7e63acc130b245d35"}},{"ruleId":"D1","level":"warning","message":{"text":"AiTagGallerySourceAdapter.detail (cyclomatic 19): AiTagGallerySourceAdapter.detail 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/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd22e8e04fa1ac532e93d832eeac1f56c003f3bbaf97f631bf7b6f08a02db6f9"}},{"ruleId":"D1","level":"warning","message":{"text":"AiTagGenerationInfo.hasAnyParam (cyclomatic 19): AiTagGenerationInfo.hasAnyParam has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/models/online_gallery/ai_tag_generation_info.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5454a430d27ef2411531eb022c06633980477360740baf37aacb5c7b90966394"}},{"ruleId":"D1","level":"warning","message":{"text":"DanbooruAuth._loadSavedCredentials (cyclomatic 19): DanbooruAuth._loadSavedCredentials 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/data/services/danbooru_auth_service.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"960b904acbe5c252aff1c2f32d84336e5929dcdd46d86e0014b4af90faf994a6"}},{"ruleId":"D1","level":"warning","message":{"text":"FilterCriteria.copyWith (cyclomatic 19): FilterCriteria.copyWith has cyclomatic complexity 19 (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/data/services/gallery/gallery_filter_service.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccd2eee9e0083a6438fdc010d3ce586298deb73e7014251d075b2a8ccd2e4fb"}},{"ruleId":"D1","level":"warning","message":{"text":"ArtistChainParser._parseRange (cyclomatic 19): ArtistChainParser._parseRange 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/data/services/online_gallery/artist_chain_parser.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed6434165c7e67de19324da49973fd2cc2b1cc2246c6f895c01a0e1f607f1ec"}},{"ruleId":"D1","level":"warning","message":{"text":"VibeImportService._importParsedSources (cyclomatic 19): VibeImportService._importParsedSources 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/data/services/vibe_import_service.dart"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"7953ab1126f0b8461d191ceda84e715b186c59484dbf3aa8cf23798d952e1669"}},{"ruleId":"D1","level":"warning","message":{"text":"_AgentChatSessionPickerBodyState.build (cyclomatic 19): _AgentChatSessionPickerBodyState.build has cyclomatic complexity 19 (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/presentation/agent_chat/widgets/agent_chat_session_picker.dart"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09b5dda092378858f332a3d40a43817d1c1aff0476cf4951a4f91c6068f931c"}},{"ruleId":"D1","level":"warning","message":{"text":"_WorkItemGroupTileState.build (cyclomatic 19): _WorkItemGroupTileState.build 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/presentation/agent_chat/widgets/agent_chat_turn.dart"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f112cc08e6765445e420c6ae63a94ccb94607b27c5a8591c1553535c391afa8"}},{"ruleId":"D1","level":"warning","message":{"text":"_PromptAssistantOverlayState._runAction (cyclomatic 19): _PromptAssistantOverlayState._runAction 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/presentation/prompt_assistant/widgets/prompt_assistant_overlay.dart"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7c574d615e71e1b20445b406cb3063833a20f227d07e9437e8caf9f8496002"}},{"ruleId":"D1","level":"warning","message":{"text":"KritaBridgeService._generateImage (cyclomatic 19): KritaBridgeService._generateImage 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/presentation/providers/krita/krita_bridge_service.dart"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe89d05512a9ba14db427307d0e67f80e247b372ab29857efdb22bc36c195bcb"}},{"ruleId":"D1","level":"warning","message":{"text":"VibeImportHandler.saveToLibrary (cyclomatic 19): VibeImportHandler.saveToLibrary 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/presentation/screens/generation/handlers/vibe_import_handler.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"133c5dcea34a57c58320546df7b952685cfb507a19c53174ebf184bb5a18200e"}},{"ruleId":"D1","level":"warning","message":{"text":"_OnlineGalleryToolbarPresenter._buildPrimaryActions (cyclomatic 19): _OnlineGalleryToolbarPresenter._buildPrimaryActions 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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_feature.dart"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f57bcfe1d9fc2cc38d0dbc6167518467358e2833f290555661f02640bd7559"}},{"ruleId":"D1","level":"warning","message":{"text":"_WebAccessSettingsState.build (cyclomatic 19): _WebAccessSettingsState.build has cyclomatic complexity 19 (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/presentation/screens/settings/sections/web_access_settings.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14155f427e861bbd7dd9bd71bba4293cf0441e8a66ed87cc4d41bace4eb11cb"}},{"ruleId":"D1","level":"warning","message":{"text":"VibeDetailParamPanel._buildActionBar (cyclomatic 19): VibeDetailParamPanel._buildActionBar has cyclomatic complexity 19 (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/presentation/screens/vibe_library/widgets/vibe_detail/vibe_detail_param_panel.dart"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"827016bdbec423fb0eb960f754404945b1d1aa8141472515c32833c673cd3d84"}},{"ruleId":"D1","level":"warning","message":{"text":"VibeExportAdvancedExecutor.resolveEntryVibes (cyclomatic 19): VibeExportAdvancedExecutor.resolveEntryVibes 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/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_advanced_executor.dart"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd73293c941b85b34c4ddfcba48944448f819a4a78e05424ba40e21136a8f10"}},{"ruleId":"D1","level":"warning","message":{"text":"_VibeLibraryContentViewState._sendEntryToGeneration (cyclomatic 19): _VibeLibraryContentViewState._sendEntryToGeneration 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/presentation/screens/vibe_library/widgets/vibe_library_content_view.dart"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e200441766e64c600fc658f93b18f8c77d9f69b472386b9a2fc8a7bb2f49b86"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionOverlayHeader.build (cyclomatic 19): CompletionOverlayHeader.build 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/presentation/widgets/autocomplete/completion_overlay_header.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"832ac20a2fda336b2f2a4d4d7072c61f4f977ec0129bc14fef4731d9962c9e06"}},{"ruleId":"D1","level":"warning","message":{"text":"InpaintMaskActionsController.fillClosedMaskRegionsAt (cyclomatic 19): InpaintMaskActionsController.fillClosedMaskRegionsAt 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/presentation/widgets/image_editor/controllers/inpaint_mask_actions_controller.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a129cb4fc1273fe6104756929b4e9ec0af9a9fa7116096efb212c2d8496a36d3"}},{"ruleId":"D1","level":"warning","message":{"text":"GalleryDetailInfoPanel._buildCodexOverview (cyclomatic 19): GalleryDetailInfoPanel._buildCodexOverview has cyclomatic complexity 19 (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/presentation/widgets/online_gallery/gallery_detail_info_panel.dart"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ad79142aeed2be4f75e305e3dd889bc4ad0701cb8f1e5792ca174527e252cb"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryCardStatusOverlays.build (cyclomatic 19): OnlineGalleryCardStatusOverlays.build 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/presentation/widgets/online_gallery/online_gallery_card_status_overlays.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81a5c3b12f615e7260d52cc38959ef462306717317b6781a5a84e91568f3087"}},{"ruleId":"D1","level":"warning","message":{"text":"UnifiedPromptConfig.== (cyclomatic 19): UnifiedPromptConfig.== has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/unified/unified_prompt_config.dart"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"579541bf2947cd38d7cc4ba17a6624229695c377987767a55020068508e3d181"}},{"ruleId":"D1","level":"warning","message":{"text":"main::(anonymous)::blur (cyclomatic 19): main::(anonymous)::blur 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":"tool/diagnostics/nai_inpaint_parity_browser.cjs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"609641acbbed0e79c2d91d558fe62fbb397a7f7b205b8187aa576f74d4029d57"}},{"ruleId":"D1","level":"warning","message":{"text":"BashHarnessTool.executeWithContext (cyclomatic 18): BashHarnessTool.executeWithContext 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/core/agent/harness/tools/bash.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2beca8ea53c757c2e6e932f2aa2d84154082bf662cc67c715b9148424095715"}},{"ruleId":"D1","level":"warning","message":{"text":"ComfyUIWebSocketService._handleJsonMessage (cyclomatic 18): ComfyUIWebSocketService._handleJsonMessage 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/core/comfyui/comfyui_websocket_service.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"309680d0fda7465268717a9864d3d0c5317545a1532c3bfb362a4241822e1aa5"}},{"ruleId":"D1","level":"warning","message":{"text":"PixelSnapEngine._selectPitch (cyclomatic 18): PixelSnapEngine._selectPitch 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/core/services/pixel_snap/pixel_snap_engine.dart"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1bca0c9e8d4e0c8ad5656b8f78c9fd7037e938dc781e97f72d439c1a98816c"}},{"ruleId":"D1","level":"warning","message":{"text":"InpaintMaskGeometry.expandBinary (cyclomatic 18): InpaintMaskGeometry.expandBinary 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/core/utils/inpaint_mask/inpaint_mask_geometry.dart"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d98ab88f5a44e4370ca4dda981c5ccd652fbaf7edae4593b2765d658eb0ff4"}},{"ruleId":"D1","level":"warning","message":{"text":"OutpaintResolvedGeometry.== (cyclomatic 18): OutpaintResolvedGeometry.== has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/inpaint_outpaint_utils.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b18835ec72e2f19d905a7045405c8240c5de91d1fb6cccb03c3ff7f90149d9c"}},{"ruleId":"D1","level":"warning","message":{"text":"InpaintOutpaintUtils.materializeVirtualFrame (cyclomatic 18): InpaintOutpaintUtils.materializeVirtualFrame 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/core/utils/inpaint_outpaint_utils.dart"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"6370ba28a8c2923e2e6821414c2a1d33e7de9c7329f47a1c7670681fb4ce493c"}},{"ruleId":"D1","level":"warning","message":{"text":"VibeLibraryCloudSyncAdapter.validateRecord (cyclomatic 18): VibeLibraryCloudSyncAdapter.validateRecord has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/cloud_sync/vibe_library_cloud_sync_adapter.dart"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7450668ff7135f6adc98c09b12ff81c0c9211e5497d51014e6ee5c52cab99d"}},{"ruleId":"D1","level":"warning","message":{"text":"GalleryPromptCopyProjection.buildText (cyclomatic 18): GalleryPromptCopyProjection.buildText 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/data/models/online_gallery/gallery_prompt_projection.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d902b2b99d03c3077bb984afdc08815ee595642dd776cafd843428b413636ab"}},{"ruleId":"D1","level":"warning","message":{"text":"TagLibraryEntry.promptTagCount (cyclomatic 18): TagLibraryEntry.promptTagCount 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/data/models/tag_library/tag_library_entry.dart"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3862bda4e74ee6089385dd4fff153b760a7a47a8d6d94b3a3d01615ca225d212"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryBlacklistRepository._isValidV2 (cyclomatic 18): OnlineGalleryBlacklistRepository._isValidV2 has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/repositories/online_gallery_blacklist_repository.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb82f149b97787a9569e30c6f67f90a0da176c135a5070fd647d70fb4ad2f9c"}},{"ruleId":"D1","level":"warning","message":{"text":"GalleryStreamScanner.startScanning (cyclomatic 18): GalleryStreamScanner.startScanning 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/data/services/gallery/gallery_stream_scanner.dart"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"58037bfb539a0e881dc5068d858720252a23a23961efa9cc2dacce186d071d53"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalOnnxModelService.importTaggerFiles (cyclomatic 18): LocalOnnxModelService.importTaggerFiles 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/data/services/local_onnx_model_service.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0486f9fc8e9a67a7a085be5f15b98b8e426da970fb7465ece2fae0f69ca248"}},{"ruleId":"D1","level":"warning","message":{"text":"ComfyUiParser.parse (cyclomatic 18): ComfyUiParser.parse 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/data/services/metadata/metadata_text_decoder.dart"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"097b575b81d3447acce1df764a3b86a576e7eca9dc673247ad8a47b2ad792b88"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGallerySearchService.buildPlan (cyclomatic 18): OnlineGallerySearchService.buildPlan has cyclomatic complexity 18 (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/data/services/online_gallery/online_gallery_search_service.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a082fca707eb9d75fa5d5be533d548bfad51bdd7f7c2268308400ee7a122d67a"}},{"ruleId":"D1","level":"warning","message":{"text":"RandomPromptGenerator._generateFromPoolGroup (cyclomatic 18): RandomPromptGenerator._generateFromPoolGroup has cyclomatic complexity 18 (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/data/services/random_prompt_generator.dart"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1bf9274fca52bac983392719d5df6b1725c7dd65cc25154192c83e7c6a67ae"}},{"ruleId":"D1","level":"warning","message":{"text":"VibeFileDocumentCodec._findStableVibeIndex (cyclomatic 18): VibeFileDocumentCodec._findStableVibeIndex 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/data/services/vibe_file_document_codec.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adc7d65c4aae2309260ebd878738d03caf552b52d2541f275b5b8b299395a8e"}},{"ruleId":"D1","level":"warning","message":{"text":"VibeLibraryEntryWriter.updateEncodingModel (cyclomatic 18): VibeLibraryEntryWriter.updateEncodingModel 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/data/services/vibe_library_entry_writer.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"603ca15a67ef59b71fd34e4943c79324b6c630d608b389ce83e1290542233efc"}},{"ruleId":"D1","level":"warning","message":{"text":"GenerationQueueTaskService.queueTask (cyclomatic 18): GenerationQueueTaskService.queueTask has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/generation_queue_task_service.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0dc87043bd80bc621333b85c320d715713b80db827c044f27096470f51274c"}},{"ruleId":"D1","level":"warning","message":{"text":"_AgentChatToolResultTileState.build (cyclomatic 18): _AgentChatToolResultTileState.build has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/widgets/agent_chat_tool_widgets.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d98d20a8337fbad993082909e74891e449a6f735cda16eccaebc63fd1db0ab"}},{"ruleId":"D1","level":"warning","message":{"text":"AssistantModelCatalog.resolveProvider (cyclomatic 18): AssistantModelCatalog.resolveProvider has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/models/assistant_model_capability.dart"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"af660eb2b87e5d18f9ef6cb65ee8074ea6531a8fdddd637435fa53ac722af502"}},{"ruleId":"D1","level":"warning","message":{"text":"_ProviderQueue._execute (cyclomatic 18): _ProviderQueue._execute 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/presentation/prompt_assistant/services/assistant_request_scheduler.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"365863e82f0258fe938628953fa956e22f4bf9b83ae5a2f2198cb28a2edc11ed"}},{"ruleId":"D1","level":"warning","message":{"text":"MobileCollapsedPromptLauncher.build (cyclomatic 18): MobileCollapsedPromptLauncher.build 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/presentation/screens/generation/mobile_generation_workspace.dart"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ed1286f3faf24d33fdf48108136e4c957736fbf43a5dfad98eb8cc445523dd"}},{"ruleId":"D1","level":"warning","message":{"text":"_PreciseReferencePanelState.build (cyclomatic 18): _PreciseReferencePanelState.build has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/widgets/precise_reference_panel.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4fac3e5fc644faae9436f5594991d9d1954ba26a37e24b61a1047bfe657221"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGallerySelectionActions._buildReplicationTask (cyclomatic 18): OnlineGallerySelectionActions._buildReplicationTask 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/presentation/screens/online_gallery/online_gallery_selection_actions.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b9c8403e59487fa24b53af39b654c5b33809b5a6b6ad814ca7c01e76289383"}},{"ruleId":"D1","level":"warning","message":{"text":"_PreciseRefLibraryScreenState._importImages (cyclomatic 18): _PreciseRefLibraryScreenState._importImages 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/presentation/screens/precise_ref_library/precise_ref_library_screen.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1a33ae8c11203fb8f9283f78364416a041032803379ba623affb814b8026fc"}},{"ruleId":"D1","level":"warning","message":{"text":"_ComfyUISettingsSectionState.build (cyclomatic 18): _ComfyUISettingsSectionState.build 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/presentation/screens/settings/sections/comfyui_settings_section.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"62177edb16a2a70779c79256ecd33f86af630ad323a784feb8a50b816701b0b4"}},{"ruleId":"D1","level":"warning","message":{"text":"_GenerationSettingsSectionState.build (cyclomatic 18): _GenerationSettingsSectionState.build has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/settings/sections/generation_settings_section.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ae32b682d29031ab1613771d6b8a826023c5f11c83fd1f0eb9e34368290edb"}},{"ruleId":"D1","level":"warning","message":{"text":"_AnimatedRefreshButtonState.build (cyclomatic 18): _AnimatedRefreshButtonState.build has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/statistics/widgets/dashboard/animated_refresh_button.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b959746d802653f8054ff125cf7b48c5fd6ca77017044cd0fc3fdbcdb27289"}},{"ruleId":"D1","level":"warning","message":{"text":"_CategoryItemState.build (cyclomatic 18): _CategoryItemState.build has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c6a6cc20bc21d83ea7f5878be1a8dae6c0aa6a1d798201b06e98b529343cad"}},{"ruleId":"D1","level":"warning","message":{"text":"VibeImportController.importDrop (cyclomatic 18): VibeImportController.importDrop 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/presentation/screens/vibe_library/vibe_import_controller.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45c285a283d5e766c03216080950986a7b4d9a3cb9addaee6aecc1f5d318bf4"}},{"ruleId":"D1","level":"warning","message":{"text":"_Toolbar.build (cyclomatic 18): _Toolbar.build has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/vibe_library/vibe_library_workspace.dart"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"67254e3a87ad7d3110081dc99ff476ba068195d746e7e0e5c60a6cd57103a4f5"}},{"ruleId":"D1","level":"warning","message":{"text":"GenerationTransferConfiguration._resolveModel (cyclomatic 18): GenerationTransferConfiguration._resolveModel 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/presentation/services/generation_prompt_transfer_service.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f80f55152dbf93259a23beab347e3b8d9bdb2115c7825cee183ebf32a63d2af"}},{"ruleId":"D1","level":"warning","message":{"text":"_CredentialsLoginFormState.build (cyclomatic 18): _CredentialsLoginFormState.build 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/presentation/widgets/auth/credentials_login_form.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33a05d44b4be774e2c591185838ba60ab0dd395b84181b8cf493145900f6c22"}},{"ruleId":"D1","level":"warning","message":{"text":"_AutocompleteWrapperState._onTextChanged (cyclomatic 18): _AutocompleteWrapperState._onTextChanged 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/presentation/widgets/autocomplete/autocomplete_wrapper.dart"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8747969993e5ee24df193b4c7207831a226dc8b5a2ceb364bc9f27e6d003f9"}},{"ruleId":"D1","level":"warning","message":{"text":"_AutocompleteWrapperState._onCompletionStateChanged (cyclomatic 18): _AutocompleteWrapperState._onCompletionStateChanged has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/autocomplete/autocomplete_wrapper.dart"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1e6a67c64511773bc40449695aad6a4921afd23497b879fb2df1671eb76cae"}},{"ruleId":"D1","level":"warning","message":{"text":"_ActionButton.build (cyclomatic 18): _ActionButton.build has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/bulk_action_bar.dart"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f06ffbeeedeeb5e0a9aa1937e664218e1a9f4dc2924f64b802c0c54b07b13b"}},{"ruleId":"D1","level":"warning","message":{"text":"_DiscordShareDialogState._send (cyclomatic 18): _DiscordShareDialogState._send 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/presentation/widgets/discord_share/discord_share_dialog.dart"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"29877fc8a0f1c19a72d71a34ad12976c9130f4f5cbd5e128a4816e82b3899b63"}},{"ruleId":"D1","level":"warning","message":{"text":"_GalleryAlbumTreeViewState._buildAlbumContent (cyclomatic 18): _GalleryAlbumTreeViewState._buildAlbumContent has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/gallery/gallery_album_tree_view.dart"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0141c14a727e563eab0d0ba87994aad250bbab5b6bb7e64d79db4c25ba8b18"}},{"ruleId":"D1","level":"warning","message":{"text":"InputHandler.handlePointerDown (cyclomatic 18): InputHandler.handlePointerDown 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/presentation/widgets/image_editor/core/input_handler.dart"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bf176710ef5e8e151afb7e972a15cac25dba85cec07cb676f532ec9adb5da4"}},{"ruleId":"D1","level":"warning","message":{"text":"FixedTagsDialogView.build (cyclomatic 18): FixedTagsDialogView.build has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/fixed_tags_dialog_view.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1e1a4598f627fc30094aeb8c70c88056070de7d2e18a169bdbaadaebb5d43c"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptWeightEditing._partialTarget (cyclomatic 18): PromptWeightEditing._partialTarget has cyclomatic complexity 18 (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/presentation/widgets/prompt/prompt_weight_editing.dart"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad810c2229aec3f2a1a87ac1fb756baeb4ceee81f1084ba0e928c2700d6bdddd"}},{"ruleId":"D1","level":"warning","message":{"text":"_TaskListItemState._buildActionButtons (cyclomatic 18): _TaskListItemState._buildActionButtons 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/presentation/widgets/queue/task_list_item.dart"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"950691de39754372102802b119381114937fe2fc207755e89b5d2020008caf98"}},{"ruleId":"D1","level":"warning","message":{"text":"CooccurrenceDataPackService._initialize (cyclomatic 17): CooccurrenceDataPackService._initialize 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/core/autocomplete/cooccurrence_data_pack_service.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8832d26628d497ab96f020bd33e98357969d3e9aae0de54c5bd5b98991bdae52"}},{"ruleId":"D1","level":"warning","message":{"text":"TagCatalogRepository.search (cyclomatic 17): TagCatalogRepository.search 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/core/autocomplete/tag_catalog_repository.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6781ae9f1f91a9100bf34e96ab1802a65c4275fe2b9cd1437bbeac57195e27"}},{"ruleId":"D1","level":"warning","message":{"text":"GitHubBackendSupport.throwResponse (cyclomatic 17): GitHubBackendSupport.throwResponse has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/backend/github_backend_support.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce938786f4607cb4b72999ae00066244a2fab9119e880b78bc63a6e58be52c53"}},{"ruleId":"D1","level":"warning","message":{"text":"OneDriveApiClient._decodeItem (cyclomatic 17): OneDriveApiClient._decodeItem has cyclomatic complexity 17 (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/core/cloud_sync/backend/onedrive_api_client.dart"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"930c0e45902a2ec739410bf4b80b1be838778d95cf3b40426c3eaf2db978b1f8"}},{"ruleId":"D1","level":"warning","message":{"text":"McpStreamableHttpTransport._handlePost (cyclomatic 17): McpStreamableHttpTransport._handlePost 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/core/mcp/mcp_streamable_http_transport.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0c710302f5f37e5f06f1a2e7300a09b3a32e08afda3d312ca1d0fa6aecbc22"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryRetryInterceptor._isRetriableError (cyclomatic 17): OnlineGalleryRetryInterceptor._isRetriableError has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/online_gallery_retry_interceptor.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1d55dcb383cbd4926215f1e7a63605ee9136a6f675ad973f647faa0f1cf92c"}},{"ruleId":"D1","level":"warning","message":{"text":"InpaintMaskUtils.fillEditorMaskRegionAtPoint (cyclomatic 17): InpaintMaskUtils.fillEditorMaskRegionAtPoint has cyclomatic complexity 17 (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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"638fba322ce57267e92efc1cd81cb9d3d2a7348bdbc84a1202b20df0448bf1be"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptLiteralScanner._angleEnd (cyclomatic 17): PromptLiteralScanner._angleEnd 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/core/utils/prompt_literal_scanner.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b758056e699d60213b2130d1cf60fdc4a72d3d6f90c2955b2b265520613642e6"}},{"ruleId":"D1","level":"warning","message":{"text":"CloudSyncOperationStorage.readSnapshot (cyclomatic 17): CloudSyncOperationStorage.readSnapshot has cyclomatic complexity 17 (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/data/cloud_sync/cloud_sync_operation_storage.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb271b2cf76d54ab2eba05bbd055d5478b13ec2357bca5b0872894a2a0320b7"}},{"ruleId":"D1","level":"warning","message":{"text":"NaiGenerationTransport.buildGenerationMultipart (cyclomatic 17): NaiGenerationTransport.buildGenerationMultipart 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/data/datasources/remote/nai_generation_transport.dart"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6054877874c89a17b90a6d535c14eb579f04950ad8d01e37fdfe5346fc520583"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalGalleryRepository.loadRecords (cyclomatic 17): LocalGalleryRepository.loadRecords 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/data/services/gallery/local_gallery_repository.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69ed37afa5742da6cbe2ead10702721f8d4eea408add17dcbee41b11799b724"}},{"ruleId":"D1","level":"warning","message":{"text":"OnnxTaggerLabelFiles._parseVocabularyLabels (cyclomatic 17): OnnxTaggerLabelFiles._parseVocabularyLabels 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/data/services/local_onnx_tagger_labels.dart"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3be2cd2e84a4d308f05d06f2dfa5c7a9d7ce12e87bf0a92f431665e7dcfa6f"}},{"ruleId":"D1","level":"warning","message":{"text":"AiTagGenerationParser._parseNaiJson (cyclomatic 17): AiTagGenerationParser._parseNaiJson has cyclomatic complexity 17 (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/data/services/metadata/ai_tag_generation_parser.dart"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1f762d5daa0d8a050aeeba388452a203eba6942b8405c6afe49f1e8568f584"}},{"ruleId":"D1","level":"warning","message":{"text":"AiTagGenerationParser._buildNaiInfo (cyclomatic 17): AiTagGenerationParser._buildNaiInfo 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/data/services/metadata/ai_tag_generation_parser.dart"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"e929be8588fc92fdc7588555bd49ae76075eab46c1dae7654b56deddc14aba6d"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageMetadataContainerCodec._scanValidatedPngChunks (cyclomatic 17): ImageMetadataContainerCodec._scanValidatedPngChunks 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/data/services/metadata/image_metadata_container_codec.dart"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78897e1887dfb0d1378eb59337735f276275a01155d9a774c5e4b02a57582bf"}},{"ruleId":"D1","level":"warning","message":{"text":"NaiCommentComposer._fieldsComment (cyclomatic 17): NaiCommentComposer._fieldsComment 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/data/services/metadata/nai_comment_composer.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a040d4b1fd5c4073083060a0572f875be223b1a5db0ef4a2e0a5c2319eb6286"}},{"ruleId":"D1","level":"warning","message":{"text":"TagLibraryPortableThumbnailStore.stage (cyclomatic 17): TagLibraryPortableThumbnailStore.stage 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/data/services/tag_library_portable_thumbnail_store.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b796f94a3f0875609eb11dc51830c55ffe5f4976a6026a52c728350359e6689b"}},{"ruleId":"D1","level":"warning","message":{"text":"VibeFolderSync.syncFolderToHive (cyclomatic 17): VibeFolderSync.syncFolderToHive 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/data/services/vibe_folder_sync.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b00f77c43d0886e45fdb3e8975112ba996cfa7ac808b667b6a3e9787bb222bb"}},{"ruleId":"D1","level":"warning","message":{"text":"MetadataFilterCriteria.matches (cyclomatic 17): MetadataFilterCriteria.matches 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/domain/entities/gallery_image_entity.dart"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc8774e6c251b8734edbeccb28d5d81044d723617471c45f2d46110e3519e18"}},{"ruleId":"D1","level":"warning","message":{"text":"GenerationImageFavoriteToolbox.setFavorite (cyclomatic 17): GenerationImageFavoriteToolbox.setFavorite 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/presentation/agent_chat/services/generation_image_favorite_toolbox.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"7151a0857a6702f99cbf3051ef0c901298f1d772c09df1205edc7a06b97e7428"}},{"ruleId":"D1","level":"warning","message":{"text":"GenerationImageWorkflowService.open (cyclomatic 17): GenerationImageWorkflowService.open has cyclomatic complexity 17 (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/presentation/agent_chat/services/generation_image_workflow_service.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc5b2ea5d39219f5e36885ceff0807bfef5bef05f69a71afb5e33895591b102"}},{"ruleId":"D1","level":"warning","message":{"text":"McpImageResponseService._displayReferences (cyclomatic 17): McpImageResponseService._displayReferences 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/presentation/mcp/services/mcp_image_response_service.dart"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"489dd5fb97acc82abf98ab6d892e8b6772a9779ae305acaa541f2a6b29fbf983"}},{"ruleId":"D1","level":"warning","message":{"text":"AssistantModelMetadata._nativeEffort (cyclomatic 17): AssistantModelMetadata._nativeEffort has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/models/assistant_model_capability.dart"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76767a6e17eaf3da7bfa522287049fe5996070ebc0afb9af43cd2f00f50165e"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAiChatCompletionsAdapter._completeAgentNonStream (cyclomatic 17): OpenAiChatCompletionsAdapter._completeAgentNonStream 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/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b09df2d4073c8024b1fb1ec77a00d0a006beeaed32ea06ab6c5f01a385e0301"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryBlacklistNotifier._syncIncrementally (cyclomatic 17): OnlineGalleryBlacklistNotifier._syncIncrementally 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/presentation/providers/online_gallery_blacklist_provider.dart"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a07744368176426c00a9838956a577198bd83075163f20a82309514f8a39a93"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryNotifier.goToPage (cyclomatic 17): OnlineGalleryNotifier.goToPage 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/presentation/providers/online_gallery_provider.dart"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"687aa85db5893aae281f2e5b497b66c245cae17f5b6733583728b07a9af52b5e"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueExecutionNotifier._onGenerationStateChanged (cyclomatic 17): QueueExecutionNotifier._onGenerationStateChanged 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/presentation/providers/queue_execution_provider.dart"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9160e30671fb3d3bba177d24ee1114cf716361ab8d597609a7835bda7cc2cf"}},{"ruleId":"D1","level":"warning","message":{"text":"RandomPresetNotifier._loadPresets (cyclomatic 17): RandomPresetNotifier._loadPresets 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/presentation/providers/random_preset_provider.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a45c5029dee2df5b1d1d97a5d1d99bfed91f3132c524b8363a0ac9d0fc036d"}},{"ruleId":"D1","level":"warning","message":{"text":"SubscriptionNotifier._doFetchSubscription (cyclomatic 17): SubscriptionNotifier._doFetchSubscription 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/presentation/providers/subscription_provider.dart"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f19443c53c88fa67e0cb003ee92c011583226ba3d303ca38b22572247ba805a"}},{"ruleId":"D1","level":"warning","message":{"text":"DlssRuntimeCard.build (cyclomatic 17): DlssRuntimeCard.build 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/presentation/screens/dlss/dlss_runtime_card.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2612e41b881a5518681b2d131a663101931e23c1c3ec9f8ec76fbcddc8cd4c"}},{"ruleId":"D1","level":"warning","message":{"text":"GenerateButtonWithCost._buildPrimaryButton (cyclomatic 17): GenerateButtonWithCost._buildPrimaryButton 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/presentation/screens/generation/widgets/generation_controls/generate_button.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24c298abbccd7449173e2a9acbe55b6eb14e204e89697f85c70b7bcc8fdbdab"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryScrollPrefetchCoordinator.onScroll (cyclomatic 17): OnlineGalleryScrollPrefetchCoordinator.onScroll 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/presentation/screens/online_gallery/online_gallery_scroll_prefetch_coordinator.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"33896301c71ee48ccd579c5ccf7763ee44497ff035bbc7dbef38fa12004fd0da"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryRatingDropdown.build (cyclomatic 17): OnlineGalleryRatingDropdown.build 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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar.dart"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"abafb14e4abf9ad071f8ec4b34dab1e2f3518b722349ebf4126769cffd1388de"}},{"ruleId":"D1","level":"warning","message":{"text":"_PreciseRefLibraryScreenState.build (cyclomatic 17): _PreciseRefLibraryScreenState.build 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/presentation/screens/precise_ref_library/precise_ref_library_screen.dart"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"724371f882330032eda2b20dadefb77b3102362eb792d2b064bff7eb48efb2f4"}},{"ruleId":"D1","level":"warning","message":{"text":"_StackedAreaChartState._buildChartData (cyclomatic 17): _StackedAreaChartState._buildChartData 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/presentation/screens/statistics/widgets/charts/stacked_area_chart.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d5a15a6d5a056331a8b9a34fafa8dd8e4ed6bb68af2e62852addb01c4e9e4c"}},{"ruleId":"D1","level":"warning","message":{"text":"_EntryListItemState.build (cyclomatic 17): _EntryListItemState.build has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/tag_library_page/widgets/entry_list_item.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"106df60af4220f4b0220757d2ca7d7673091af84cd6c11e415c8f3344e46b0a2"}},{"ruleId":"D1","level":"warning","message":{"text":"VibeExportEmbedImageOptionCard.build (cyclomatic 17): VibeExportEmbedImageOptionCard.build has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_embed_and_encoding_sections.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e21669ec5f14631f56081b15cf157f27636ebf63b8b51766bd071625dadba8c"}},{"ruleId":"D1","level":"warning","message":{"text":"DroppedFileReader._resolve (cyclomatic 17): DroppedFileReader._resolve 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/presentation/utils/dropped_file_reader.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5ad937acf6748d80cdc38dc4c925fb342b7ea5623e247dec2b5e0a997a4ebf"}},{"ruleId":"D1","level":"warning","message":{"text":"_CardDragSourceState._prepareSession (cyclomatic 17): _CardDragSourceState._prepareSession 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/presentation/widgets/common/card_drag_source.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0026d35bdcbff33d687f188f1d7e90a5aa48403cbb4fd2e5cafa3bf4f7d79869"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateNoticeBanner.build (cyclomatic 17): UpdateNoticeBanner.build 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/presentation/widgets/common/update_notice_banner.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"724c70771601671a24d8c4ca9fcdcc10b501731e8bee30f6cc01d456db63b71e"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorCanvasResizeController.changeCanvasSize (cyclomatic 17): EditorCanvasResizeController.changeCanvasSize 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/presentation/widgets/image_editor/controllers/editor_canvas_resize_controller.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd1d01146d008752ba604c50b6cab4c6678efe9088123087ec55d270d08fdd3"}},{"ruleId":"D1","level":"warning","message":{"text":"_FillRequest.floodFill (cyclomatic 17): _FillRequest.floodFill 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/presentation/widgets/image_editor/tools/fill_tool.dart"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"445b806272ede1c2068df7ea7f76b16e11510c0c406f60b1c35c292852cd1fc2"}},{"ruleId":"D1","level":"warning","message":{"text":"TagEditorSession.replaceLabel (cyclomatic 17): TagEditorSession.replaceLabel 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/presentation/widgets/prompt/tag_editor_session.dart"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dba0a5ce33d635dec26a882e688ba39ac6a4d73f26540663649b7539eaf8a48"}},{"ruleId":"D1","level":"warning","message":{"text":"TagEditorSession.moveSelectedBefore (cyclomatic 17): TagEditorSession.moveSelectedBefore 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/presentation/widgets/prompt/tag_editor_session.dart"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"062e545cff869a5fe42c9f6714a215312e6bce93fa6fa349e9281febc7683da2"}},{"ruleId":"D1","level":"warning","message":{"text":"_TaskEditDialogState._buildParametersSection (cyclomatic 17): _TaskEditDialogState._buildParametersSection 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/presentation/widgets/queue/task_edit_dialog.dart"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb820d042f9a2c9b2cc8a3421be1fc48b2f1f615feac75a76c19072a4612e0da"}},{"ruleId":"D1","level":"warning","message":{"text":"_ShortcutBindingEditorState._processKeyCombination (cyclomatic 17): _ShortcutBindingEditorState._processKeyCombination 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/presentation/widgets/shortcuts/shortcut_binding_editor.dart"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"3030dbaa670aa2a032883729c3201241881f3ff090a1228ec142f420a8f89ef0"}},{"ruleId":"D1","level":"warning","message":{"text":"OleDataInspector.CaptureHBitmap (cyclomatic 16): OleDataInspector.CaptureHBitmap has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/ole_drag_inspector/windows/Program.cs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8049c95137d976d4f217594e75776e909ca998c1189aba5ce895c320878176d"}},{"ruleId":"D1","level":"warning","message":{"text":"CooccurrenceManifestCodec.parse (cyclomatic 16): CooccurrenceManifestCodec.parse has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/autocomplete/cooccurrence_manifest_codec.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93e1297e298bf42893ac6422cb4ef84039e7331b846ecd90c88a654932f3e07"}},{"ruleId":"D1","level":"warning","message":{"text":"ZhDictionaryService.installOrUpdate (cyclomatic 16): ZhDictionaryService.installOrUpdate 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/core/autocomplete/zh_dictionary_service.dart"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ae0ea7119634997f151b8d6a3c7e7fbfcd90a9e3a4df8c47b316dba20f485b"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalGalleryThumbnailMigration._isVerifiedLegacyThumbnail (cyclomatic 16): LocalGalleryThumbnailMigration._isVerifiedLegacyThumbnail 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/core/cache/local_gallery_thumbnail_migration.dart"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c061962f19abf3947e8c7da4d153bd2a21031fb94fa944986da414c45d39c438"}},{"ruleId":"D1","level":"warning","message":{"text":"GoogleDriveCloudSyncBackend._fetchInventory (cyclomatic 16): GoogleDriveCloudSyncBackend._fetchInventory 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/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"2753652572c1582975a6fa70ae1b7591f4c9caeac542c25646a85fc1aa8cb634"}},{"ruleId":"D1","level":"warning","message":{"text":"CloudDriveOAuthSession.fromJson (cyclomatic 16): CloudDriveOAuthSession.fromJson has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/oauth/cloud_drive_oauth_models.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b336d1ebd8b337516d46a1c0294fe966ec78cabb06685ba40663c7c35939aa4"}},{"ruleId":"D1","level":"warning","message":{"text":"GalleryExceptionConverter.convert (cyclomatic 16): GalleryExceptionConverter.convert 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/core/exceptions/gallery_exceptions.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64cc32c6d7851cb1ca7d049732c4651672b6bf46e7ed9f13f1cc9214f2df4bb"}},{"ruleId":"D1","level":"warning","message":{"text":"SafeWebReader.read (cyclomatic 16): SafeWebReader.read 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/core/network/web_access/safe_web_reader.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3adc326067fbead60daf27dc7fd48df77ebb3946372078eb815fd45eedd3ee"}},{"ruleId":"D1","level":"warning","message":{"text":"SearxngSearchClient.search (cyclomatic 16): SearxngSearchClient.search 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/core/network/web_access/searxng_search_client.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"554575cb53ed0aa7bb19dda8bb3a1259f6d732b6d8cac3b238e169642deff0bb"}},{"ruleId":"D1","level":"warning","message":{"text":"DibBitmapCodec.toBmpFile (cyclomatic 16): DibBitmapCodec.toBmpFile has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/dib_bitmap_codec.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eded82719832ff6f246d2a090fb51179f957b639f90fca6c858ee8e085acd63"}},{"ruleId":"D1","level":"warning","message":{"text":"TextSpaceConverter.convert (cyclomatic 16): TextSpaceConverter.convert 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/core/utils/text_space_converter.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"076a5de3df1d090c5448e277dbcde109b525b5de3659f355fbaf04c4e03885d2"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentSystemPromptCloudSyncAdapter.validateRecord (cyclomatic 16): AgentSystemPromptCloudSyncAdapter.validateRecord has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/cloud_sync/agent_cloud_sync_adapters.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"82efb79c527e3b605ac01333e7307bcbcf39834d5119005bab4e25bee2ccd340"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentSkillsCloudSyncAdapter._prepareRestorePlans (cyclomatic 16): AgentSkillsCloudSyncAdapter._prepareRestorePlans 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/data/cloud_sync/agent_cloud_sync_adapters.dart"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfcaf2e0709bbd1fa3f8df4c99819fa64e6bdc36e8616accb1bba048b9c18cc"}},{"ruleId":"D1","level":"warning","message":{"text":"NAIAuthApiService.validateToken (cyclomatic 16): NAIAuthApiService.validateToken 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/data/datasources/remote/nai_auth_api_service.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2ea330e7290317d8bb07e6e3488a0d580137a97ac116c65ddd297f4348635f"}},{"ruleId":"D1","level":"warning","message":{"text":"NaiImageMetadataRawDecoder.decode (cyclomatic 16): NaiImageMetadataRawDecoder.decode has cyclomatic complexity 16 (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/data/models/gallery/nai_image_metadata_raw_decoder.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53d6800d6603b9a4ab47a8031d4b9db863e798a18e742803ce930b9b2fe0b51"}},{"ruleId":"D1","level":"warning","message":{"text":"NaiImageMetadataRawDecoder._modelIdFromSourceText (cyclomatic 16): NaiImageMetadataRawDecoder._modelIdFromSourceText 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/data/models/gallery/nai_image_metadata_raw_decoder.dart"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e6aa0481c2551fc91ade9c671db83f5b5fae3f65886663d371790e4c60010b"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptAssistantConfigState.decode (cyclomatic 16): PromptAssistantConfigState.decode has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/models/prompt_assistant/prompt_assistant_models.dart"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0917bf0f7b1cd19ed8d56743fffffc947cfa12e3471998ac40afc3b8db15a7b"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalGalleryQuery.applyFilter (cyclomatic 16): LocalGalleryQuery.applyFilter 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/data/services/gallery/local_gallery_query.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"06eca2857a4efd34bee2dc5653f07c6f8c44d8c70577da40fe066251b2bcae0a"}},{"ruleId":"D1","level":"warning","message":{"text":"_OfficialRecipeEngine._dressInSeparates (cyclomatic 16): _OfficialRecipeEngine._dressInSeparates 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/data/services/official_random_prompt_generator.dart"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd13d3bf25d0ead4feb8aa49b65df44f7b9eab7f25caaac02f1eae765c3c6261"}},{"ruleId":"D1","level":"warning","message":{"text":"CharacterTagGenerator.generate (cyclomatic 16): CharacterTagGenerator.generate 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/data/services/strategies/character_tag_generator.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"02049c9dc0a492d8d8d2952cd1c09d73de6d2b9bb1631f97b50f07ba34db3623"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentChatPanelCoordinator._editUserMessage (cyclomatic 16): AgentChatPanelCoordinator._editUserMessage 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/presentation/agent_chat/widgets/agent_chat_panel_coordinator.dart"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"19eb29ba7f4b68c87c6461f8f105a4944be59367426a18d9a1e1caec157fa862"}},{"ruleId":"D1","level":"warning","message":{"text":"McpImageResponseService._imageContent (cyclomatic 16): McpImageResponseService._imageContent 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/presentation/mcp/services/mcp_image_response_service.dart"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"a335bababbfdef3c2aa9f7c9009312f2d6ceeb873f80434d9168464c51dd540d"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageWorkflowState.copyWith (cyclomatic 16): ImageWorkflowState.copyWith has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/generation/image_workflow_models.dart"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4c86d745d4b6a9a1d139972abc4d3a2433abbe400045863f309ddbb0f559ee"}},{"ruleId":"D1","level":"warning","message":{"text":"KritaBridgeNotifier.enable (cyclomatic 16): KritaBridgeNotifier.enable 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/presentation/providers/krita/krita_bridge_notifier.dart"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ef4c316c12e2be34581be299e07e6387ae25ce495c441bb638aceee9cd447f"}},{"ruleId":"D1","level":"warning","message":{"text":"ReversePromptNotifier.runChain (cyclomatic 16): ReversePromptNotifier.runChain 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/presentation/providers/reverse_prompt_provider.dart"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"2710960d0ac43cfa6bf90c838b29c32e1f3e723c84191d7cb42952dd25aee197"}},{"ruleId":"D1","level":"warning","message":{"text":"VibeImportHandler.importFromLibrary (cyclomatic 16): VibeImportHandler.importFromLibrary 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/presentation/screens/generation/handlers/vibe_import_handler.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf02c4ad0cb7878c519bdd80f6635dec613d48353726767c9bdbbfee5d2a0c90"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryPagination._buildBar (cyclomatic 16): OnlineGalleryPagination._buildBar has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/online_gallery/online_gallery_pagination.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff24843e247f2f005aca5071f25e362bbaded5cc989505630db0312b24d2504a"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlineGalleryToolbarSearch._buildSearchFields (cyclomatic 16): OnlineGalleryToolbarSearch._buildSearchFields has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_search.dart"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa9cb22fa2411a9ff28b07658f31d6393fc63bc58e911046d861605bae1ec92"}},{"ruleId":"D1","level":"warning","message":{"text":"_AgentSystemPromptEditorState.build (cyclomatic 16): _AgentSystemPromptEditorState.build has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/settings/sections/agent/system_prompt_editor.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"930c71523991cde19f7a0dc3a9c527fa46e7b946adca28e657051f0c2f1e4e87"}},{"ruleId":"D1","level":"warning","message":{"text":"_ProviderModelListState.build (cyclomatic 16): _ProviderModelListState.build has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/settings/sections/model_services/provider_models_card.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"232d2547f0fbbcfbd3035354c087c23a1e21bb7445d7e01ee1ec7076ed6be93c"}},{"ruleId":"D1","level":"warning","message":{"text":"_ZhDictionaryStatus.build (cyclomatic 16): _ZhDictionaryStatus.build has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/settings/widgets/data_source_cache_settings.dart"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba8c95f408a4b7846c888700f94c22bda407f0e6252898650a8eb608bb7e23d"}},{"ruleId":"D1","level":"warning","message":{"text":"_TagLibraryPageScreenState.build (cyclomatic 16): _TagLibraryPageScreenState.build has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/tag_library_page/tag_library_page_screen.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"030d4001ac94ad43e93eb742435db43110d0422f01c17decd54660d3871a9c92"}},{"ruleId":"D1","level":"warning","message":{"text":"_EntryListItemState._buildActions (cyclomatic 16): _EntryListItemState._buildActions 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/presentation/screens/tag_library_page/widgets/entry_list_item.dart"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27da0c5560831df1937f251533ef67f3a2dcabce8ca74ab5eafdbd37efdfeb6"}},{"ruleId":"D1","level":"warning","message":{"text":"VibeImportController._encodeImage (cyclomatic 16): VibeImportController._encodeImage 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/presentation/screens/vibe_library/vibe_import_controller.dart"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"991ff6da209237d6bb20c49d556eb4ddf9977b28079103f750f9d03f8450a130"}},{"ruleId":"D1","level":"warning","message":{"text":"VibeExportOptionCard.build (cyclomatic 16): VibeExportOptionCard.build has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_option_card.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8433782208f7548a7adbfe07b112082189c0f443795a9df239773b99a2cdffc9"}},{"ruleId":"D1","level":"warning","message":{"text":"GenerationHistoryStorageService._decodeRecord (cyclomatic 16): GenerationHistoryStorageService._decodeRecord has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/services/generation_history_storage_service.dart"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71be817a8d240155ec074d82a4a35517a67e751d737665898258b7373e6a036"}},{"ruleId":"D1","level":"warning","message":{"text":"MetadataImportApplier.applyPromptAndGenerationParams (cyclomatic 16): MetadataImportApplier.applyPromptAndGenerationParams 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/presentation/utils/metadata_import_applier.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c210fd85a6a0fd2c66553084a1a923aef67362e27b99b430bd4bb591be9188f3"}},{"ruleId":"D1","level":"warning","message":{"text":"AutocompleteUtils._parseCurrentTagSegment (cyclomatic 16): AutocompleteUtils._parseCurrentTagSegment 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/presentation/widgets/autocomplete/autocomplete_utils.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7715af83898a2ef10bc4434e021421ea3e9c189d7fe1cb6d38b36d45939764"}},{"ruleId":"D1","level":"warning","message":{"text":"AppStateView.build (cyclomatic 16): AppStateView.build has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/app_state_view.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10e41fd13e886705e6ab10e46bd88a2b345bae116ab9a9f39b45760972ae013"}},{"ruleId":"D1","level":"warning","message":{"text":"_ThumbnailItemState.build (cyclomatic 16): _ThumbnailItemState.build has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/image_detail/components/detail_thumbnail_bar.dart"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"350fb805c7fa6cbc481f1393e2992b3750fe3885b9d5a52c621ff925e7e33f74"}},{"ruleId":"D1","level":"warning","message":{"text":"_HoverPreviewCardInnerState.build (cyclomatic 16): _HoverPreviewCardInnerState.build has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/danbooru_post_card.dart"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"641a93530aef4fef02ea34632548f3e1a86da79023ce7d8d518dde93dde617ed"}},{"ruleId":"D1","level":"warning","message":{"text":"_PromptLibraryEntryDialogState.build (cyclomatic 16): _PromptLibraryEntryDialogState.build has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/drop/prompt_library_entry_dialog.dart"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9a3c6068924f23aee3f97ee3bcfbb7d84cedf8cc9ac1aeef6c111f6a4487e6"}},{"ruleId":"D1","level":"warning","message":{"text":"_PromptLibraryEntryDialogState._save (cyclomatic 16): _PromptLibraryEntryDialogState._save 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/presentation/widgets/drop/prompt_library_entry_dialog.dart"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b00fc7d5c2005444f62585ff17a9866277476da58625d5adc6bdd0e9bb4c16"}},{"ruleId":"D1","level":"warning","message":{"text":"_GelbooruCredentialsDialogState.build (cyclomatic 16): _GelbooruCredentialsDialogState.build has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/gelbooru_credentials_dialog.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c71e246c70714347a2d804c8bdc1bd4cd1a41eaddbe3e4a53214769ee40eaa"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorExitCoordinator.exportAndClose (cyclomatic 16): EditorExitCoordinator.exportAndClose 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/presentation/widgets/image_editor/controllers/editor_exit_coordinator.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"94acc5097f9cfb16981e3eb9a8b0abd29b79e84dbca10f28d1c25e21408c7f8d"}},{"ruleId":"D1","level":"warning","message":{"text":"KeyboardState.updateFromEvent (cyclomatic 16): KeyboardState.updateFromEvent 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: InputHandler.getCursor (cyclomatic 17) 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/presentation/widgets/image_editor/core/input_handler.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d4d5b92435966314bfce442a640bdb024aa00813fcd3a6cc9756acc5e3c581"}},{"ruleId":"D1","level":"warning","message":{"text":"GalleryDetailInfoPanel._buildItemBadges (cyclomatic 16): GalleryDetailInfoPanel._buildItemBadges has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/online_gallery/gallery_detail_info_panel.dart"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"935194019d16208d7fcf76453463f5d67f2debc71e158c636597d488e8ce62bf"}},{"ruleId":"D1","level":"warning","message":{"text":"NaiSyntaxController._applyComposingUnderline (cyclomatic 16): NaiSyntaxController._applyComposingUnderline 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/presentation/widgets/prompt/nai_syntax_controller.dart"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"048e6bb629310170c145facb2d2aedf86eb3c615782d96ce2baf7c54104ae15f"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptEditorToolbar.build (cyclomatic 16): PromptEditorToolbar.build has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/toolbar/prompt_editor_toolbar.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44fd2f95d4c1feff2c4902fd02c45bf79a141a938995d65b073f3ded2eb010b"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageGenerationCoordinator.execute (cognitive 236): ImageGenerationCoordinator.execute has cognitive complexity 236 (threshold 15). Drivers by points: if/else 29 (149 pts), loops 6 (36 pts), ternaries 5 (23 pts), error handling 4 (22 pts), boolean chains 6 (nesting depth added 186). 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/presentation/providers/generation/image_generation_coordinator.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8eeaef91cbe5f106543a585b1407b8898365d2b50ac7dc88569fad1cde3e1ee"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryPaginationService.load (cognitive 192): OnlineGalleryPaginationService.load has cognitive complexity 192 (threshold 15). Drivers by points: ternaries 36 (86 pts), if/else 25 (67 pts), boolean chains 31, loops 2 (6 pts), error handling 2 (nesting depth added 96). 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/presentation/providers/online_gallery_pagination_service.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db7576980df4ae1c147ab918b80f00154c112862f0731cd49dfa21be34e3086"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryFavoritesLoaderService.load (cognitive 145): OnlineGalleryFavoritesLoaderService.load has cognitive complexity 145 (threshold 15). Drivers by points: if/else 22 (57 pts), ternaries 29 (56 pts), boolean chains 19, error handling 4 (10 pts), loops 1 (3 pts) (nesting depth added 70). 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/presentation/providers/online_gallery_favorites_loader_service.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a71537e851a233777d062e0c30c1bcf1206392431f6b99e1fc2adf8d0cc434f"}},{"ruleId":"D2","level":"warning","message":{"text":"GeminiGenerateContentAdapter.completeAgent (cognitive 126): GeminiGenerateContentAdapter.completeAgent has cognitive complexity 126 (threshold 15). Drivers by points: if/else 22 (60 pts), ternaries 7 (44 pts), boolean chains 9, loops 3 (8 pts), match/switch 1 (4 pts), error handling 1 (nesting depth added 83). 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/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbb7d7b7f553e19b0105bbd7badc64bf2fb94a289da0984f1469752d2ae8df4"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAiChatCompletionsAdapter.completeAgent (cognitive 125): OpenAiChatCompletionsAdapter.completeAgent has cognitive complexity 125 (threshold 15). Drivers by points: if/else 31 (100 pts), loops 4 (13 pts), boolean chains 11, error handling 1 (nesting depth added 78). 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/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"529a45348262cc40c85d16adc0b101c4f21267af3b8e918c3572766e7d8716ec"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryRandomLoaderService.load (cognitive 121): OnlineGalleryRandomLoaderService.load has cognitive complexity 121 (threshold 15). Drivers by points: if/else 23 (52 pts), boolean chains 35, ternaries 13 (29 pts), loops 1 (2 pts), match/switch 1 (2 pts), error handling 1 (nesting depth added 47). 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/presentation/providers/online_gallery_random_loader_service.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d54def2d732dce7a917dc7b302fc7e3f6034dd78e851d45ed558a426a91e19"}},{"ruleId":"D2","level":"warning","message":{"text":"_DanbooruPostCardState._buildCard (cognitive 97): _DanbooruPostCardState._buildCard has cognitive complexity 97 (threshold 15). Drivers by points: if/else 25 (40 pts), ternaries 18 (36 pts), boolean chains 21 (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/presentation/widgets/danbooru_post_card.dart"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"b680cc5d65795e043564e2f63a143310bc38796c901846cc08cd233120d2536f"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAiResponsesAdapter.completeAgent (cognitive 95): OpenAiResponsesAdapter.completeAgent has cognitive complexity 95 (threshold 15). Drivers by points: if/else 26 (65 pts), boolean chains 11, ternaries 3 (11 pts), loops 2 (6 pts), error handling 1, match/switch 1 (nesting depth added 51). 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/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c573693281a692d52ff25d62032cdf2306cf2bc5b57722ab1a9b72d800885a29"}},{"ruleId":"D2","level":"warning","message":{"text":"nai_inpaint_parity_browser.main (cognitive 95): nai_inpaint_parity_browser.main has cognitive complexity 95 (threshold 15). Drivers by points: loops 23 (48 pts), if/else 18 (43 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 51). Most of this is not in the body itself: 2 of the 95 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 299, 377, 354, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/diagnostics/nai_inpaint_parity_browser.cjs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9ca6f2c009d5f0c90d67213ea3d856a45631c0d0382ec8f0d25e9e9f490e9f"}},{"ruleId":"D2","level":"warning","message":{"text":"PortableRecordCodec.decode (cognitive 94): PortableRecordCodec.decode has cognitive complexity 94 (threshold 15). Drivers by points: if/else 18 (60 pts), boolean chains 22, loops 3 (8 pts), error handling 2 (4 pts) (nesting depth added 49). 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/data/cloud_sync/portable_record_codec.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2853dba85d586a36564da21042a89a71dbfbdfb42ecc60e64909294dfcab8f25"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentChatEventController.handle (cognitive 89): AgentChatEventController.handle has cognitive complexity 89 (threshold 15). Drivers by points: if/else 18 (37 pts), ternaries 12 (31 pts), boolean chains 9, loops 4 (9 pts), match/switch 2 (3 pts) (nesting depth added 44). 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/presentation/agent_chat/services/agent_chat_event_controller.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc581280038c9f63ed6389e48ab0b9b061018ff5d26aa7ab42c05559b4655c58"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthNotifier._restoreStoredSession (cognitive 86): AuthNotifier._restoreStoredSession has cognitive complexity 86 (threshold 15). Drivers by points: if/else 27 (70 pts), error handling 3 (7 pts), boolean chains 5, loops 2 (4 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/data/services/auth_provider.dart"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7517dbd593df18b0d944dff1aa4164053524927f70f21d7e5b2c5760b65b63"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerationPreparationService.prepareForKind (cognitive 83): GenerationPreparationService.prepareForKind has cognitive complexity 83 (threshold 15). Drivers by points: if/else 29 (53 pts), error handling 6 (12 pts), ternaries 8 (12 pts), boolean chains 4, loops 2 (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/presentation/agent_chat/services/generation_preparation_service.dart"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2841d8b6892ccb5315e5e50c4e5895bf63918512b48688528b628747f63a00"}},{"ruleId":"D2","level":"warning","message":{"text":"GeminiGenerateContentAdapter._buildAgentPayload (cognitive 83): GeminiGenerateContentAdapter._buildAgentPayload has cognitive complexity 83 (threshold 15). Drivers by points: if/else 20 (52 pts), loops 6 (16 pts), boolean chains 8, match/switch 1 (4 pts), ternaries 1 (3 pts) (nesting depth added 47). 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/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"a190390e1d0043ea37e80e52603c8bda448735569fbeb9b8478300fabf3395a2"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageGenerationCoordinator._runRequest (cognitive 82): ImageGenerationCoordinator._runRequest has cognitive complexity 82 (threshold 15). Drivers by points: if/else 18 (64 pts), boolean chains 11, loops 2 (4 pts), error handling 1 (2 pts), ternaries 1 (nesting depth added 49). 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/presentation/providers/generation/image_generation_coordinator.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6731a26ba602b5d179397582f04439df325ee1ccb941c0ac64dc5e76482064"}},{"ruleId":"D2","level":"warning","message":{"text":"HiveStorageHelper._migrateFromOldLocation (cognitive 80): HiveStorageHelper._migrateFromOldLocation has cognitive complexity 80 (threshold 15). Drivers by points: if/else 18 (57 pts), error handling 3 (8 pts), loops 3 (7 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 50). 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/core/utils/hive_storage_helper.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"227ecbee380d4dbecc0f5a0178465f3b158dc2d756ae4ffd49a60b51fa2710ee"}},{"ruleId":"D2","level":"warning","message":{"text":"SpreadKernel._spread (cognitive 79): SpreadKernel._spread has cognitive complexity 79 (threshold 15). Drivers by points: if/else 8 (32 pts), ternaries 6 (22 pts), loops 7 (20 pts), boolean chains 5 (nesting depth added 53). 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/core/services/pixel_snap/internal/spread_kernel.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3f89e5dceb9f373f860c38eb08d0d4bbe218d42f1815cbc68e0ae465ef1d2d"}},{"ruleId":"D2","level":"warning","message":{"text":"AnthropicMessagesAdapter.completeAgent (cognitive 78): AnthropicMessagesAdapter.completeAgent has cognitive complexity 78 (threshold 15). Drivers by points: if/else 26 (57 pts), boolean chains 10, match/switch 2 (5 pts), loops 2 (3 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 36). 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/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"859df13f35637cf6efa33133de5fa0e4fc6a5d9c5b6921ca5d51e4bfe0d1cc01"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAiChatCompletionsAdapter._completeAgentNonStream (cognitive 78): OpenAiChatCompletionsAdapter._completeAgentNonStream has cognitive complexity 78 (threshold 15). Drivers by points: if/else 10 (50 pts), ternaries 2 (18 pts), loops 1 (7 pts), boolean chains 2, error handling 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/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"860bbe41442a33bce70562cfb5063be9f3cb5b9eced1165d57d08536187d1bae"}},{"ruleId":"D2","level":"warning","message":{"text":"_OfficialRecipeEngine._furryCharacter (cognitive 73): _OfficialRecipeEngine._furryCharacter has cognitive complexity 73 (threshold 15). Drivers by points: if/else 33 (49 pts), boolean chains 15, ternaries 5, loops 2, match/switch 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/official_random_prompt_generator.dart"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"688bd8f5035281f14ada85934423444d1ae21b67b04ae9c8ee1a782a93ba8349"}},{"ruleId":"D2","level":"warning","message":{"text":"_DetailTopBarActions._buildActions (cognitive 72): _DetailTopBarActions._buildActions has cognitive complexity 72 (threshold 15). Drivers by points: if/else 26 (41 pts), boolean chains 19, ternaries 5 (9 pts), match/switch 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/image_detail/components/detail_top_bar.dart"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"857e25739d0aae635ad8453c2d67267f32d148ce43b6f7a6d1824c335016ef8e"}},{"ruleId":"D2","level":"warning","message":{"text":"GalleryDetailInfoPanel.build (cognitive 69): GalleryDetailInfoPanel.build has cognitive complexity 69 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 22, ternaries 10 (17 pts), loops 3 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/online_gallery/gallery_detail_info_panel.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b15cecc0667db9756b53eac47332143abeb60fe094f0e636986d54441dbd7c"}},{"ruleId":"D2","level":"warning","message":{"text":"_QuickTagCloudToolbarState.build (cognitive 69): _QuickTagCloudToolbarState.build has cognitive complexity 69 (threshold 15). Drivers by points: if/else 20 (38 pts), ternaries 12 (15 pts), boolean chains 14, loops 1 (2 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/presentation/widgets/online_gallery/quick_tag_cloud_toolbar.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"81589735f06026bd6ba1dc26f1240c4d7e2a6822fdb7e38839a0dc9114aba14a"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentChatNotifier._sendMessage (cognitive 68): AgentChatNotifier._sendMessage has cognitive complexity 68 (threshold 15). Drivers by points: if/else 24 (43 pts), loops 3 (9 pts), ternaries 3 (8 pts), boolean chains 6, error handling 2 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/providers/agent_chat_notifier.dart"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ff5f8b98ed5c9dfd96ac139b7a637dcb82fac52a7eb7b2133e0f44393d6076"}},{"ruleId":"D2","level":"warning","message":{"text":"_VibeLibraryContentViewState._sendEntryToGenerationWithParams (cognitive 68): _VibeLibraryContentViewState._sendEntryToGenerationWithParams has cognitive complexity 68 (threshold 15). Drivers by points: if/else 12 (39 pts), ternaries 5 (21 pts), boolean chains 4, error handling 1 (4 pts) (nesting depth added 46). 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/presentation/screens/vibe_library/widgets/vibe_library_content_view.dart"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea95aacb188dc3ff913a103f2c49d3261dd2d5abadd43e1fdfb6c36149cf9ac"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionJsonlCodec.encode (cognitive 65): SessionJsonlCodec.encode has cognitive complexity 65 (threshold 15). Drivers by points: if/else 18 (46 pts), loops 6 (13 pts), match/switch 2 (6 pts) (nesting depth added 39). 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/core/agent/harness/session/jsonl/session_jsonl_codec.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c7bc629a97d436db8ad8e9f697eb796f2f1af77805861cf45589e00f06ec1d"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentChatMessages._messageTile (cognitive 65): AgentChatMessages._messageTile has cognitive complexity 65 (threshold 15). Drivers by points: if/else 15 (27 pts), ternaries 8 (23 pts), boolean chains 8, loops 2 (7 pts) (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/presentation/agent_chat/widgets/agent_chat_messages.dart"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"2535651ad8e357082cac9fee4b6c930b1893cde16dc59884273aeb06c50499db"}},{"ruleId":"D2","level":"warning","message":{"text":"_Img2ImgUpscaleSectionState.build (cognitive 63): _Img2ImgUpscaleSectionState.build has cognitive complexity 63 (threshold 15). Drivers by points: if/else 16 (36 pts), ternaries 8 (18 pts), boolean chains 9 (nesting depth added 30). 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/presentation/screens/generation/widgets/img2img_upscale_section.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6e561341c78ae539b270e86855bef6ff7aae44b700f02b3460e537d308422e"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataImportOptions.selectedCountFor (cognitive 62): MetadataImportOptions.selectedCountFor has cognitive complexity 62 (threshold 15). Drivers by points: boolean chains 41, if/else 21. 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/data/models/metadata/metadata_import_options.dart"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6622d076cf40d7195263ebeacae91beaaeb91bcc72d75f3454b09f37a0ae64"}},{"ruleId":"D2","level":"warning","message":{"text":"McpImageResponseService.prepare (cognitive 62): McpImageResponseService.prepare has cognitive complexity 62 (threshold 15). Drivers by points: if/else 18 (43 pts), boolean chains 10, ternaries 2 (6 pts), loops 1 (2 pts), error handling 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/mcp/services/mcp_image_response_service.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e261643dae61ea674255647071d1b6e3e769a9b41be9c7e2cfbf512965ef3de"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeFileParser._extractBundleFromPngIsolate (cognitive 61): VibeFileParser._extractBundleFromPngIsolate has cognitive complexity 61 (threshold 15). Drivers by points: if/else 10 (41 pts), error handling 3 (8 pts), loops 2 (8 pts), boolean chains 4 (nesting depth added 42). 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/core/utils/vibe_file_parser.dart"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cb9878bdb0ec0581629a15515f0b6e375115d31633e98d794471fdde9bce86"}},{"ruleId":"D2","level":"warning","message":{"text":"GalleryStreamScanner._processSingleFile (cognitive 61): GalleryStreamScanner._processSingleFile has cognitive complexity 61 (threshold 15). Drivers by points: if/else 20 (34 pts), ternaries 7 (18 pts), boolean chains 8, error handling 1 (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/data/services/gallery/gallery_stream_scanner.dart"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"478746cd3e40962ff7666387216b9cbb91d4eee37f8703e3337091c0572f8f78"}},{"ruleId":"D2","level":"warning","message":{"text":"ContiguousRegionSelector.selectRgba (cognitive 60): ContiguousRegionSelector.selectRgba has cognitive complexity 60 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 17, loops 8 (17 pts), ternaries 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/contiguous_region_selector.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"700b01bc9b2f2a030a4451c592182a49ba9186ff747be12076ad2fd11a9d4358"}},{"ruleId":"D2","level":"warning","message":{"text":"_MetadataImportDialogState._buildPromptSection (cognitive 60): _MetadataImportDialogState._buildPromptSection has cognitive complexity 60 (threshold 15). Drivers by points: if/else 17 (36 pts), ternaries 6 (18 pts), boolean chains 6 (nesting depth added 31). 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/presentation/widgets/metadata/metadata_import_dialog.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"640e6e05fea32e13b4d5b664f6a94f4abd580357437103a56db28a75d52e5b26"}},{"ruleId":"D2","level":"warning","message":{"text":"_VibeLibraryContentViewState._sendEntryToGeneration (cognitive 59): _VibeLibraryContentViewState._sendEntryToGeneration has cognitive complexity 59 (threshold 15). Drivers by points: if/else 13 (42 pts), ternaries 2 (9 pts), boolean chains 4, error handling 1 (4 pts) (nesting depth added 39). 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/presentation/screens/vibe_library/widgets/vibe_library_content_view.dart"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08cfa4c2562650b6a38b57707a0a09844caef306250c0c065dcbcf266eb82e9"}},{"ruleId":"D2","level":"warning","message":{"text":"AiTagGenerationInfoSection.build (cognitive 59): AiTagGenerationInfoSection.build has cognitive complexity 59 (threshold 15). Drivers by points: if/else 25 (30 pts), boolean chains 13, ternaries 5 (12 pts), loops 3 (4 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/presentation/widgets/online_gallery/ai_tag_generation_info_section.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6438b143bb87cdb35e8c00ea7782841bc44f25d23cc2068b9ae7ad9bb186f34"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeFileParser._parsePngIsolate (cognitive 56): VibeFileParser._parsePngIsolate has cognitive complexity 56 (threshold 15). Drivers by points: if/else 11 (40 pts), error handling 3 (8 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 35). 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/core/utils/vibe_file_parser.dart"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85b2fcf8f51afb2f060221a2a799fa6635a6aeb6c06107e83ba9f39e5110fe2"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeImportService._importParsedSources (cognitive 56): VibeImportService._importParsedSources has cognitive complexity 56 (threshold 15). Drivers by points: if/else 8 (25 pts), ternaries 6 (24 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (nesting depth added 37). 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/data/services/vibe_import_service.dart"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3f5b42db6d4a1eed384e581b8a94dc0cbe68c353bfcfa0789272a93a7658df"}},{"ruleId":"D2","level":"warning","message":{"text":"GalleryCategoryNotifier._moveCategoryToSlot (cognitive 55): GalleryCategoryNotifier._moveCategoryToSlot has cognitive complexity 55 (threshold 15). Drivers by points: ternaries 10 (25 pts), if/else 10 (21 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (2 pts), error handling 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/presentation/providers/gallery_category_provider.dart"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"24382745fd86d26d563bd5de92e825081f3dd2d693d8140d337071bce91b723d"}},{"ruleId":"D2","level":"warning","message":{"text":"_OfficialRecipeEngine._legacyCharacter (cognitive 54): _OfficialRecipeEngine._legacyCharacter has cognitive complexity 54 (threshold 15). Drivers by points: if/else 27 (42 pts), boolean chains 8, loops 2, match/switch 1, ternaries 1 (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/data/services/official_random_prompt_generator.dart"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4cde1e8c8b0c35426d49a8512854653f3516a3890fcd422e5f5b3cfd8005cf"}},{"ruleId":"D2","level":"warning","message":{"text":"WebDavCapabilityProbe.run (cognitive 51): WebDavCapabilityProbe.run has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 11, error handling 2 (6 pts), ternaries 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/backend/webdav_capability_probe.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"43aecbc440aa0bdef0311f091776acc0aa3e7c7f103cebf05f8a4d0cd0410039"}},{"ruleId":"D2","level":"warning","message":{"text":"AnthropicMessagesAdapter.buildAgentPayload (cognitive 51): AnthropicMessagesAdapter.buildAgentPayload has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (30 pts), loops 5 (13 pts), match/switch 1 (4 pts), ternaries 1 (3 pts), boolean chains 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/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"0773b00f00a06dfb636eb34a9e6b502ed11779459f2472484bb800c2288da41d"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageGenerationNotifier.generate (cognitive 51): ImageGenerationNotifier.generate has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (31 pts), error handling 4 (9 pts), boolean chains 6, ternaries 2 (3 pts), loops 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/image_generation_provider.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92c99cd626261633ad57330212565b0d3ea749b011b72aad837590399e4764d"}},{"ruleId":"D2","level":"warning","message":{"text":"_WatermarkEditorScreenState._buildActions (cognitive 51): _WatermarkEditorScreenState._buildActions has cognitive complexity 51 (threshold 15). Drivers by points: ternaries 12 (31 pts), boolean chains 11, if/else 7 (9 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/watermark/watermark_editor_screen.dart"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"1676164f2ece91186de7fd2f3c207b66e19b7d0df9fcb6ed319d4a9f68492c8a"}},{"ruleId":"D2","level":"warning","message":{"text":"QuickTagCloudQueryEngine.matchingRecords (cognitive 50): QuickTagCloudQueryEngine.matchingRecords has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (33 pts), boolean chains 8, loops 3 (5 pts), ternaries 4 (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/data/datasources/remote/online_gallery/quick_tag_cloud_query_engine.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"257fb94738e1b42c70057b958c22689f9bda6a5978dd19df075a0976e37c7c7c"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillArchiveExtractor.extract (cognitive 49): SkillArchiveExtractor.extract has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (32 pts), error handling 4 (8 pts), loops 3 (5 pts), boolean chains 4 (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/core/agent/skill_archive_extractor.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a99d56f7fa2776efe63f7144f23a21037169c78ede64fcaac5f63bab662d2e6"}},{"ruleId":"D2","level":"warning","message":{"text":"NaiGenerationResponseProcessor.processMessagePackStream (cognitive 49): NaiGenerationResponseProcessor.processMessagePackStream has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 3 (7 pts), error handling 2 (5 pts), boolean chains 4, ternaries 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/data/datasources/remote/nai_generation_response_processor.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"769a207966c2189a2df8bbd16f090695902a6f73b1add9190301180800aaceb0"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.handleKeyEvent (cognitive 49): InputHandler.handleKeyEvent has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (32 pts), boolean chains 10, match/switch 2 (4 pts), ternaries 1 (3 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/presentation/widgets/image_editor/core/input_handler.dart"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2998f2221aacce15351b11139a53ac2ad0dd63ab5b6a9b7cd3bf1a11129a9fb9"}},{"ruleId":"D2","level":"warning","message":{"text":"WebDavOperationInventory.findExisting (cognitive 48): WebDavOperationInventory.findExisting has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (38 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2, error handling 2 (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/core/cloud_sync/backend/webdav_operation_inventory.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"151d0f163d0bf5159e9448f5439589737a1620c9f44a0303d556c59696474410"}},{"ruleId":"D2","level":"warning","message":{"text":"TagSubCategoryHelper.classifyTag (cognitive 48): TagSubCategoryHelper.classifyTag has cognitive complexity 48 (threshold 15). Drivers by points: boolean chains 34, if/else 8 (11 pts), loops 2 (3 pts) (nesting depth added 4). 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/data/models/prompt/tag_category.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b64d0902d7f6283796a583fd6a34b521891b2a0ee8b6b405d1ee125e7eb201"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAiResponsesAdapter._buildAgentPayload (cognitive 48): OpenAiResponsesAdapter._buildAgentPayload has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 5 (12 pts), ternaries 2 (5 pts), match/switch 1 (4 pts), boolean chains 2 (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/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ae6e05313e7f4ef9758e29dddf2435d7ac7da5c212d6799752d750772f4af4"}},{"ruleId":"D2","level":"warning","message":{"text":"_OfficialRecipeEngine.generateFurry (cognitive 47): _OfficialRecipeEngine.generateFurry has cognitive complexity 47 (threshold 15). Drivers by points: if/else 22 (30 pts), loops 8 (15 pts), boolean chains 1, match/switch 1 (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/data/services/official_random_prompt_generator.dart"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8d670d8e43ec8aa25892972e68d9d068a540560be0241c3771e9fe5b94b107"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentChatThreadModel.fromMessages (cognitive 47): AgentChatThreadModel.fromMessages has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (31 pts), loops 5 (9 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/widgets/agent_chat_turn.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3e0bb68dff0e5d06c0ce060ef8dd38e68f604d19cc457eb325148f73e0c5f0"}},{"ruleId":"D2","level":"warning","message":{"text":"BackendHttp.request (cognitive 46): BackendHttp.request has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 5 (10 pts), error handling 3 (7 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/backend/backend_http.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"931c88313d454b0edb4d6b7cf7e6ea5ca4aa73cd746420199b58351a6f6dbbb8"}},{"ruleId":"D2","level":"warning","message":{"text":"CloudRecordMerger.merge (cognitive 46): CloudRecordMerger.merge has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (20 pts), ternaries 6 (15 pts), boolean chains 9, loops 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/core/cloud_sync/record_merge.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ed438bc58232ca2a3d50b24d34f91ba105f24e20175e0997961d3f214e6b96"}},{"ruleId":"D2","level":"warning","message":{"text":"AiTagGenerationParser.parse (cognitive 46): AiTagGenerationParser.parse has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (38 pts), boolean chains 3, ternaries 3, error handling 1 (2 pts) (nesting depth added 27). 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/data/services/metadata/ai_tag_generation_parser.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a753322b37788c4540caf17afec4b20844f548189553b8f531e229df03ade2cd"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageCardSurface._buildSurface (cognitive 46): ImageCardSurface._buildSurface has cognitive complexity 46 (threshold 15). Drivers by points: boolean chains 23, ternaries 10 (12 pts), if/else 10, loops 1 (nesting depth added 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/presentation/widgets/common/image_card_surface.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f99d8c5bbc8fb13373409c5626dfa37dbb05e31c1367fc72cbe51bccb1070f"}},{"ruleId":"D2","level":"warning","message":{"text":"VerifiedResumableDownloader._downloadToPartFile (cognitive 45): VerifiedResumableDownloader._downloadToPartFile has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (29 pts), ternaries 3 (8 pts), boolean chains 4, loops 2 (4 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/core/services/verified_resumable_downloader.dart"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"db26a5c53f2bc1c57406ac25ec978fceebc1325dd97e185f860fbd930cc739e6"}},{"ruleId":"D2","level":"warning","message":{"text":"ComfyUiParser.parse (cognitive 45): ComfyUiParser.parse has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (35 pts), boolean chains 6, loops 1 (3 pts), error handling 1 (nesting depth added 27). 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/data/services/metadata/metadata_text_decoder.dart"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b00396b4ca8414ce6b41c2338d38aefb3b976e298e6c13d90e9e4349fec61ff"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryToolbarAuthControls._buildUserButton (cognitive 45): OnlineGalleryToolbarAuthControls._buildUserButton has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 17 (34 pts), if/else 7 (9 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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_auth.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe887c93ae06abbcbd1d70511875aa3560176f85a18322d01b8dbb3a5d3e2f1c"}},{"ruleId":"D2","level":"warning","message":{"text":"NAIImageRequestBuilder.buildVibeTransferParameters (cognitive 44): NAIImageRequestBuilder.buildVibeTransferParameters has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (32 pts), error handling 2 (7 pts), loops 3 (5 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/request_builders/nai_image_request_builder.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb9eb67d6a64ee53f7aca139fc4c697a8fa8348c4ab4c78a5cd274ee023f118"}},{"ruleId":"D2","level":"warning","message":{"text":"InpaintMaskUtils._officialWorkerBlur (cognitive 44): InpaintMaskUtils._officialWorkerBlur has cognitive complexity 44 (threshold 15). Drivers by points: loops 13 (25 pts), if/else 7 (18 pts), boolean chains 1 (nesting depth added 23). 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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"3020fac4ad21c6d046c20ea9fb70763421ab591e676bff1ae7caf242701604a7"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAiChatCompletionsAdapter._mapAgentMessage (cognitive 44): OpenAiChatCompletionsAdapter._mapAgentMessage has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 4 (11 pts), match/switch 1 (4 pts), ternaries 2 (4 pts), boolean chains 2 (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/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e42366e107d30ad0f7bc231316f97c4f2abf6ec0d2d9bc45d90449386b3043"}},{"ruleId":"D2","level":"warning","message":{"text":"InpaintMaskGeometry.expandBinary (cognitive 43): InpaintMaskGeometry.expandBinary has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 7 (16 pts), ternaries 2 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/inpaint_mask/inpaint_mask_geometry.dart"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"060dc15eb18cb835cf55ae483890dedf050eab33de478b972866302ce90d5e49"}},{"ruleId":"D2","level":"warning","message":{"text":"_OfficialRecipeEngine.generateLegacy (cognitive 43): _OfficialRecipeEngine.generateLegacy has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (26 pts), loops 10 (16 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/official_random_prompt_generator.dart"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"85317f34489e4f34ca3a255022760ffb7162764a674b6c3e695de79bcbe54fe2"}},{"ruleId":"D2","level":"warning","message":{"text":"_AgentChatComposerState._editor (cognitive 43): _AgentChatComposerState._editor has cognitive complexity 43 (threshold 15). Drivers by points: boolean chains 19, if/else 12 (15 pts), ternaries 7 (9 pts) (nesting depth added 5). 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/presentation/agent_chat/widgets/agent_chat_composer.dart"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff4903a9e15f35d17dd680ab075b3683e77aacf1efa6bf6d11ec657362a9fc3"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeImportController.importDrop (cognitive 43): VibeImportController.importDrop has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 6 (13 pts), ternaries 1 (5 pts), boolean chains 2, error handling 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/presentation/screens/vibe_library/vibe_import_controller.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cc56713611bf44e1881c081b6176d5f203b1df25d526106dbf915d7a3e6455"}},{"ruleId":"D2","level":"warning","message":{"text":"_VibeExportDialogAdvancedState._export (cognitive 43): _VibeExportDialogAdvancedState._export has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (42 pts), error handling 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/vibe_library/widgets/vibe_export_dialog_advanced.dart"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"7543d22e3286caf921cecfeb1f26ed50be5e6ad12fb277cc13a93c5c87f4b6f8"}},{"ruleId":"D2","level":"warning","message":{"text":"NaiImageMetadata.upgradeFromRawJsonIfNeeded (cognitive 42): NaiImageMetadata.upgradeFromRawJsonIfNeeded has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 15 (29 pts), boolean chains 9, if/else 2 (3 pts), error handling 1 (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/data/models/gallery/nai_image_metadata.dart"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7afed107e40327e384933fbd93822e97bed91cafd9f2440831fcd2a7542bb7"}},{"ruleId":"D2","level":"warning","message":{"text":"_DanbooruPostCardState._buildActions (cognitive 42): _DanbooruPostCardState._buildActions has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (24 pts), ternaries 6 (9 pts), boolean chains 5, error handling 2 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/danbooru_post_card.dart"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe317e1a9de90f3c23402e3fccfd5dc3aecf58f5fdb9bd5223046fb79726752b"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillArchiveService.exportSkills (cognitive 41): SkillArchiveService.exportSkills has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (34 pts), loops 3 (4 pts), boolean chains 3 (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/core/agent/skill_archive_service.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec4043566d455d75d755f734df5615c24abaf5955d5cb29909f28b89619782b"}},{"ruleId":"D2","level":"warning","message":{"text":"AiTagGallerySourceAdapter._fetchList (cognitive 41): AiTagGallerySourceAdapter._fetchList has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (21 pts), ternaries 4 (10 pts), error handling 4 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"765a78a144ab78c9750bfafdb81da6231f31723fe770c24d661880bc0af1891e"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryLocalFavoritesRepository.query (cognitive 41): OnlineGalleryLocalFavoritesRepository.query has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 16, loops 2 (3 pts), ternaries 1 (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/data/repositories/online_gallery_local_favorites_repository.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d46a92e20b2043564180323625b5c71d6e8a62534131657eb615b461ca9ce75"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryToolbox._executeBrowse (cognitive 41): OnlineGalleryToolbox._executeBrowse has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 10, loops 2 (5 pts), match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/online_gallery_toolbox.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"542c1f7273998d47bfc7d65cf0d6fe2ef9c8a20d91cd02c037fbf92a74f2cb42"}},{"ruleId":"D2","level":"warning","message":{"text":"main::(anonymous)::dilate (cognitive 41): main::(anonymous)::dilate has cognitive complexity 41 (threshold 15). Drivers by points: loops 9 (23 pts), if/else 5 (18 pts) (nesting depth added 27). 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":"tool/diagnostics/nai_inpaint_parity_browser.cjs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de47c0a2666d80b6bbab9b024e7c33761119816a53f4748fd953081252b5e43"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerationImageBatchActions._packSelectedImages (cognitive 40): GenerationImageBatchActions._packSelectedImages has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (31 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (2 pts), error handling 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/presentation/screens/generation/services/generation_image_batch_actions.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9be2d778c327ba7add07f8fe3e4ebab463c7b15107819eb3e9a18dd60fe1e68"}},{"ruleId":"D2","level":"warning","message":{"text":"_PreciseRefSelectorDialogState.build (cognitive 40): _PreciseRefSelectorDialogState.build has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (23 pts), ternaries 8 (13 pts), boolean chains 4 (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/presentation/screens/precise_ref_library/widgets/precise_ref_selector_dialog.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb8bc83d100ea2b156e40bce8e3a8e75011a20fe068799a8e15e1841f3e9e4f"}},{"ruleId":"D2","level":"warning","message":{"text":"_TagEditorViewState._key (cognitive 40): _TagEditorViewState._key has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 11, ternaries 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/tag_editor_view.dart"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"949753dd37b48f805fb62824a431a104624afcfd028512e41c12a44af5851108"}},{"ruleId":"D2","level":"warning","message":{"text":"main::(anonymous)::blur (cognitive 40): main::(anonymous)::blur has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 9 (19 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/diagnostics/nai_inpaint_parity_browser.cjs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6c707b9187a403f2478a41c7502ab385a9175d2bc245b8e65239ffe071527a"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteGalleryAlbumRepository._moveAlbumToSlot (cognitive 39): SqliteGalleryAlbumRepository._moveAlbumToSlot has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 7 (10 pts), ternaries 5 (10 pts), boolean chains 4, match/switch 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/core/database/datasources/gallery_album_repository.dart"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"12dcfa7b57e56c52d687ba661c683567f4c3213cf0a2067e86b71c4732a6dff1"}},{"ruleId":"D2","level":"warning","message":{"text":"InpaintMaskUtils._dilateMask (cognitive 39): InpaintMaskUtils._dilateMask has cognitive complexity 39 (threshold 15). Drivers by points: if/else 3 (17 pts), loops 5 (15 pts), ternaries 1 (4 pts), boolean chains 3 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad799df21c61ecb713d122291339611dfbe8f3fa62dcdef213d0b724ce6f8c8"}},{"ruleId":"D2","level":"warning","message":{"text":"_OfficialRecipeEngine.generateCharacterPrompts (cognitive 39): _OfficialRecipeEngine.generateCharacterPrompts has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (23 pts), loops 8 (15 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/official_random_prompt_generator.dart"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"60463337337b02d727f3cfad0b156549de5f813a6cc2d74e33e4c87629bf2203"}},{"ruleId":"D2","level":"warning","message":{"text":"ArtistChainParser._parseRange (cognitive 39): ArtistChainParser._parseRange has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (7 pts), ternaries 2 (5 pts), boolean chains 4 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/online_gallery/artist_chain_parser.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ef77d359fd6650ab27c200e191d946555249862a5100ee0b683ad12eeafb4e"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryLocalFavoritesRepository._migrateQuickTagCloudFavorites (cognitive 38): OnlineGalleryLocalFavoritesRepository._migrateQuickTagCloudFavorites has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (22 pts), error handling 3 (9 pts), loops 3 (5 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/data/repositories/online_gallery_local_favorites_repository.dart"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"24242dc97e59499335b5966be8826f592cf7fa2c377f6b42c8f5661555c13a56"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptWeightEditing._resolveTarget (cognitive 38): PromptWeightEditing._resolveTarget has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 12, loops 4 (5 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/presentation/widgets/prompt/prompt_weight_editing.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2a4ff3e55c68a758530d50214c2363f3c7af35838420b22d498bbeabfad5f3"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillArchiveExtractor._preflightZipHeaders (cognitive 37): SkillArchiveExtractor._preflightZipHeaders has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 14, loops 2, 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/core/agent/skill_archive_extractor.dart"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec352d92ee4c4d5a1ebfb2170f501c378d878f2fb57fc072832ac1fc013243b"}},{"ruleId":"D2","level":"warning","message":{"text":"SafeWebReader.read (cognitive 37): SafeWebReader.read has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (23 pts), ternaries 2 (6 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/web_access/safe_web_reader.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"df353b624aa02d3e1049faca2e3304a3c9af27fae02091788412743939568e01"}},{"ruleId":"D2","level":"warning","message":{"text":"GalleryStreamScanner.startScanning (cognitive 37): GalleryStreamScanner.startScanning has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 6 (16 pts), boolean chains 2, loops 1 (2 pts), 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/data/services/gallery/gallery_stream_scanner.dart"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd61e0496af38d8c6ac83c4e6412401a076d2bd5105878160130b1d85b52256"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalGalleryRepository.loadRecords (cognitive 37): LocalGalleryRepository.loadRecords has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 6 (18 pts), if/else 9 (13 pts), error handling 2 (4 pts), loops 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/data/services/gallery/local_gallery_repository.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87065e8921c21346c3dbdb087ca2ec09b57d6c1aa8f8c6591bb5d4f16906b39"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeImportHandler.saveToLibrary (cognitive 37): VibeImportHandler.saveToLibrary has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 3 (9 pts), boolean chains 5, loops 1 (3 pts), error handling 1 (2 pts) (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/presentation/screens/generation/handlers/vibe_import_handler.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"99926d2b19715d61f4cf0a6d3593369dd85aebf9bd3754d247856c3f940b7119"}},{"ruleId":"D2","level":"warning","message":{"text":"_LocalGalleryToolbarState.build (cognitive 37): _LocalGalleryToolbarState.build has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 14 (21 pts), if/else 11 (13 pts), boolean chains 3 (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/presentation/widgets/gallery/local_gallery_toolbar.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bcfb8c2bb04ddcb95011d9d2360499c21112870b92ae861637601f88935cf87"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionState.applyMutation (cognitive 36): SessionState.applyMutation has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 2, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/harness/session/session_state.dart"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db5f3888a71efbf8fe803a25e862c97d1a61c7f82489752780f4cf89f620eb4"}},{"ruleId":"D2","level":"warning","message":{"text":"CooccurrenceDataPackService._install (cognitive 36): CooccurrenceDataPackService._install has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 11, ternaries 3 (6 pts), error handling 2, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/autocomplete/cooccurrence_data_pack_service.dart"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ffc46cd3b6c7eff051a79e4eedf644d607a3501f9d533a087ec578a6cc86bb"}},{"ruleId":"D2","level":"warning","message":{"text":"PipeParser._splitPipeSegments (cognitive 36): PipeParser._splitPipeSegments has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (28 pts), boolean chains 5, match/switch 1 (2 pts), loops 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/core/utils/comfyui_prompt_parser/pipe_parser.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fff092180a5dc94307980a7d21eed0e9641254ef5217ed304463e2ce08c5b81"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeFileParser._extractEncodingDetails (cognitive 36): VibeFileParser._extractEncodingDetails has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (22 pts), ternaries 4 (6 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (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/core/utils/vibe_file_parser.dart"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d4a251f63ce25f2e8f6f444889b40883a87b128ed44fa40952c65f3b00e24a"}},{"ruleId":"D2","level":"warning","message":{"text":"AiTagGallerySourceAdapter._parseMetadata (cognitive 36): AiTagGallerySourceAdapter._parseMetadata has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 9, ternaries 1 (5 pts), loops 1 (4 pts), error handling 1 (2 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/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbfb1e0eb265c4ef34a2a2cd7529e4d10a57f4e8f98d4ddbf9ff068c0f62771"}},{"ruleId":"D2","level":"warning","message":{"text":"_AgentChatComposerState._contextIndicator (cognitive 36): _AgentChatComposerState._contextIndicator has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 22 (26 pts), boolean chains 9, if/else 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/widgets/agent_chat_composer.dart"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bfbd0546243d70e0ab4198cec9a346ce1b2171d9d182b2b13b80e4ce46f1703"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentChatMessages.build (cognitive 36): AgentChatMessages.build has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 17, ternaries 6 (9 pts), if/else 8, loops 2 (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/presentation/agent_chat/widgets/agent_chat_messages.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"344d071d3f0905d1d7310ed8c2e2e30f725a23d564d8f9c15de30dfa10de2716"}},{"ruleId":"D2","level":"warning","message":{"text":"_OnlineGalleryContentPresenter._buildResolvedPostCard (cognitive 36): _OnlineGalleryContentPresenter._buildResolvedPostCard has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 20, boolean chains 11, if/else 5. 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/presentation/screens/online_gallery/online_gallery_content.dart"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1f8b62d8acefa697d4ba223d4c2985d02e2c13bdf6d310fe869de6d4da03b0"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorCanvasResizeController.changeCanvasSize (cognitive 36): EditorCanvasResizeController.changeCanvasSize has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (28 pts), boolean chains 5, error handling 1 (2 pts), ternaries 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/presentation/widgets/image_editor/controllers/editor_canvas_resize_controller.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4372b7f49725f27c7ba8d45b100f26fb7ab92cc54aaddea2c00ebb88523e2e0b"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedTransferScheduler.run (cognitive 35): BoundedTransferScheduler.run has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 9, loops 3 (5 pts), error handling 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/core/cloud_sync/bounded_transfer_scheduler.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"646a95e05d6ab966fd05bfcc580487d47366aa03ea01546e1968e8e74eba2ad7"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthState.parseError (cognitive 35): AuthState.parseError has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 4, match/switch 1 (4 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/data/services/auth_provider.dart"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d89b7889317240a8a21e1d9c279dad740ec290858639575caa4213ebfc6b2f8"}},{"ruleId":"D2","level":"warning","message":{"text":"DanbooruAuth._loadSavedCredentials (cognitive 35): DanbooruAuth._loadSavedCredentials has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (25 pts), error handling 2 (5 pts), boolean chains 3, match/switch 1 (2 pts) (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/data/services/danbooru_auth_service.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0414a9bf7be049e8762ab268a77ad7152355bf5eea75622bbf93249b0700eaa"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerationCharacterOrchestrator.normalizeExplicit (cognitive 35): GenerationCharacterOrchestrator.normalizeExplicit has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 7, ternaries 2 (4 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/generation_character_orchestration.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d581aabeb1b59da4ba86e19548607bce2e76309df627f6978e9fc8ba6f6af49c"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptAssistantService._toContentParts (cognitive 35): PromptAssistantService._toContentParts has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (28 pts), ternaries 1 (5 pts), loops 1 (2 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/presentation/prompt_assistant/services/prompt_assistant_service.dart"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"12af98bf9d6e4d1f518954e66cc8081fe859e0e0afbcd8aad16097910eb9c22d"}},{"ruleId":"D2","level":"warning","message":{"text":"MosaicEditorActionsBar.build (cognitive 35): MosaicEditorActionsBar.build has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 10 (19 pts), boolean chains 10, if/else 5 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/mosaic/mosaic_editor_actions_bar.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fda57ec938146e6b0aa2e975415aa81b1e9937057a4b5a635572a0e5ac955d"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryToolbarSourceControls._buildSecondaryControls (cognitive 35): OnlineGalleryToolbarSourceControls._buildSecondaryControls has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 8, ternaries 1 (3 pts), loops 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_source_controls.dart"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"938d081db97955a484bf6755270fbbe159176f9a733456111a2debdc78fb5226"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerationPromptTransferService.replaceMainPrompt (cognitive 35): GenerationPromptTransferService.replaceMainPrompt has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 12 (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/presentation/services/generation_prompt_transfer_service.dart"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"062f291fb7ce517450b1197739253b3213c8b1e4976b24a435413db774e68a56"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowAnalyzer.analyze (cognitive 34): WorkflowAnalyzer.analyze has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (20 pts), ternaries 3 (11 pts), loops 2 (3 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/core/comfyui/workflow_analyzer.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"23621e4d55685e1c89c70dcf77b360faee6185869ab580263ff6495cea797135"}},{"ruleId":"D2","level":"warning","message":{"text":"InpaintMaskUtils._erodeMask (cognitive 34): InpaintMaskUtils._erodeMask has cognitive complexity 34 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 2 (11 pts), boolean chains 4, ternaries 1 (4 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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"f220dfaee75e2dfa4ac53e38ec24735ecf675f1323a9930ea5fd6b4c5961807b"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptEditDocument._parse (cognitive 34): PromptEditDocument._parse has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 9, loops 3 (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/core/utils/prompt_edit_document.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdd5dca292ddd0ca9f8831bb0d1e4ddde879d0bb1d46f6718d05c4dc79d6b96"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentSkillsCloudSyncAdapter.validateRecord (cognitive 34): AgentSkillsCloudSyncAdapter.validateRecord has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 20, if/else 9 (14 pts) (nesting depth added 5). 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/data/cloud_sync/agent_cloud_sync_adapters.dart"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a5cc64cd8ee4f3c2562be9b543b7c767693056b2aff59b33e27edd689cb9b6"}},{"ruleId":"D2","level":"warning","message":{"text":"ReversePromptNotifier.runChain (cognitive 34): ReversePromptNotifier.runChain has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (30 pts), ternaries 1 (2 pts), boolean chains 1, error handling 1 (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/presentation/providers/reverse_prompt_provider.dart"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5571cf9412fe97576f5390fa97b7b1f62f9e15db77a3a1b324950c9a2cd5b39"}},{"ruleId":"D2","level":"warning","message":{"text":"_PreciseRefLibraryScreenState._importImages (cognitive 34): _PreciseRefLibraryScreenState._importImages has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (19 pts), error handling 2 (4 pts), loops 2 (4 pts), ternaries 1 (4 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/precise_ref_library/precise_ref_library_screen.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce99e8d1ec36b92558a84e1d6bb0584ddfc345f93d28237a2b775159186d318"}},{"ruleId":"D2","level":"warning","message":{"text":"_VibeCategoryItemState.build (cognitive 34): _VibeCategoryItemState.build has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 12 (14 pts), if/else 8 (12 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 7). 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/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b9d8ecd78f0bcd23403fd0c289092f3b4fbbfa454c7ece73da854435e8c0ef"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeExportEmbedImageOptionCard.build (cognitive 34): VibeExportEmbedImageOptionCard.build has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 9 (19 pts), if/else 8 (14 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_embed_and_encoding_sections.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba157dce851be60af417c93a84aa9c57b9cad1f6de686e6658a622a5d953896"}},{"ruleId":"D2","level":"warning","message":{"text":"CardActionButtons.build (cognitive 34): CardActionButtons.build has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 11, if/else 7 (9 pts), ternaries 6 (8 pts), loops 5 (6 pts) (nesting depth added 5). 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/presentation/widgets/common/card_action_buttons.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3c4ff1daad5fd1364f3eb47c8e5ebc8b71240a593e101cd33e93a6124e3d46"}},{"ruleId":"D2","level":"warning","message":{"text":"_PromptCopyDialogState._buildExportOptions (cognitive 34): _PromptCopyDialogState._buildExportOptions has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (26 pts), loops 6 (8 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/presentation/widgets/common/image_detail/components/prompt_copy_dialog.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6834b30f35e8c8a81940fbb7ed5f8f3f9196dca8a7f6e74bf71fe6748404e1"}},{"ruleId":"D2","level":"warning","message":{"text":"_CategoryItemState.build (cognitive 34): _CategoryItemState.build has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 11 (13 pts), boolean chains 5, match/switch 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/presentation/widgets/gallery/gallery_category_tree_view.dart"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0346a2ee7c64203d476e3ff0b6d0e9c45aebaf1fd3c02d2273057d9d705b7d7"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionOrchestrator.query (cognitive 33): CompletionOrchestrator.query has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 14, if/else 9 (11 pts), ternaries 5 (7 pts), error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/autocomplete/completion_orchestrator.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"984bb8e303eb5bf262a95348806a517e002ce05196eaf9a75a26cbe0e201618e"}},{"ruleId":"D2","level":"warning","message":{"text":"KritaBridgeServer._handleSocket (cognitive 33): KritaBridgeServer._handleSocket has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (23 pts), ternaries 2 (8 pts), loops 1 (2 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/core/krita/krita_bridge_server.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e23e47b7ae8a7d648b0be4b1a0f016e12b74a5d51f561b22afa512f56824ac"}},{"ruleId":"D2","level":"warning","message":{"text":"PreciseRefImageCodec.detectExtension (cognitive 33): PreciseRefImageCodec.detectExtension has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 28, if/else 5. 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/data/services/precise_ref_portable_importer.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f678ba708569bd12c1d5b365102cc044ea5a2e7474d05bbd8957861364254c"}},{"ruleId":"D2","level":"warning","message":{"text":"KritaBridgeService._generateImage (cognitive 33): KritaBridgeService._generateImage has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (2 pts), error handling 1 (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/presentation/providers/krita/krita_bridge_service.dart"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"851d45977923a83a74a1fefc716fa8e809fafaf0a66692ec4f658babd04e537b"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeImportHandler.importFromLibrary (cognitive 33): VibeImportHandler.importFromLibrary has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 4, ternaries 1 (4 pts), loops 1 (2 pts), error handling 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/presentation/screens/generation/handlers/vibe_import_handler.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"69aa76fc6871fb096490a71a19d0f311a50be761762337214913f7ab0e742563"}},{"ruleId":"D2","level":"warning","message":{"text":"_ComfyUISettingsSectionState.build (cognitive 33): _ComfyUISettingsSectionState.build has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 7 (17 pts), if/else 10 (15 pts), boolean chains 1 (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/presentation/screens/settings/sections/comfyui_settings_section.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7751ae7f77bdd96f541a76e99d95cd60ed24529db4e1a96b4cb2b752121387ca"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactIconButton.build (cognitive 33): CompactIconButton.build has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (15 pts), ternaries 9 (14 pts), boolean chains 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, 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/presentation/widgets/common/compact_icon_button.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67040ec7064925c1656cc79f7b0f41fa9bb60c3fcb3bf4e3a84ca8d6ff84e7c"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorResultExporter.buildEditorResult (cognitive 33): EditorResultExporter.buildEditorResult has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 22, ternaries 10, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/image_editor/export/editor_result_exporter.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30323168c8554fbb5d35078419f41a3ab0340c3cf03b33d61e87a6cc408f15f"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillInstallTransactionManager.recoverTransaction (cognitive 32): SkillInstallTransactionManager.recoverTransaction has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 6, loops 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/core/agent/skill_install_transaction.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"0518e01c1a0e262b6c6c8edd5bd3293b6d663c768dc2cd117bb698b48e49d7d8"}},{"ruleId":"D2","level":"warning","message":{"text":"DanbooruCompletionSource.search (cognitive 32): DanbooruCompletionSource.search has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 2 (5 pts), boolean chains 3, error handling 2, loops 1 (2 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/core/autocomplete/danbooru_completion_source.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c754d0e6be3946d4558d7ba7a2fdde36cbbefe3c444e6b533e72d4fb7229d39"}},{"ruleId":"D2","level":"warning","message":{"text":"NAIImageRequestBuilder.build (cognitive 32): NAIImageRequestBuilder.build has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 12, loops 2 (3 pts), ternaries 2 (nesting depth added 5). 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/core/network/request_builders/nai_image_request_builder.dart"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7bc029b3d6e83c8abdef5c2037e49cee500d119a1ece3407fa39fc2293f5d0"}},{"ruleId":"D2","level":"warning","message":{"text":"SearxngSearchClient.search (cognitive 32): SearxngSearchClient.search has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (19 pts), ternaries 2 (6 pts), error handling 3, boolean chains 2, loops 1 (2 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/core/network/web_access/searxng_search_client.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f6bdc60ebfecdf7983c226792cf6d6a47fe13ec89e9b4e66f0afa2bac43617"}},{"ruleId":"D2","level":"warning","message":{"text":"PngShareSource.parse (cognitive 32): PngShareSource.parse has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 7, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/png_share_source.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9784185d069bf89225116d498043814f23faa98e3729851c67f6e626396a552"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptTagUtils.splitTopLevel (cognitive 32): PromptTagUtils.splitTopLevel has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 7, match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/prompt_tag_utils.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b449bcaa167fb9c01a64d96f4bc3188fecb6a80240fb85a7bf74910ac51c3daa"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataWorkerPool._initializeWorkers (cognitive 32): MetadataWorkerPool._initializeWorkers has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (9 pts), boolean chains 5, error handling 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/metadata/metadata_worker_pool.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e154a4e45067af1fec435c8a50e70a80886dfc235fb29c0fe579b0d54e7fa53"}},{"ruleId":"D2","level":"warning","message":{"text":"_OfficialRecipeEngine._dressInSeparates (cognitive 32): _OfficialRecipeEngine._dressInSeparates has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 4 (nesting depth added 16). 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/data/services/official_random_prompt_generator.dart"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab48426bf7d20ad6b5cf0091820f8fd724030b9f543d8c162b0659d7f0f792c3"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentChatSessionController.beginRewindLastUserMessage (cognitive 32): AgentChatSessionController.beginRewindLastUserMessage has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (6 pts), error handling 2 (4 pts), boolean chains 3 (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/presentation/agent_chat/services/agent_chat_session_controller.dart"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3677911c1d7381124ce33ba1f292d0af0433e3fba484756d4939e68819de852"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerationInterrogationService._interrogateBytes (cognitive 32): GenerationInterrogationService._interrogateBytes has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (24 pts), error handling 2 (5 pts), boolean chains 3 (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/presentation/agent_chat/services/generation_interrogation_service.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"98850b2677a535af4e8b9af61901d08e5c9ce0243f9cd8670919df88200e2710"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryBlacklistNotifier.pushToCloud (cognitive 32): OnlineGalleryBlacklistNotifier.pushToCloud has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 5, error handling 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/presentation/providers/online_gallery_blacklist_provider.dart"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"026c1534b495f919eda3f3aaea54bbe9ee693d5d09c6f7cbe9f153505de1d46b"}},{"ruleId":"D2","level":"warning","message":{"text":"_PrivacySettingsSectionState.build (cognitive 32): _PrivacySettingsSectionState.build has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 19 (21 pts), boolean chains 8, if/else 2, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/settings/sections/privacy_settings_section.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e932f2b030c76532d1e7073d73f8e123d6fb4e0eb31555f240eccb0ea7687a"}},{"ruleId":"D2","level":"warning","message":{"text":"_StorageSettingsSectionState.build (cognitive 32): _StorageSettingsSectionState.build has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 11 (16 pts), if/else 10 (14 pts), boolean chains 1, error handling 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/presentation/screens/settings/sections/storage_settings_section.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ba5aff61651346e4379af543009ede502c66357e111c451e810bd40b2b4ed4"}},{"ruleId":"D2","level":"warning","message":{"text":"_AddToLibraryDialogState._save (cognitive 32): _AddToLibraryDialogState._save has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (23 pts), ternaries 2 (6 pts), loops 1 (2 pts), error handling 1 (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/presentation/widgets/common/add_to_library_dialog.dart"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5643368e72288fd343d0756bd1806540b5ac335a299234428b01c418cb1b8d2"}},{"ruleId":"D2","level":"warning","message":{"text":"krita_bridge_direct_probe_no_write._main (cognitive 32): krita_bridge_direct_probe_no_write._main has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 15, if/else 3 (8 pts), ternaries 4 (7 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/krita/krita_bridge_direct_probe_no_write.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4a980048ca8e4819e7105f4c786016385935f78705b7237445267ab481e955"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadHarnessTool.executeWithContext (cognitive 31): ReadHarnessTool.executeWithContext has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (21 pts), ternaries 3 (6 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/harness/tools/read.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"243704901269c7002f79a08d67d08073e91928c80f35821a04bbbf4779cce168"}},{"ruleId":"D2","level":"warning","message":{"text":"SafeWebReader._isBlockedIpv4 (cognitive 31): SafeWebReader._isBlockedIpv4 has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 20, if/else 11. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/web_access/safe_web_reader.dart"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f99c228d6c7399ac696a9d5bc8f25a9fe74de01fe0a229df77fa6eb109fdcfa"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeImageEmbedder._extractEncodingFromVibe (cognitive 31): VibeImageEmbedder._extractEncodingFromVibe has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 3 (4 pts), ternaries 3, boolean chains 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/core/utils/vibe_image_embedder.dart"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"200a3bc780563c71de557833bdb1d67d7ca49ff22ebb7d4f7ef419dbc2609b4e"}},{"ruleId":"D2","level":"warning","message":{"text":"UserTagLibraryCloudSyncAdapter.apply (cognitive 31): UserTagLibraryCloudSyncAdapter.apply has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 5 (9 pts), ternaries 2 (6 pts), error handling 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/data/cloud_sync/user_tag_library_cloud_sync_adapter.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8741df61ef753f4a728ff99181b73b460d19e60dc9cec2ee67d6ce48d648e5ba"}},{"ruleId":"D2","level":"warning","message":{"text":"NovelAiParser.parse (cognitive 31): NovelAiParser.parse has cognitive complexity 31 (threshold 15). Drivers by points: error handling 4 (16 pts), if/else 5 (13 pts), boolean chains 1, loops 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/data/services/metadata/metadata_text_decoder.dart"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2f137995359f0bd66ac3ccbd6a596920fadfd61e118f7ac12430b74681cc0a"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeFileDocumentCodec._findStableVibeIndex (cognitive 31): VibeFileDocumentCodec._findStableVibeIndex has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (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/data/services/vibe_file_document_codec.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e7330908ff0aa6918e02a20db577e74f8cf7fd8ad5bef7496a7caafb86a9d6"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeFolderSync.syncFolderToHive (cognitive 31): VibeFolderSync.syncFolderToHive has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (6 pts), error handling 2 (5 pts), ternaries 2 (5 pts), boolean chains 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/data/services/vibe_folder_sync.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30fd68d1d2c692b9a93ff88b92124be4ccb36ea50447a36937fceb3d24fce0b"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptInputEditor.build (cognitive 31): PromptInputEditor.build has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 17 (19 pts), boolean chains 9, if/else 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/widgets/prompt_input_editor.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f69f0729b2c51a0dd81912fdc59c5054662d09eb61774cdfe0a66716defedc4"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorSessionInitializer._loadInitialImage (cognitive 31): EditorSessionInitializer._loadInitialImage has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 7, error handling 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/presentation/widgets/image_editor/controllers/editor_session_initializer.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7f8cc28d23aea85ce47b9052ef614ed484356e4db8666416463946e80f0b8c"}},{"ruleId":"D2","level":"warning","message":{"text":"MagicWandController.apply (cognitive 31): MagicWandController.apply has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 10, ternaries 2, error handling 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/presentation/widgets/image_editor/controllers/magic_wand_controller.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44695bf8cd03c8c378f5f72643cf37423c2584e88c257c7f4b52aa86fb526fe"}},{"ruleId":"D2","level":"warning","message":{"text":"TagEditorSession.apply (cognitive 31): TagEditorSession.apply has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 9, loops 4 (5 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/presentation/widgets/prompt/tag_editor_session.dart"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c4346c2776c1ae808ff2042d6ceadab7cf65615ef9001ecabd26dd10c75980"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionJsonlLineStorage.readCompleteLinesSync (cognitive 30): SessionJsonlLineStorage.readCompleteLinesSync has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (5 pts), ternaries 1 (4 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/harness/session/jsonl/session_jsonl_line_storage.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cbae0fbd9ed6aada363ce464f399957fe294fcb45916294144dbf224324f8d"}},{"ruleId":"D2","level":"warning","message":{"text":"TagTranslationLookup.translateBatch (cognitive 30): TagTranslationLookup.translateBatch has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 5 (10 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/autocomplete/tag_translation_lookup.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"263b25b251a6ba9a65ede77b14cc3dea04e5a5399711b2809974e06ac1f811ca"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteGalleryImageRepository.batchUpsertImages (cognitive 30): SqliteGalleryImageRepository.batchUpsertImages has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (8 pts), ternaries 3 (8 pts), boolean chains 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/core/database/datasources/gallery_image_repository.dart"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5101b33b018dc7193f8903e86cd34780edf3cf765373da02605ed6748e43302"}},{"ruleId":"D2","level":"warning","message":{"text":"CharacterPromptBlockParser.parse (cognitive 30): CharacterPromptBlockParser.parse has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (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/core/utils/character_prompt_block_parser.dart"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"014e80c9b5b28c4de97e815fcdec72d1bb368935b85886f4c4c545a9579a78c4"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptEditDocument.emphasisRanges (cognitive 30): PromptEditDocument.emphasisRanges has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 9, ternaries 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/prompt_edit_document.dart"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b34b5ff4ddf8f13bd4475e5b9f5b360942538019deb1849955dbc4e6b0bb5ac"}},{"ruleId":"D2","level":"warning","message":{"text":"AiTagGallerySourceAdapter.detail (cognitive 30): AiTagGallerySourceAdapter.detail has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (8 pts), boolean chains 4, error handling 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b764621caf4411603445ae3b98638855a5cf4ba45fecdc072ae82ee3e5510e"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalOnnxModelService.importTaggerFiles (cognitive 30): LocalOnnxModelService.importTaggerFiles has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (5 pts), error handling 2 (4 pts), boolean chains 2 (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/data/services/local_onnx_model_service.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0ea2cd8840ea18fd4fd8c65a4d41290fe42c49cbb6e52bb03c601dac9c9e90"}},{"ruleId":"D2","level":"warning","message":{"text":"CharacterTagGenerator.generate (cognitive 30): CharacterTagGenerator.generate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 5 (15 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/data/services/strategies/character_tag_generator.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"384f4d85ae68e2a20e83fb975bfadfb192c57c8ed3e08ad41d792000b1472198"}},{"ruleId":"D2","level":"warning","message":{"text":"TagToolbox._searchTags (cognitive 30): TagToolbox._searchTags has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 4 (5 pts), ternaries 1 (2 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/presentation/agent_chat/services/tag_toolbox.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb214b3d7dfa25edfe25fa3b8c401d0f8f304b9bef2584356eabd2aee9056a55"}},{"ruleId":"D2","level":"warning","message":{"text":"_ProviderQueue._execute (cognitive 30): _ProviderQueue._execute has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 6, ternaries 1 (2 pts), error handling 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/services/assistant_request_scheduler.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc6aec10efa9926cec9e0f64b83578776315b9c3ab4fe1fed8c48dc6262869b"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAiResponsesAdapter._extractResponseContent (cognitive 30): OpenAiResponsesAdapter._extractResponseContent has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (9 pts), boolean chains 1 (nesting depth added 19). 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/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c348c0816708d126e6f998e54a9002ef12551b9541b5446cfcec7792270111e"}},{"ruleId":"D2","level":"warning","message":{"text":"FixedTagsNotifier.restoreUsageSnapshot (cognitive 30): FixedTagsNotifier.restoreUsageSnapshot has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 5 (10 pts), boolean chains 6, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/fixed_tags_provider.dart"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84a7f5d1fb5fa929902a8d0d91d4dc3d87bb067430371522d4c69f9d0dbca3c"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryBlacklistNotifier._syncIncrementally (cognitive 30): OnlineGalleryBlacklistNotifier._syncIncrementally has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 2, error handling 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/online_gallery_blacklist_provider.dart"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fec1d069d0dd3e66f4fa5f5926eca329cfee463da2ab4dfd7ec80ca7f178a8c"}},{"ruleId":"D2","level":"warning","message":{"text":"_OnlineGalleryScreenState._handleGalleryStateChanged (cognitive 30): _OnlineGalleryScreenState._handleGalleryStateChanged has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 18, if/else 5 (7 pts), ternaries 2 (5 pts) (nesting depth added 5). 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/presentation/screens/online_gallery/online_gallery_screen.dart"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"6894dca1eb6c9329c5274183b052feb8abfbc3ac77fb52cdf58b138897352e9b"}},{"ruleId":"D2","level":"warning","message":{"text":"_VibeCardState._buildCard (cognitive 30): _VibeCardState._buildCard has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 16, if/else 9 (10 pts), ternaries 2 (4 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/presentation/screens/vibe_library/widgets/vibe_card.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce1446b59b0d83f172439949a901daa01de3f293e01b2f62548d89c7f85e6ed"}},{"ruleId":"D2","level":"warning","message":{"text":"WatermarkEditorControls.build (cognitive 30): WatermarkEditorControls.build has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 12 (18 pts), if/else 5 (6 pts), loops 3 (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/presentation/screens/watermark/watermark_editor_controls.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdeb1bf6692a89683cc1e967000383879c1b0a31b705a3eab1b4fb322e78e85d"}},{"ruleId":"D2","level":"warning","message":{"text":"_FavoriteIconButtonState.build (cognitive 30): _FavoriteIconButtonState.build has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 13 (19 pts), if/else 8 (10 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/animated_favorite_button.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"075fa4170d343a64c00c3bafc7fec2ccdfeaf4a67e3df864e2190c60a2a4907e"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageCardController.update (cognitive 30): ImageCardController.update has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 16, if/else 12 (14 pts) (nesting depth added 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/presentation/widgets/common/image_card_controller.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"61db35246e3cdb1b05e17e4c687c9f99b30eda6441bdef4fff4aef39ead2fc60"}},{"ruleId":"D2","level":"warning","message":{"text":"TagEditorSession._changed (cognitive 30): TagEditorSession._changed has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 9, loops 3 (6 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/presentation/widgets/prompt/tag_editor_session.dart"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bf7d26bf7c5d91e5f8466477f57590854c0a3bdbcb22e514529fbf31721be1"}},{"ruleId":"D2","level":"warning","message":{"text":"_UnifiedPromptInputState._handleHardwareKeyEvent (cognitive 30): _UnifiedPromptInputState._handleHardwareKeyEvent has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 18, if/else 11 (12 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/unified/unified_prompt_input.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8633847993d3781f0d6a6f93901955b1ea33fefa2549e14e752f5636a623ef83"}},{"ruleId":"D2","level":"warning","message":{"text":"NaiPromptParser._splitByDelimiters (cognitive 29): NaiPromptParser._splitByDelimiters has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 10, 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/core/utils/nai_prompt_parser.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2845a26edaafaa0c5dd7515a3c5b4806360884ae279dd2a2ec589630027acf"}},{"ruleId":"D2","level":"warning","message":{"text":"WatermarkRenderService.render (cognitive 29): WatermarkRenderService.render has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 7, error handling 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/core/watermark/watermark_render_service.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7e9a1b6e35bbb79d75a656e96342e3cfc72e3e7cfebf911612d6b472e3c528"}},{"ruleId":"D2","level":"warning","message":{"text":"VerifiedBlobStore.putStream (cognitive 29): VerifiedBlobStore.putStream has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 8, error handling 2 (3 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/cloud_sync/verified_blob_store.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e4e2060c599137f34a2b3e517028e58b6b5c195818dc5c02cd73ad11d4df1a"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataImportOptions.selectedCount (cognitive 29): MetadataImportOptions.selectedCount has cognitive complexity 29 (threshold 15). Drivers by points: if/else 21, boolean chains 8. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/models/metadata/metadata_import_options.dart"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5852e49870b0fecdbace5957900fe421749301a2a6b740a54b8e376f5ccaa70"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerationSettingsService.updateSettings (cognitive 29): GenerationSettingsService.updateSettings has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 9, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/generation_settings_service.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d21d0a4a8f63700727c77c4888e12c43488016498070127a9ac72177d2a465"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeImportHandler.importFromFiles (cognitive 29): VibeImportHandler.importFromFiles has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (19 pts), error handling 2 (6 pts), loops 1 (3 pts), boolean chains 1 (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/presentation/screens/generation/handlers/vibe_import_handler.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"915a9736b0df45863b6d001d92c929cdde7bb22ff25a7a49f05a9cce9c3d7689"}},{"ruleId":"D2","level":"warning","message":{"text":"MobileCollapsedPromptLauncher.build (cognitive 29): MobileCollapsedPromptLauncher.build has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, ternaries 2 (4 pts), loops 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/presentation/screens/generation/mobile_generation_workspace.dart"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"df41e61cb390498dd42c5dcc55dbdecb5b8a093d9a18cf1d504b327294c4588a"}},{"ruleId":"D2","level":"warning","message":{"text":"_ImagePreviewWidgetState._buildGeneratedImageCard (cognitive 29): _ImagePreviewWidgetState._buildGeneratedImageCard has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 25, boolean chains 3, if/else 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/widgets/image_preview.dart"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"736fd9d77443ead29a8b399020881a058b562854da6696c4b7075d612d6297ff"}},{"ruleId":"D2","level":"warning","message":{"text":"_BulkProgressDialogState.build (cognitive 29): _BulkProgressDialogState.build has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 7, ternaries 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/bulk_progress_dialog.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"397c58629e21af7f7d257932f3771c763a870b5b802109cffe3d413a5eabd437"}},{"ruleId":"D2","level":"warning","message":{"text":"CooccurrenceDataPackService._initialize (cognitive 28): CooccurrenceDataPackService._initialize has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 6, error handling 2 (3 pts), ternaries 1 (3 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/core/autocomplete/cooccurrence_data_pack_service.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7beaa16b797282f18c305b91a114b032452ca8e1d1aeaa650d392fab8a49eec"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreeWayMerger.merge (cognitive 28): ThreeWayMerger.merge has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 6, match/switch 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/merge.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"84903868b320a7fef5011d42b4b9c0850a4afc375a1b79351357bcada191bcdc"}},{"ruleId":"D2","level":"warning","message":{"text":"ComfyUIWebSocketService._handleJsonMessage (cognitive 28): ComfyUIWebSocketService._handleJsonMessage has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (21 pts), boolean chains 4, match/switch 1 (2 pts), error handling 1 (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/core/comfyui/comfyui_websocket_service.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddf07486211638210d5921f632bd4d15f893410e5c76327900b317d5df31beb"}},{"ruleId":"D2","level":"warning","message":{"text":"AvatarService.pickAndSaveAvatar (cognitive 28): AvatarService.pickAndSaveAvatar has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), error handling 4 (8 pts), boolean chains 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/core/services/avatar_service.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3046ff1518533b1e1c2d919773cd6d915cd89b7e69c53fa7308640c8a4695e04"}},{"ruleId":"D2","level":"warning","message":{"text":"OnnxTaggerLabelFiles._parseVocabularyLabels (cognitive 28): OnnxTaggerLabelFiles._parseVocabularyLabels has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (7 pts), boolean chains 4, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/local_onnx_tagger_labels.dart"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d054f968a9c15e0f21fe7d8849239387bc9f5c9de9593d3bf01d8f8f2003ce"}},{"ruleId":"D2","level":"warning","message":{"text":"_AgentChatResourcePickerBodyState._buildLocalGallery (cognitive 28): _AgentChatResourcePickerBodyState._buildLocalGallery has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 12, if/else 9 (11 pts), ternaries 3 (5 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/presentation/agent_chat/widgets/agent_chat_resource_widgets.dart"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae82ec0291d57f786bb77d05d3e124c4385269e25b02bd99339a1619a7a6d6e"}},{"ruleId":"D2","level":"warning","message":{"text":"_ZhDictionaryStatus.build (cognitive 28): _ZhDictionaryStatus.build has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 7 (9 pts), error handling 1 (2 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/presentation/screens/settings/widgets/data_source_cache_settings.dart"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"48693869c39f7563f3eb0696ea531310c6e7565901f8b48341f3feec8e36553e"}},{"ruleId":"D2","level":"warning","message":{"text":"_AutocompleteWrapperState._onKeyEvent (cognitive 28): _AutocompleteWrapperState._onKeyEvent has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 10 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/autocomplete/autocomplete_wrapper.dart"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d5aeb5723c93aed6c1ba5b4d5732575cf6776500a6a8e9a93aa20b3c8a4a2e"}},{"ruleId":"D2","level":"warning","message":{"text":"_CollapsibleImagePanelState.build (cognitive 28): _CollapsibleImagePanelState.build has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 10, ternaries 7 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/collapsible_image_panel.dart"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1c38c5c0699d037785a2eaa02efe2b89028d7a6772067423341ccbd4982f49"}},{"ruleId":"D2","level":"warning","message":{"text":"_Model3dEditorScreenState.build (cognitive 28): _Model3dEditorScreenState.build has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (12 pts), ternaries 6 (11 pts), boolean chains 5 (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/presentation/widgets/model3d_editor/model3d_editor_screen.dart"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b3bff2d9bf0f150761a77b1c55e101423f1f35301d7c75f36128144a756a4b"}},{"ruleId":"D2","level":"warning","message":{"text":"BashHarnessTool.executeWithContext (cognitive 27): BashHarnessTool.executeWithContext has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 4 (6 pts), boolean chains 3 (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/core/agent/harness/tools/bash.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd66cab0c7d044e92c8498bacf95fd055d66c6cd94be79c0a3a34ac920c39bd"}},{"ruleId":"D2","level":"warning","message":{"text":"ZhDictionaryService.installOrUpdate (cognitive 27): ZhDictionaryService.installOrUpdate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (21 pts), error handling 4 (5 pts), boolean chains 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/core/autocomplete/zh_dictionary_service.dart"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4a7e723052b8617b4f9b35c532d3f2c266a41dee81700ac4d4fe1aba96cbc5"}},{"ruleId":"D2","level":"warning","message":{"text":"WebDavCloudSyncBackend.listSnapshotIds (cognitive 27): WebDavCloudSyncBackend.listSnapshotIds has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (5 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (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/core/cloud_sync/backend/webdav_cloud_sync_backend.dart"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c718ea4d8c1cdc75ea874f8a7593358dcf488905218130a6928de9821bd8bc8"}},{"ruleId":"D2","level":"warning","message":{"text":"ResumableSnapshotUploader.resume (cognitive 27): ResumableSnapshotUploader.resume has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (19 pts), loops 3 (4 pts), ternaries 3, boolean chains 1 (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/core/cloud_sync/snapshot_uploader.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"63696e66c16292d060302a3db054cc09e04616a566bf0dd4436ad0de0d404e5c"}},{"ruleId":"D2","level":"warning","message":{"text":"NaiPromptExportCodec._project (cognitive 27): NaiPromptExportCodec._project has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 11 (14 pts), if/else 9, loops 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/models/gallery/nai_prompt_export_codec.dart"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c3bda9616acbf46856e22756a9a826961ee8772104c9b6dcac7e1bf0ab94b3"}},{"ruleId":"D2","level":"warning","message":{"text":"CharacterCountResolver.getCountTag (cognitive 27): CharacterCountResolver.getCountTag has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 7 (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/data/services/character_count_resolver.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5b6e6d384635e95ce917a17653beabca0f596427f38a2dfec3e37d76a9d6da"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentImagePresentationService.present (cognitive 27): AgentImagePresentationService.present has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 3 (6 pts), loops 4, boolean chains 3, ternaries 2 (3 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/presentation/agent_chat/services/image_presentation_toolbox.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3da3174639877d3b3ca8ccd6c35054024508ea64f16ea05bb1e4b6a6a9f7dea"}},{"ruleId":"D2","level":"warning","message":{"text":"_AgentChatWorkTrailState.build (cognitive 27): _AgentChatWorkTrailState.build has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 8 (11 pts), if/else 6 (8 pts), boolean chains 4, loops 2 (4 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/presentation/agent_chat/widgets/agent_chat_turn.dart"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0400d63ab4743f76bbd18015ba7d4ee8efc20f6404162f16e7f001a9b290d1"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerationResultLifecycleService.saveImages (cognitive 27): GenerationResultLifecycleService.saveImages has cognitive complexity 27 (threshold 15). Drivers by points: error handling 6 (13 pts), if/else 6 (13 pts), loops 1 (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/presentation/providers/generation/generation_result_lifecycle_service.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a07c9264442f553b81fb1108f04cbd8964d5cd42df57a15e120f7be57ea925"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGallerySelectionActions._buildReplicationTask (cognitive 27): OnlineGallerySelectionActions._buildReplicationTask has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 4 (10 pts), boolean chains 8, if/else 3 (6 pts), loops 1 (2 pts), error handling 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/presentation/screens/online_gallery/online_gallery_selection_actions.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43a8c02903543d62fbaec3c60ce8daa6c8807afa8c590f5d99269b92c69717e"}},{"ruleId":"D2","level":"warning","message":{"text":"_OnlineGalleryToolbarPresenter._buildPrimaryActions (cognitive 27): _OnlineGalleryToolbarPresenter._buildPrimaryActions has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 15 (22 pts), if/else 5 (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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_feature.dart"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2f559b4cb2065153cf5629821621aeb955266a68530db8f9852bb0d01a421f"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageWorkflowLauncher._openEditor (cognitive 27): ImageWorkflowLauncher._openEditor has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 9, ternaries 8 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/services/image_workflow_launcher.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a286ba59ae30da0e279200af6b9b6ba7fe3d83d2cfee3ca72281a2dad54f41cc"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageCardContextMenu.show (cognitive 27): ImageCardContextMenu.show has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 5 (18 pts), if/else 5 (7 pts), loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/image_card_context_menu.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3d1749b23e0b6040adf95f52dd2b0a030e9eb25fe399aeae3d87c5ada10cf9"}},{"ruleId":"D2","level":"warning","message":{"text":"comparePngs (cognitive 27): comparePngs has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (13 pts), ternaries 3 (7 pts), loops 3 (6 pts), boolean chains 1 (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":"tool/diagnostics/nai_inpaint_parity_browser.cjs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c399fa36e4831652e91bb12eb8afa4752c8fc8cb98ab64776c1f6b0496bffd8"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalGalleryThumbnailMigration.cleanup (cognitive 26): LocalGalleryThumbnailMigration.cleanup has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (6 pts), error handling 2 (3 pts), boolean chains 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/core/cache/local_gallery_thumbnail_migration.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"02782509ccede15840d9bc646a674fa69247474969c5a5e5abb0ca7721f4938c"}},{"ruleId":"D2","level":"warning","message":{"text":"GoogleDriveCloudSyncBackend._fetchInventory (cognitive 26): GoogleDriveCloudSyncBackend._fetchInventory has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 5, loops 2 (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/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c46f96f67dccc3db549c97a5ad3779f9188640b5068f6f6206d4714e99be75"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotManifest.SnapshotManifest (cognitive 26): SnapshotManifest.SnapshotManifest has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5, loops 4 (5 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/core/cloud_sync/models.dart"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49fd303f2dcb53c4056b37dfe41fb1f61f62947275f90cd2950201e717c1994"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionPool.release (cognitive 26): ConnectionPool.release has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (26 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/core/database/connection_pool.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d42f8786b416c61916fcd7234f91101c6d5972d6594e012e92f3d4f7dbefdb"}},{"ruleId":"D2","level":"warning","message":{"text":"DanbooruTagsRefreshService._fetchPage (cognitive 26): DanbooruTagsRefreshService._fetchPage has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (15 pts), error handling 3 (6 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (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/core/services/danbooru_tags_refresh_service.dart"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb396c3ae43cf569540056509968c062827650fdb9a366f2750e54dda4c4d1b"}},{"ruleId":"D2","level":"warning","message":{"text":"InpaintMaskUtils.fillMaskRegionAtPoint (cognitive 26): InpaintMaskUtils.fillMaskRegionAtPoint has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 7, loops 2, error handling 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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bc652bc40489d3f5efc2c317892ef0d0388bc84a43aaea239cd1bf1f2f5951"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentSkillsCloudSyncAdapter._prepareRestorePlans (cognitive 26): AgentSkillsCloudSyncAdapter._prepareRestorePlans has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 5, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/cloud_sync/agent_cloud_sync_adapters.dart"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a71338c70b097f04fa28a71a65f1df523ae3c1ed143cf94758fff6a0693a423"}},{"ruleId":"D2","level":"warning","message":{"text":"NaiImageMetadataRawDecoder._extractCharacterPrompts (cognitive 26): NaiImageMetadataRawDecoder._extractCharacterPrompts has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 2 (5 pts) (nesting depth added 15). 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/data/models/gallery/nai_image_metadata_raw_decoder.dart"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1af15259680b1fcc41d94e5022a8f59b4d2470dfb888b35971279b65d87c15c"}},{"ruleId":"D2","level":"warning","message":{"text":"_OfficialRecipeEngine._characterPromptCharacter (cognitive 26): _OfficialRecipeEngine._characterPromptCharacter has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 2, loops 2, match/switch 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/official_random_prompt_generator.dart"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f769b6d981683869a5579ae11fe5b5f966448f3777ad9362e273a4de58b972"}},{"ruleId":"D2","level":"warning","message":{"text":"KritaBridgeNotifier.enable (cognitive 26): KritaBridgeNotifier.enable has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 3 (6 pts), boolean chains 2, error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/krita/krita_bridge_notifier.dart"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f90497e54e4e1f63a98320ebe6d93a91680ebbe1066c4a8e885be9ffaae9297"}},{"ruleId":"D2","level":"warning","message":{"text":"_MosaicCanvasPainter._paintRegionGuide (cognitive 26): _MosaicCanvasPainter._paintRegionGuide has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 7 (10 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/mosaic/mosaic_editor_canvas.dart"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26d1ce203e4fac64069e815cc660eda112cf631517159ffe9afcc51acc81104"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryDetailLauncher.show (cognitive 26): OnlineGalleryDetailLauncher.show has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 5 (9 pts), error handling 2 (4 pts), boolean chains 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/presentation/screens/online_gallery/online_gallery_detail_launcher.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e562555a34ce68d4e18d7abeb0a90db5d12ed7b17ee160cada485cd05d4a5e46"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryScrollPrefetchCoordinator.scheduleVisiblePrefetch (cognitive 26): OnlineGalleryScrollPrefetchCoordinator.scheduleVisiblePrefetch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 8, loops 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/presentation/screens/online_gallery/online_gallery_scroll_prefetch_coordinator.dart"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcd4a64ef408332637612a3a84073301c3f2c3ee3ee38d9392fa079f220d544"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerationTransferConfiguration._resolveModel (cognitive 26): GenerationTransferConfiguration._resolveModel has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/services/generation_prompt_transfer_service.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"64407d06ac1fb9c5093dc94d083b2517a032ec4becb60c230ad9739436f81860"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionOverlayHeader.build (cognitive 26): CompletionOverlayHeader.build has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 10 (13 pts), if/else 8 (11 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/autocomplete/completion_overlay_header.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cc91b18a29417f82b24e041a8fd245ee0a84ea43954f4063b441da086db7ca"}},{"ruleId":"D2","level":"warning","message":{"text":"_DiscordShareDialogState._send (cognitive 26): _DiscordShareDialogState._send has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6, ternaries 1 (3 pts), error handling 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/discord_share/discord_share_dialog.dart"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0248b41030975d2cd13e14f37ea578cbb38862084c05072d122975acee4c11"}},{"ruleId":"D2","level":"warning","message":{"text":"_AutoSaveToggleChipState.build (cognitive 26): _AutoSaveToggleChipState.build has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 19 (20 pts), boolean chains 3, if/else 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/generation/auto_save_toggle_chip.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"df73311df087bd857641e1ab45543496ed5a21175b5b531f9720ff0f6a8d7eff"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueTaskDetailView.build (cognitive 26): QueueTaskDetailView.build has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 2 (5 pts), ternaries 2, boolean chains 1 (nesting depth added 7). 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/presentation/widgets/queue/task_list_item.dart"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce3a91be83a7bf2f6bdd93bcbd9f5ffbe4ea1e9152a6b1b1c1d8fb3a3a0ef7f"}},{"ruleId":"D2","level":"warning","message":{"text":"BackendHttp._request (cognitive 25): BackendHttp._request has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), ternaries 2 (6 pts), boolean chains 4, error handling 2 (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/core/cloud_sync/backend/backend_http.dart"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a5e862fbc946517f9942e4177141b77bf607a7245ff71d6acc38f61d683665"}},{"ruleId":"D2","level":"warning","message":{"text":"WebDavNamespaceCleaner._scan (cognitive 25): WebDavNamespaceCleaner._scan has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 5, loops 1 (2 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/backend/webdav_namespace_cleaner.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc4401392d4a6934f475a58d0dc5c864a577250f5cff13977beef4ee1fd3b97"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteGalleryAlbumRepository.rebindPendingPaths (cognitive 25): SqliteGalleryAlbumRepository.rebindPendingPaths has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (6 pts), loops 3 (5 pts), error handling 2 (4 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/core/database/datasources/gallery_album_repository.dart"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4abe55bea38863dbe958ffe85f114cae098eeea480e7bf876a92bfda039221"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticLogExportService._writeSanitizedCopy (cognitive 25): DiagnosticLogExportService._writeSanitizedCopy has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (18 pts), ternaries 2 (4 pts), loops 1 (2 pts), boolean chains 1 (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/core/services/diagnostic_log_export_service.dart"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"847529c10a18bd10482092ea9aee1f935ffec2de89421f867c4e431a51756d00"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorCompressionPlan.resolve (cognitive 25): EditorCompressionPlan.resolve has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 6, loops 2, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/editor_compression_utils.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"de978e388a8afca4eac0d7d296e8441377f7d0dcf42c5b437f1901bc5f9a9d1b"}},{"ruleId":"D2","level":"warning","message":{"text":"InpaintMaskUtils._alignMaskToLatentGrid (cognitive 25): InpaintMaskUtils._alignMaskToLatentGrid has cognitive complexity 25 (threshold 15). Drivers by points: loops 6 (17 pts), if/else 2 (8 pts) (nesting depth added 17). 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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b739b03eece16f31d9bdd73cdc2733fce3b6df7387dbadbbbed34c91ffb917"}},{"ruleId":"D2","level":"warning","message":{"text":"DonmaiGallerySourceAdapter.search (cognitive 25): DonmaiGallerySourceAdapter.search has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 4 (5 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d980b6a2025c831cb419e7b04481b5f7b796569e5767b8ae9160db74605604a"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentChatConfig.fromJson (cognitive 25): AgentChatConfig.fromJson has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5, ternaries 5, loops 1 (2 pts), match/switch 2 (nesting depth added 2). 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/data/models/agent/agent_settings.dart"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6a5eacd114392933d8f7134f6fe2ff2e833b3dcafb877b6d59c6bf59a0726e"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyConfig._matchMapping (cognitive 25): DependencyConfig._matchMapping has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 15). 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/data/models/prompt/dependency_config.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9a1185e6192d507197386e79a61c5dd41f7d2ec49ab8538c364456bfb87431"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptAssistantConfigState._isUntouchedLegacyPollinationsDefault (cognitive 25): PromptAssistantConfigState._isUntouchedLegacyPollinationsDefault has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 13, if/else 8 (11 pts), loops 1 (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/data/models/prompt_assistant/prompt_assistant_models.dart"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd467dc784c7c498e17c0cf94f8b618b5040d3ff5ef17f62c598834f4d92e503"}},{"ruleId":"D2","level":"warning","message":{"text":"GalleryCategoryRepository._scanAndAddNewFolders (cognitive 25): GalleryCategoryRepository._scanAndAddNewFolders has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 1 (2 pts), error handling 1 (nesting depth added 16). 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/data/repositories/gallery_category_repository.dart"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35ea9202d3095976be3aa58f86f073369312776d298e407cd9553d879ca6f30"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonGenericParser.parse (cognitive 25): JsonGenericParser.parse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 2 (4 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/metadata/metadata_text_decoder.dart"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa70a13314717c4d5c606fd2294f01816a8623425f6da1d322b686e32120798c"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentToolPermissionController.beforeToolCall (cognitive 25): AgentToolPermissionController.beforeToolCall has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 8, ternaries 5 (6 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/agent_tool_permission_controller.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8870bb42a81c256a04bf7427c9ab14b797d4c08984605af8e114f154b7525e62"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentChatPanelCoordinator._send (cognitive 25): AgentChatPanelCoordinator._send has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 4, 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/presentation/agent_chat/widgets/agent_chat_panel_coordinator.dart"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef1ef2fe159e239fdd25a66f55128762bf229e1dbcd006e6fbf2e68726f2eeb"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAiChatCompletionsAdapter._maxTokensField (cognitive 25): OpenAiChatCompletionsAdapter._maxTokensField has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 24, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce48d5647e57a4a8700f0451e2ce6620e5738f9b0c34c4935f0eb6f1ba43c8e3"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAiChatCompletionsAdapter._extractResponseContent (cognitive 25): OpenAiChatCompletionsAdapter._extractResponseContent has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fadb82b9f2113f68db7d5204a8c9f37e53f43b8635a62dda82116118b88009"}},{"ruleId":"D2","level":"warning","message":{"text":"AliasResolverService.searchEntries (cognitive 25): AliasResolverService.searchEntries has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (4 pts), ternaries 1 (3 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/presentation/providers/alias_resolver_service.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12398cdb8224d9316503d86560a824818f19bb8ed2dec9ae05bd3beacb88edf"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageGenerationNotifier._reduce (cognitive 25): ImageGenerationNotifier._reduce has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 4 (8 pts), loops 3 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/image_generation_provider.dart"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"8daef854191fd6ea786704fc5fd2f50e9be4f69b7d6d0738d558dd7af9433195"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalGalleryActionCoordinator.packSelectedImages (cognitive 25): LocalGalleryActionCoordinator.packSelectedImages has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 6, ternaries 2 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/local_gallery/local_gallery_action_coordinator.dart"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"4add6e7b4f1e79af130cc03973601ad39193f9fe23093ef3f1e9ce656f4fe9b3"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkSettingsSectionState.build (cognitive 25): NetworkSettingsSectionState.build has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 4 (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/presentation/screens/settings/sections/network_settings_section.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6208510fad2f6870eaf29e8c9a1c8d97716b0a13debda4e18cda2ef2f8fa91ca"}},{"ruleId":"D2","level":"warning","message":{"text":"_CooccurrenceDataPackStatus.build (cognitive 25): _CooccurrenceDataPackStatus.build has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 6 (9 pts), boolean chains 2, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/settings/widgets/data_source_cache_settings.dart"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e6dc891200620b7d01c7b423f5c8e14148ddb079c27a13a20a9cb664f09aad"}},{"ruleId":"D2","level":"warning","message":{"text":"_StackedAreaChartState._buildChartData (cognitive 25): _StackedAreaChartState._buildChartData has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 6 (10 pts), boolean chains 3, 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/presentation/screens/statistics/widgets/charts/stacked_area_chart.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4ae4f0a234339f8fc552ee80213e5b548a8351e36a333d9255413186392969"}},{"ruleId":"D2","level":"warning","message":{"text":"_ElevatedCardState.build (cognitive 25): _ElevatedCardState.build has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 10 (11 pts), if/else 6 (9 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/elevated_card.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"1836b6243ef055c5894ecf75d6ba648a2900b7ee381d73b2688403ab383d2092"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageCardFrame.build (cognitive 25): ImageCardFrame.build has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 12, boolean chains 11, if/else 2. 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/presentation/widgets/common/image_card_frame.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"339c07bacc3ad786358e7d658ea080ad5573ed03c0a7f9b253692c4437b53433"}},{"ruleId":"D2","level":"warning","message":{"text":"_ImageDetailViewerState._buildMainContent (cognitive 25): _ImageDetailViewerState._buildMainContent has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 14 (16 pts), if/else 4 (6 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/image_detail/image_detail_viewer.dart"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4f480d486a59e25440b468a4a438c533c8561f9be638bb6a32037183520b7f"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalDropActionCoordinator.processDroppedFile (cognitive 25): GlobalDropActionCoordinator.processDroppedFile has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 11 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/drop/global_drop_action_coordinator.dart"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c070b64d96180b3db8b5fee9a25fe43a8a3ba4ea219662477e7dcd34fe4182"}},{"ruleId":"D2","level":"warning","message":{"text":"_PromptLibraryEntryDialogState._save (cognitive 25): _PromptLibraryEntryDialogState._save has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 2, match/switch 1 (2 pts), ternaries 1 (2 pts), error handling 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/presentation/widgets/drop/prompt_library_entry_dialog.dart"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f48b9f3a6b8adaea61838784c12eabc062f10145b49682b7a06bb08543e4064"}},{"ruleId":"D2","level":"warning","message":{"text":"_AlbumItemState.build (cognitive 25): _AlbumItemState.build has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 10 (12 pts), if/else 5 (7 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 5). 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/presentation/widgets/gallery/gallery_album_tree_view.dart"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"922b55f94442c5f395b5b0b448fbaed87a83001c3c20b10b7aedcdf49bfc346c"}},{"ruleId":"D2","level":"warning","message":{"text":"_NavRailAccountButtonState._showAccountMenu (cognitive 25): _NavRailAccountButtonState._showAccountMenu has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 4, ternaries 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/navigation/nav_rail_account_button.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f514d118d81598a81cc0ef8953237e8b5fa3f4116402b9cb582e948f309693d"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryCardLeftStatusOverlays.build (cognitive 25): OnlineGalleryCardLeftStatusOverlays.build has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 11, if/else 8, ternaries 3 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/online_gallery/online_gallery_card_status_overlays.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b63c24d402feffbeed9368639817a84d1bfc9eaa3b5f5570cd8803b5d5a98e1"}},{"ruleId":"D2","level":"warning","message":{"text":"DanbooruCompletionSource._extractRelatedCandidates (cognitive 24): DanbooruCompletionSource._extractRelatedCandidates has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/autocomplete/danbooru_completion_source.dart"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f95d1816b5adbb3f91291c819465d28820efd1034243f01ec520441e497f53"}},{"ruleId":"D2","level":"warning","message":{"text":"AssetDatabaseManager._validateDatabase (cognitive 24): AssetDatabaseManager._validateDatabase has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (5 pts), boolean chains 2 (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/core/database/asset_database_manager.dart"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"325b2ee8e13b97cda6193a934dc00426e544947efb9a4d32206567e5a928a28f"}},{"ruleId":"D2","level":"warning","message":{"text":"NAIImageRequestBuilder.buildBaseParameters (cognitive 24): NAIImageRequestBuilder.buildBaseParameters has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 5, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/request_builders/nai_image_request_builder.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"831082870c1f2beeedd7b632d070cbacc0757ab8e856b8987cf3266cca8ec626"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowsProxyHelper._parseProxyServer (cognitive 24): WindowsProxyHelper._parseProxyServer has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/windows_proxy_helper.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bd818ca452fc64f76feacfd4496cdc0b33b7d6761daddcf18ff472ff0fff2b"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractiveWorkGate._drain (cognitive 24): InteractiveWorkGate._drain has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), error handling 1 (3 pts), ternaries 1 (3 pts), loops 1 (2 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/core/services/interactive_work_gate.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01beb2f2aa5651dc0816544aeacc4f1d0c5ba45d12b2c1c21e209470e2762f4"}},{"ruleId":"D2","level":"warning","message":{"text":"AppLogger._cleanupOldLogs (cognitive 24): AppLogger._cleanupOldLogs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 3 (8 pts), loops 2 (5 pts), boolean chains 2 (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/core/utils/app_logger.dart"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"69af1e1d1d7be461d1e9aa9eaaff94113a10d9bdb5ffc7320134ae5d0a87d955"}},{"ruleId":"D2","level":"warning","message":{"text":"SdToNaiConverter._parsePromptAttention (cognitive 24): SdToNaiConverter._parsePromptAttention has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, ternaries 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/sd_to_nai_converter.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f100fd12d5efac0cd4ffd79e62bfb4e7b328be51ae9258caf5e8c3e34fad7f"}},{"ruleId":"D2","level":"warning","message":{"text":"DanbooruApiService.batchGetTagPostCounts (cognitive 24): DanbooruApiService.batchGetTagPostCounts has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (5 pts), error handling 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/datasources/remote/danbooru_api_service.dart"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ddf386586b3937b6fee6ddd7e2f13ae24d869696033852b297fbbd0057209a5"}},{"ruleId":"D2","level":"warning","message":{"text":"DanbooruTagGroupService.syncTagGroup (cognitive 24): DanbooruTagGroupService.syncTagGroup has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (8 pts), boolean chains 2 (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/data/datasources/remote/danbooru_tag_group_service.dart"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6813a2bf91094381db025b3c5f926a93a74224a2555c8336cf90f682a3bfe6"}},{"ruleId":"D2","level":"warning","message":{"text":"DlssRuntimeManager.install (cognitive 24): DlssRuntimeManager.install has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), error handling 3 (5 pts), loops 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/data/services/dlss/dlss_runtime_manager.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8b352f0df8bcb65b70b9aecda8a31684642ca434abaefd14b093e92fd9d73a"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalGalleryQuery.applyFilter (cognitive 24): LocalGalleryQuery.applyFilter has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (4 pts), boolean chains 2, error handling 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/data/services/gallery/local_gallery_query.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fc122705dda66b821b500b8f6a661fa7a5046323a360af3e6c98ca25a4c5e0"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageMetadataService._parseAndCache (cognitive 24): ImageMetadataService._parseAndCache has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), error handling 3 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/image_metadata_service.dart"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea6cc3d851ba3971fb521e14312c54593edd66a0e511ca58bd6bf23ba1fa8e5"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageMetadataContainerCodec._scanValidatedPngChunks (cognitive 24): ImageMetadataContainerCodec._scanValidatedPngChunks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 6, 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/data/services/metadata/image_metadata_container_codec.dart"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8682082eaec7f8f4a3d4eee585deb604abdfd45e68a5c3dc1c1672271b8cba1"}},{"ruleId":"D2","level":"warning","message":{"text":"_ArchiveRecord.parse (cognitive 24): _ArchiveRecord.parse has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 20, if/else 2, ternaries 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/data/services/precise_ref_library_archive_service.dart"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"249c8be777a1467081d3e29cc6b6ea7988822e2d0b5b9aa13f0e8d1a372e15dc"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogRandomGeneratorStrategy._generateLegacyPrompt (cognitive 24): CatalogRandomGeneratorStrategy._generateLegacyPrompt has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (6 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (CatalogRandomGeneratorStrategy._generateMultiCharacterPrompt) 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/data/services/strategies/catalog_random_generator_strategy.dart"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7150e228af7502389e16952acffee071d0437e6c3ca8622e148bfd9b08c1a6"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogRandomGeneratorStrategy._generateMultiCharacterPrompt (cognitive 24): CatalogRandomGeneratorStrategy._generateMultiCharacterPrompt has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (6 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (CatalogRandomGeneratorStrategy._generateLegacyPrompt) 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/data/services/strategies/catalog_random_generator_strategy.dart"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"31945f07082e56a64cefff91f1270632c8a52a65bba13fcb5bac1df9ad90d839"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeLibraryEntryReader.detail (cognitive 24): VibeLibraryEntryReader.detail has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 5 (11 pts), boolean chains 1, error handling 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/data/services/vibe_library_entry_reader.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"138d8a70903d468a0dc3199c4bde195d9e308fa5b60f5d1d764ecfd8e74a2e5e"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentChatSessionController._restoreLegacyReadImageDetails (cognitive 24): AgentChatSessionController._restoreLegacyReadImageDetails has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 6, loops 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/agent_chat_session_controller.dart"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96354a09d7d22253cd54d1d48256abf6788d9fb342cbefadd0da67d20af9600"}},{"ruleId":"D2","level":"warning","message":{"text":"GeminiGenerateContentAdapter._extractResponseContent (cognitive 24): GeminiGenerateContentAdapter._extractResponseContent has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 16). 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/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4e5cac98ddf7e041ddcea3ba5f492f611da96a0d9b7e68c24f3d804c1404c5"}},{"ruleId":"D2","level":"warning","message":{"text":"_MobileGenerateButton.build (cognitive 24): _MobileGenerateButton.build has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 12 (14 pts), if/else 6, boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/mobile_generation_chrome.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d922bb48bc48ab6a43ab7d077de7b837832b55b8ce3b6510cc4fbffe556e1b"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryScrollPrefetchCoordinator.jumpToPageTarget (cognitive 24): OnlineGalleryScrollPrefetchCoordinator.jumpToPageTarget has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, ternaries 5 (7 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/online_gallery/online_gallery_scroll_prefetch_coordinator.dart"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb410669c093bb9495f20d8d3ec7e4b18507703aef4b17ee3141b9964f714c7"}},{"ruleId":"D2","level":"warning","message":{"text":"_SizeComparisonPainter._drawPattern (cognitive 24): _SizeComparisonPainter._drawPattern has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (20 pts), if/else 4 (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/presentation/widgets/image_editor/widgets/panels/canvas_size_dialog.dart"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"49848e69aa7eeaa062cda38be3d2c10f27610f4f8b741c9376a91fef381f30ec"}},{"ruleId":"D2","level":"warning","message":{"text":"NaiSyntaxController._applyComposingUnderline (cognitive 24): NaiSyntaxController._applyComposingUnderline has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 6, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/nai_syntax_controller.dart"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"1820e027b7186ac224b1241896de811a09c3be6736ea439403042c761fc98926"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptWeightEditing._partialTarget (cognitive 24): PromptWeightEditing._partialTarget has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 10, if/else 4 (8 pts), loops 3 (6 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/presentation/widgets/prompt/prompt_weight_editing.dart"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc90c489c9ced4a1f2d677e46057068c494715c40d177f92c36e660b33213f5"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptTokenParser.editChangesActiveToken (cognitive 23): PromptTokenParser.editChangesActiveToken has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 13, if/else 7, loops 2, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/autocomplete/prompt_token_parser.dart"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"37202b745362110e13429aaa01ee8eb15f53693d03de46bac7cef16bee27d5cf"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteGalleryMetadataRepository.batchUpsertMetadata (cognitive 23): SqliteGalleryMetadataRepository.batchUpsertMetadata has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 6 (17 pts), if/else 2 (3 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/datasources/gallery_metadata_repository.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b766b26f1beeb32a93703d01b9b1d77bd334435eab7ad21da1bca302b06a55fb"}},{"ruleId":"D2","level":"warning","message":{"text":"ExaSearchClient._searchMcpTool (cognitive 23): ExaSearchClient._searchMcpTool has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (6 pts), error handling 3, boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/web_access/exa_search_client.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d15decd3b53b39b50b15e2c3fd095bb74a334b511b74692f16acb87d9319a4"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelSnapEngine._selectPitch (cognitive 23): PixelSnapEngine._selectPitch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 8 (9 pts), boolean chains 2, 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/core/services/pixel_snap/pixel_snap_engine.dart"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0cec1cc0d64277130cc58a130908c84388fc70ded2433011f6206c4966bba8"}},{"ruleId":"D2","level":"warning","message":{"text":"SmartTagRecommendationService.getRecommendations (cognitive 23): SmartTagRecommendationService.getRecommendations has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3 (4 pts), ternaries 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/services/smart_tag_recommendation_service.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"435af66c8b3205e7a2708d3ce3d5c5d65a9a311081dff9e2d29a5b8e0bbeeecd"}},{"ruleId":"D2","level":"warning","message":{"text":"NovelAiVibeCodec.validateSingleMap (cognitive 23): NovelAiVibeCodec.validateSingleMap has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 12, if/else 9 (11 pts) (nesting depth added 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/core/utils/novelai_vibe_codec.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85bb16b67f2a1cbb0471d7447200f9d1409d7e3725a588c1f91a4480b474666"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeFileParser._parseBundleBytesSync (cognitive 23): VibeFileParser._parseBundleBytesSync has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), ternaries 1 (4 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/vibe_file_parser.dart"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b18229d442099ddfcc7cccfd980adfe35f56fb6d259d587b166fffadcf31f78"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalOnnxModelService._recoverInterruptedImports (cognitive 23): LocalOnnxModelService._recoverInterruptedImports has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/local_onnx_model_service.dart"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b84e869a9efa0c1fa92be61608bedaf6bb1bea0ea1ea2e85cd41b080d297af"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryArtistHuntService.resolve (cognitive 23): OnlineGalleryArtistHuntService.resolve has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), boolean chains 3, error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/online_gallery/online_gallery_artist_hunt_service.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d728e2ddf17dbe8346bc12520b20ca2963c12201cc6fcc55ed93239c955ced"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGallerySearchService.buildPlan (cognitive 23): OnlineGallerySearchService.buildPlan has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 6, boolean chains 4, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/online_gallery/online_gallery_search_service.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd71bf9f53dd703fb1981218e6064b8c7f2b21ee1c39d8dbb141efc8d6e1f5ae"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeLibraryEntryWriter.updateEncodingModel (cognitive 23): VibeLibraryEntryWriter.updateEncodingModel has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 5 (9 pts), boolean chains 3, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/vibe_library_entry_writer.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2de37d2db5fcb6d4304934f168321e51ef9368da59319b961535e1a41eb60b"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerationExecutionService.generate (cognitive 23): GenerationExecutionService.generate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, error handling 2, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/generation_execution_service.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e74eb3d4e1fbe831406ba7e3ec0e77e12ca8f49fa7aea85aaeca03c96a9513"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentChatPanelCoordinator._editUserMessage (cognitive 23): AgentChatPanelCoordinator._editUserMessage has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, loops 2 (4 pts), ternaries 1 (2 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/presentation/agent_chat/widgets/agent_chat_panel_coordinator.dart"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d560cd2c35d3404c3d3941c4dd315d328c3b053f3e4a9e2d7c7cf5b1282c6b"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageGenerationService._execute (cognitive 23): ImageGenerationService._execute has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (6 pts), boolean chains 5, match/switch 1 (3 pts), error handling 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/presentation/providers/generation/image_generation_service.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf939fe0cb30cb7af3624b53ef7e62988568d3e3bf5b79fab951b818a28709b1"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalGalleryNotifier.loadPage (cognitive 23): LocalGalleryNotifier.loadPage has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 4 (7 pts), error handling 3, boolean chains 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/presentation/providers/local_gallery_provider.dart"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"d890d55901e485badb393c1f2a48e758ab97ccdafd01da9c78042bc4dcac0924"}},{"ruleId":"D2","level":"warning","message":{"text":"SubscriptionNotifier._doFetchSubscription (cognitive 23): SubscriptionNotifier._doFetchSubscription has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 6, error handling 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/presentation/providers/subscription_provider.dart"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22df45bfd40b49b8977341dabee1e25f4a24c8e1a1c966bf3241ecef86d39d8"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryImageCard.build (cognitive 23): HistoryImageCard.build has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 21, boolean chains 2. 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/presentation/screens/generation/widgets/history_panel/history_image_card.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6f1934f25a2fa84665b864ff7fc2edd6b55aa3b2c4fe1e0fe06aee45391cf3"}},{"ruleId":"D2","level":"warning","message":{"text":"_MosaicEditorCanvasState._resizeRegion (cognitive 23): _MosaicEditorCanvasState._resizeRegion has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 2 (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/presentation/screens/mosaic/mosaic_editor_canvas.dart"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"58baebe64481b63d8a70ac9c1a25d8f2a16ffa0e720d19f89e1af0d4f5945bba"}},{"ruleId":"D2","level":"warning","message":{"text":"_GalleryCacheActionsState._rescanGallery (cognitive 23): _GalleryCacheActionsState._rescanGallery has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (22 pts), error handling 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/presentation/screens/settings/widgets/gallery_cache_actions.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e046600eb35f53012960a479332bcfcd08472405152a42e9cd51560542b1e377"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeImportController._encodeImage (cognitive 23): VibeImportController._encodeImage has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, error handling 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/presentation/screens/vibe_library/vibe_import_controller.dart"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"63493e9841454ff8edc808e4cb5e06fcb2ed9c6d9e4e5a3df9458d0adb9d8f23"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeExportAdvancedExecutor.resolveEntryVibes (cognitive 23): VibeExportAdvancedExecutor.resolveEntryVibes has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 9, ternaries 4 (8 pts), if/else 4 (5 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/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_advanced_executor.dart"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"e209268136c19021d802cb47fd957d6f252e22db38b42036b75b17a7f92f67f9"}},{"ruleId":"D2","level":"warning","message":{"text":"_VibeExportDialogAdvancedState.build (cognitive 23): _VibeExportDialogAdvancedState.build has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, loops 1 (3 pts), 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/presentation/screens/vibe_library/widgets/vibe_export_dialog_advanced.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e13170417ee3fbb7779724d0d3f128ff3c45b80fc686d7ac82388eb747dae00"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionOverlay.build (cognitive 23): CompletionOverlay.build has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 17, if/else 5, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/autocomplete/completion_overlay.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b573aa9228710e4d223be7b5291efb793b4d0fb0ce7a9dec5c80744fda6ca4"}},{"ruleId":"D2","level":"warning","message":{"text":"_PromptLibraryEntryDialogState.build (cognitive 23): _PromptLibraryEntryDialogState.build has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 5 (8 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/presentation/widgets/drop/prompt_library_entry_dialog.dart"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec16ab9efd450b3f33697d267db98e36672740db46bd2da707d1e5257c48845"}},{"ruleId":"D2","level":"warning","message":{"text":"KeyboardState.updateFromEvent (cognitive 23): KeyboardState.updateFromEvent has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 3 (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/presentation/widgets/image_editor/core/input_handler.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe3da9eea4757e6eca4abc6792f029ed4aa61361a3851e7cf7443cdf9f2ee88"}},{"ruleId":"D2","level":"warning","message":{"text":"_FillRequest.floodFill (cognitive 23): _FillRequest.floodFill has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 9, 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/presentation/widgets/image_editor/tools/fill_tool.dart"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c61959e21dd01d7a6e80b9a83a334826205281bf59f37465eb82c91d1e52a0"}},{"ruleId":"D2","level":"warning","message":{"text":"_TaskListItemState.build (cognitive 23): _TaskListItemState.build has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 10, ternaries 8, if/else 5. 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/presentation/widgets/queue/task_list_item.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0e01cb4c640bdcd0b2897ed64ed776fd40464360c34aeeb5f36fb88a49cb34"}},{"ruleId":"D2","level":"warning","message":{"text":"OleDataInspector.WrapDibAsBmp (cognitive 22): OleDataInspector.WrapDibAsBmp has cognitive complexity 22 (threshold 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":"tool/ole_drag_inspector/windows/Program.cs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1b65cdf82c61cf23ef2bd4977dcaf2951345368ff793f3abe673819d56fc08"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionState.createForkMutations (cognitive 22): SessionState.createForkMutations has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (8 pts), loops 3, 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/core/agent/harness/session/session_state.dart"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b2496c4d3e5c484380676d32b5edd7b28b03a0f42f9d70f0eb2d387f123521"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionRanker.mergeAndSort (cognitive 22): CompletionRanker.mergeAndSort has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 5 (10 pts), boolean chains 1, 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/core/autocomplete/completion_ranker.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c590e6cb18c24f4897b3088cbd3bfd4b2e837394952c98d3350950bf1a7a5ed4"}},{"ruleId":"D2","level":"warning","message":{"text":"_DriveFile.fromJson (cognitive 22): _DriveFile.fromJson has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 12, if/else 5, ternaries 5. 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/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef7de91f6664b84aa3a62a9ffe7f7b9f4d3b02b521f470ca5cc8f4764433b7b"}},{"ruleId":"D2","level":"warning","message":{"text":"WebDavEtagReader.read (cognitive 22): WebDavEtagReader.read has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (5 pts), boolean chains 3, error handling 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/core/cloud_sync/backend/webdav_etag_reader.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"29aab46542c35076287ea911a8e748b46dd76dbcfc936f6ceb2d87b988e77813"}},{"ruleId":"D2","level":"warning","message":{"text":"LoopbackCloudDriveOAuthClient._validatedIdentity (cognitive 22): LoopbackCloudDriveOAuthClient._validatedIdentity has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 12, if/else 8 (10 pts) (nesting depth added 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/core/cloud_sync/oauth/loopback_oauth_client.dart"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9286167aa11f208e36580dd4030e2a159e9bf306f8502a5a09ec1e2c945000"}},{"ruleId":"D2","level":"warning","message":{"text":"AssetDatabaseManager._install (cognitive 22): AssetDatabaseManager._install has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), error handling 3 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/asset_database_manager.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac136f4411fe3ec2af2d8381525273f8a43e5851f1d6d6e0813aa38a88bc6d2"}},{"ruleId":"D2","level":"warning","message":{"text":"CharacterPromptBlockParser._removeBlocks (cognitive 22): CharacterPromptBlockParser._removeBlocks has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (7 pts), boolean chains 5 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/character_prompt_block_parser.dart"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4025d5b0ac6ed9593d3a057bc0148a1e9ec48f11bc85ce6dec58c39dbe3312"}},{"ruleId":"D2","level":"warning","message":{"text":"InpaintMaskGeometry._fillPolygon (cognitive 22): InpaintMaskGeometry._fillPolygon has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (7 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/inpaint_mask/inpaint_mask_geometry.dart"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc79e40dbbff314e2a35fd48386c043fb9a763e176de58ef65a2598b754e2350"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptLiteralScanner._angleEnd (cognitive 22): PromptLiteralScanner._angleEnd has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, 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/core/utils/prompt_literal_scanner.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db6578a83b0f4524fa957dc17d02cee433defafaf414d1d0c8c8936d58f1f6c"}},{"ruleId":"D2","level":"warning","message":{"text":"TextSpaceConverter.convert (cognitive 22): TextSpaceConverter.convert has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4, boolean chains 3, ternaries 1 (2 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/core/utils/text_space_converter.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea3ecbd6434c1fd71738bec34074238115e15eed681f90d1b74287dc781229c"}},{"ruleId":"D2","level":"warning","message":{"text":"WatermarkLogoService._detectExtension (cognitive 22): WatermarkLogoService._detectExtension has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 19, if/else 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/core/watermark/watermark_logo_service.dart"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4509abc483792d4cc242c0fb2734cd71b12fd3d47ae5eb1d13416bd368a94c"}},{"ruleId":"D2","level":"warning","message":{"text":"AppCloudSyncDataSource.readVerifiedCloudObjects (cognitive 22): AppCloudSyncDataSource.readVerifiedCloudObjects has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 7, loops 1 (2 pts), error handling 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/data/cloud_sync/app_cloud_sync_data_source.dart"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"94704a714f7c70c290a9707e30e68b5775d41f6f77f1e01eed0cf1fd0fd10505"}},{"ruleId":"D2","level":"warning","message":{"text":"NAIAuthApiService.validateToken (cognitive 22): NAIAuthApiService.validateToken has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 5 (7 pts), boolean chains 2, error handling 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/data/datasources/remote/nai_auth_api_service.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a56e910c0003558a47edfe8cf6c59becae0acd1aac16f6dfedbe47c6ed8cfd"}},{"ruleId":"D2","level":"warning","message":{"text":"DonmaiGallerySourceAdapter._randomSearch (cognitive 22): DonmaiGallerySourceAdapter._randomSearch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 2 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f69063eab4fc163fda084eb6af8354fe844cd02f06257d5259ba6218d59838a"}},{"ruleId":"D2","level":"warning","message":{"text":"DlssWorker.run (cognitive 22): DlssWorker.run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 1 (2 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/data/services/dlss/dlss_worker.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"940ff72d5961c0230758419807c7d253c3b19f6b6eba04c955d46042e4a568ca"}},{"ruleId":"D2","level":"warning","message":{"text":"QuickTagCloudParser.parseCodex (cognitive 22): QuickTagCloudParser.parseCodex has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 14, if/else 4 (5 pts), boolean chains 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/online_gallery/quick_tag_cloud_parser.dart"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebba1c146c9c9a9c6a57dde6a44db8f716c727980979daeacdd3afbd2bc2f011"}},{"ruleId":"D2","level":"warning","message":{"text":"QuickTagCloudParser.normalizeImages (cognitive 22): QuickTagCloudParser.normalizeImages has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, ternaries 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/online_gallery/quick_tag_cloud_parser.dart"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf65846c965511818ce4916e1f54528875c58b64dc6268376ff53e7f352637f"}},{"ruleId":"D2","level":"warning","message":{"text":"PreciseRefLibraryArchiveService.exportToPath (cognitive 22): PreciseRefLibraryArchiveService.exportToPath has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 1 (3 pts), loops 2 (3 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/data/services/precise_ref_library_archive_service.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35983cf8adcc327feeb1bad74fbb990a3f345c9032de285ee1094f87a4232a7"}},{"ruleId":"D2","level":"warning","message":{"text":"TagLibraryPortableThumbnailStore.stage (cognitive 22): TagLibraryPortableThumbnailStore.stage has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, loops 2 (3 pts), error handling 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/data/services/tag_library_portable_thumbnail_store.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"c806495aa4e0711904a64855600a8411615dc9afd4b85678543499fded543368"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentChatNotifier._compactContext (cognitive 22): AgentChatNotifier._compactContext has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, ternaries 1 (3 pts), error handling 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/presentation/agent_chat/providers/agent_chat_notifier.dart"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"a384410b84a17adb4521a1903cee480b3b9d4d894d86c6b40c8c8d13f7365ffe"}},{"ruleId":"D2","level":"warning","message":{"text":"_AgentChatResourcePickerBodyState._loadLocalGallery (cognitive 22): _AgentChatResourcePickerBodyState._loadLocalGallery has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, ternaries 2 (3 pts), error handling 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/presentation/agent_chat/widgets/agent_chat_resource_widgets.dart"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"982e1c9cd50f7b1990a4313aec828d38c67f67b4d26b20060e9f80126c00794b"}},{"ruleId":"D2","level":"warning","message":{"text":"AssistantModelCatalog._resolvePiProvider (cognitive 22): AssistantModelCatalog._resolvePiProvider has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19 (20 pts), boolean chains 1, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/models/assistant_model_capability.dart"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"6605f7713d485e591f53c7dddc546d4ba986c7baded975bad5efbb1aa9ceeab3"}},{"ruleId":"D2","level":"warning","message":{"text":"_PromptAssistantOverlayState._runAction (cognitive 22): _PromptAssistantOverlayState._runAction has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 8, error handling 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/presentation/prompt_assistant/widgets/prompt_assistant_overlay.dart"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"4316561450bad88745b6ad3429a4ef16f80e5eb2690986e6abe9d9db1732ebef"}},{"ruleId":"D2","level":"warning","message":{"text":"SubscriptionNotifier.build (cognitive 22): SubscriptionNotifier.build has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 10, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/subscription_provider.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf5bdfdba3fe5c91737f3824b896c65e4ceac7b120debb3d7383bb50210c87e"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryPanelHeader.build (cognitive 22): HistoryPanelHeader.build has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 7 (17 pts), if/else 4 (5 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/presentation/screens/generation/widgets/history_panel/history_panel_header.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1367fef3686d4759bbd14cc8cad4d76e2a6465270d770ff08e88de084b1e92a"}},{"ruleId":"D2","level":"warning","message":{"text":"SidebarLinkPainter.paint (cognitive 22): SidebarLinkPainter.paint has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 6 (9 pts), boolean chains 2, 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/presentation/screens/generation/widgets/sidebar_link_painter.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f5389edcd0aed6b5db447da87c28771c8cb718c23bfbe7263d53f7057bf691"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryScrollPrefetchCoordinator.onScroll (cognitive 22): OnlineGalleryScrollPrefetchCoordinator.onScroll has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/online_gallery/online_gallery_scroll_prefetch_coordinator.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2404545310d9ed2b5af17b0214e05ddda2edb80b569ce8d812707997be2a15ff"}},{"ruleId":"D2","level":"warning","message":{"text":"_ProviderModelListState.build (cognitive 22): _ProviderModelListState.build has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 4 (6 pts), ternaries 2 (4 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/presentation/screens/settings/sections/model_services/provider_models_card.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da4f4bc87af0aca7c746195c4d54c50b39809e8b617911e84c74d82851c4871"}},{"ruleId":"D2","level":"warning","message":{"text":"_EntryCardState.build (cognitive 22): _EntryCardState.build has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 7 (8 pts), boolean chains 7, if/else 7 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/tag_library_page/widgets/entry_card.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c138eb8d3d37277621b73e0e15de8e085ad3cc69f79f16f1d65eac74def32e"}},{"ruleId":"D2","level":"warning","message":{"text":"_EntryListItemState.build (cognitive 22): _EntryListItemState.build has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 8 (12 pts), if/else 7 (8 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/tag_library_page/widgets/entry_list_item.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a1e67c8cce0474e1b3ae294eac81d27144446849dfd049bbed3eb8e7274661"}},{"ruleId":"D2","level":"warning","message":{"text":"_AutocompleteWrapperState._buildOverlay (cognitive 22): _AutocompleteWrapperState._buildOverlay has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 11, boolean chains 9, if/else 2. 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/presentation/widgets/autocomplete/autocomplete_wrapper.dart"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27db38a96a010d00b126e11023c07ea5a8736be358408071d2e57866c6bd97c"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageCardActionCatalog.build (cognitive 22): ImageCardActionCatalog.build has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 8, if/else 7, ternaries 5 (7 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/image_card_actions.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d99b592067ab36d2327dfe77db77cd1f0c6bd95bef523818719e86ba35ec09"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateCheckDialog._buildActions (cognitive 22): UpdateCheckDialog._buildActions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/update_check_dialog.dart"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"933696bd91ed2dac743cea19af1883262626b14ef7939fc044887bdb4518756f"}},{"ruleId":"D2","level":"warning","message":{"text":"InpaintMaskActionsController.fillClosedMaskRegionsAt (cognitive 22): InpaintMaskActionsController.fillClosedMaskRegionsAt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, error handling 2 (3 pts), match/switch 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/presentation/widgets/image_editor/controllers/inpaint_mask_actions_controller.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f2e7e05ab20943fe27db65f76a7002b4c5fa3b278f8451e26e6d80b099caba"}},{"ruleId":"D2","level":"warning","message":{"text":"_GalleryDetailActionRailState._entries (cognitive 22): _GalleryDetailActionRailState._entries has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, ternaries 5 (8 pts), if/else 3 (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/presentation/widgets/online_gallery/gallery_detail_action_rail.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"c267a74be77381d5c1fb0ccaace7e607a7424cc4a3fa17dd83ce5dc3084f2e58"}},{"ruleId":"D2","level":"warning","message":{"text":"GalleryDetailInfoPanel._buildCodexOverview (cognitive 22): GalleryDetailInfoPanel._buildCodexOverview has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 6 (7 pts), loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/online_gallery/gallery_detail_info_panel.dart"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cb1604d92e6c53bfba2baf25cafa1f2d3b48e038286674ca109fc766e426c7"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryCardStatusOverlays.build (cognitive 22): OnlineGalleryCardStatusOverlays.build has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 8, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/online_gallery/online_gallery_card_status_overlays.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebcbe042dc026507847fc9060fcf850303b25f080b906f0b6dc81ee06100b02"}},{"ruleId":"D2","level":"warning","message":{"text":"_TaskEditDialogState._buildParametersSection (cognitive 22): _TaskEditDialogState._buildParametersSection has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 7, 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/presentation/widgets/queue/task_edit_dialog.dart"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7d98648a1d1315729fcd619595dd931300de1890e27f68aff49cf62f97ccf9"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryPrefetchCoordinator._run (cognitive 21): OnlineGalleryPrefetchCoordinator._run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 1 (3 pts), error handling 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/core/cache/online_gallery_prefetch_coordinator.dart"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"13069b24f65f350c2e22ce3463a0a0c0b38777d8178d88d00cbba39ee4e17ac0"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteGalleryImageRepository.getImagesByIds (cognitive 21): SqliteGalleryImageRepository.getImagesByIds has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (8 pts), error handling 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/core/database/datasources/gallery_image_repository.dart"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"2163120c1a0a02ed98e6aeaa055ce4d9b3fda7449b89b6b458eb5fa875bceb45"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptTokenCounterService._normalizePromptForCounting (cognitive 21): PromptTokenCounterService._normalizePromptForCounting has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/services/prompt_token_counter_service.dart"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eaa8dde5716262b64158b1042381bbbbe6ba7a95d857aceb4dbc5f5654c0752"}},{"ruleId":"D2","level":"warning","message":{"text":"ExifContainer.jpegHeaderSegments (cognitive 21): ExifContainer.jpegHeaderSegments has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, 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/core/utils/exif_container.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e6c0706eecae907c3755307fbcb30ff650d832ed56f1e97e98210729c341d0"}},{"ruleId":"D2","level":"warning","message":{"text":"FileExplorerUtils._tryRevealFileWithShellApiUnsafe (cognitive 21): FileExplorerUtils._tryRevealFileWithShellApiUnsafe has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5 (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/core/utils/file_explorer_utils.dart"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fd17883986fcc8a22c3dc5d8e1a328e9731df157d428a7839ac4373b6ac5b7"}},{"ruleId":"D2","level":"warning","message":{"text":"HiveStorageHelper._cleanupMigratedOldFiles (cognitive 21): HiveStorageHelper._cleanupMigratedOldFiles has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), error handling 1 (3 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/hive_storage_helper.dart"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1d300706fe0f7c3e22745971e974c0a4652f361e7bd6daa309aded09e38481"}},{"ruleId":"D2","level":"warning","message":{"text":"InpaintMaskUtils.prepareNovelAiInpaintMaskArtifacts (cognitive 21): InpaintMaskUtils.prepareNovelAiInpaintMaskArtifacts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 6, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"3988b95cb73f48492ad52be0ea555af31d51e79a7b7d6e44b27c08f8faed448e"}},{"ruleId":"D2","level":"warning","message":{"text":"InpaintOutpaintUtils.materializeVirtualFrame (cognitive 21): InpaintOutpaintUtils.materializeVirtualFrame has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 2 (3 pts), ternaries 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/inpaint_outpaint_utils.dart"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc775665fccaee6d5e3154d8740970a44a0ba3af276b1c80220c23c7b13b9931"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeLibraryCloudSyncAdapter.apply (cognitive 21): VibeLibraryCloudSyncAdapter.apply has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 1 (3 pts), error handling 1 (2 pts), loops 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/data/cloud_sync/vibe_library_cloud_sync_adapter.dart"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c45fc408b612db384f7f128c23d3f1b771f5637d5bd659b7feaf3e770e74ce"}},{"ruleId":"D2","level":"warning","message":{"text":"QuickTagCloudGalleryRepository.recordFor (cognitive 21): QuickTagCloudGalleryRepository.recordFor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), boolean chains 1, error handling 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/data/datasources/remote/online_gallery/quick_tag_cloud_gallery_repository.dart"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b9a77a7aeb940d9a6cea5f00bcd29f62b852d6b586e42573dd0144f02324ed"}},{"ruleId":"D2","level":"warning","message":{"text":"NaiImageMetadataRawDecoder._extractVibeReferences (cognitive 21): NaiImageMetadataRawDecoder._extractVibeReferences has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 4 (8 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/models/gallery/nai_image_metadata_raw_decoder.dart"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"494faf1f95034e3e1bc3045e20a8bb9d9a83986ee4c2a543be6cc309ced2c9ca"}},{"ruleId":"D2","level":"warning","message":{"text":"NaiImageMetadataRawDecoder._modelIdFromSourceText (cognitive 21): NaiImageMetadataRawDecoder._modelIdFromSourceText has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (18 pts), ternaries 1 (2 pts), boolean chains 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/data/models/gallery/nai_image_metadata_raw_decoder.dart"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d72778a134ba850633889fc5877c0bd50d1c054fa140ccf58f90f17eba322e"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkedGalleryItems.mergePage (cognitive 21): ChunkedGalleryItems.mergePage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (7 pts), boolean chains 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/data/models/online_gallery/chunked_gallery_items.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"931d332f9e02910ffae865a16257e82856e1631c3dc71bd1b922a1855c04cbb8"}},{"ruleId":"D2","level":"warning","message":{"text":"GalleryPromptCopyProjection.buildText (cognitive 21): GalleryPromptCopyProjection.buildText has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, loops 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/models/online_gallery/gallery_prompt_projection.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"865ce4eac04ab50207a2a64bfc5ff83f958a8ba80c5b1e6c9a769faace516a61"}},{"ruleId":"D2","level":"warning","message":{"text":"TagLibraryEntry.promptTagCount (cognitive 21): TagLibraryEntry.promptTagCount has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5, 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/data/models/tag_library/tag_library_entry.dart"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb962624c5f04c280f9077a55e050e7a19cdffac53b30f335219be7ec5ec9a6"}},{"ruleId":"D2","level":"warning","message":{"text":"GalleryAlbumImportCoordinator._importFromLegacyCollections (cognitive 21): GalleryAlbumImportCoordinator._importFromLegacyCollections has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 1 (4 pts), loops 2 (3 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/data/services/gallery/gallery_album_import_coordinator.dart"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c024218f2aca565744e3e0c4f5306f11044f392af2cf3a708c31f4a198001f05"}},{"ruleId":"D2","level":"warning","message":{"text":"FilterCriteria.hasFilters (cognitive 21): FilterCriteria.hasFilters has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 21. 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/data/services/gallery/gallery_filter_service.dart"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"94faf59195c55c6664e60cec1b56f25b4f0c1c74d88e7c427549e092da827991"}},{"ruleId":"D2","level":"warning","message":{"text":"FilterCriteria.cacheKey (cognitive 21): FilterCriteria.cacheKey has cognitive complexity 21 (threshold 15). Drivers by points: if/else 21. 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/data/services/gallery/gallery_filter_service.dart"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a6ca7ea1fe2093fb385b371035e0e7d1f4c58ec3edd743d482e03a7733ef5c"}},{"ruleId":"D2","level":"warning","message":{"text":"InpaintDraftFileRepository._load (cognitive 21): InpaintDraftFileRepository._load has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, error handling 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/data/services/inpaint_draft_file_repository.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cd557d60704f2c104bcb648a63fbaf920c9e026ebf7aeeb3cbf876590d5cc7"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageMetadataContainerCodec.embedTextChunkOnly (cognitive 21): ImageMetadataContainerCodec.embedTextChunkOnly has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (4 pts), boolean chains 1, error handling 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/data/services/metadata/image_metadata_container_codec.dart"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb7f109a64fcf15544d38941b2598a041556b0b1a75830616e14d2d5c02a391"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryBlacklistFilterService.filter (cognitive 21): OnlineGalleryBlacklistFilterService.filter has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (7 pts), error handling 1 (2 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/data/services/online_gallery/online_gallery_blacklist_filter_service.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3564f02485c524ebf51122e0abd8bc8d68393d7f90f73e358aacac2a25091134"}},{"ruleId":"D2","level":"warning","message":{"text":"PreciseRefPortableImporter.import (cognitive 21): PreciseRefPortableImporter.import has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, error handling 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/data/services/precise_ref_portable_importer.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"413cdb7df2c28f18752df03e43a9433686abd4708239bfada140f62486b30a3c"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeFileDocumentCodec._mergeCompatibleEncodings (cognitive 21): VibeFileDocumentCodec._mergeCompatibleEncodings has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/vibe_file_document_codec.dart"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3afa3af860ca43525d7a164cf38aabda5f8d5079eb54c1b0abc5d0648dcda44"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerationInterrogationService._loadImage (cognitive 21): GenerationInterrogationService._loadImage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/generation_interrogation_service.dart"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fbd62c9ec04601fda88358088df43f3c4adbc806a6ab9f2e27bf9361b66c6e"}},{"ruleId":"D2","level":"warning","message":{"text":"ManualInpaintToolbox._observeEditor (cognitive 21): ManualInpaintToolbox._observeEditor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 3 (7 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/manual_inpaint_toolbox.dart"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6ea4f1d39012440401d4d709ff240a979d1ce75c05232077dbeeb791ca1c09"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentChatInputController.buildTextSpan (cognitive 21): AgentChatInputController.buildTextSpan has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 6 (15 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/widgets/agent_chat_input_controller.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbec78d168a931c0849c2ff175586f56be420dd171a24bcffb4595031fa48715"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryBlacklistNotifier.pullFromCloud (cognitive 21): OnlineGalleryBlacklistNotifier.pullFromCloud has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), error handling 2, ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/online_gallery_blacklist_provider.dart"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f98f36e20eec59fab7075917f27deeb144734221b0431b5578aa311c57a84f8"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryNotifier.goToPage (cognitive 21): OnlineGalleryNotifier.goToPage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, 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/presentation/providers/online_gallery_provider.dart"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"10508e234d6a16624d393c27002e2f30a9725cf40979e5e40f2b8d494b08df59"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryGrid.build (cognitive 21): OnlineGalleryGrid.build has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 9 (10 pts), boolean chains 6, if/else 4, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/online_gallery/online_gallery_grid.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"384b28b660370879515f0c8426807ec314072a4ab576c6d1b2c88960847037f5"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryPagination._buildBar (cognitive 21): OnlineGalleryPagination._buildBar has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 7, boolean chains 3 (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/presentation/screens/online_gallery/online_gallery_pagination.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc66580b507439a9d627456a98d32d29a8e4c5c843a1214e69c703af8ec8e9f"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryScrollPrefetchCoordinator._requestNextIfNeeded (cognitive 21): OnlineGalleryScrollPrefetchCoordinator._requestNextIfNeeded has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 13, if/else 6, ternaries 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/presentation/screens/online_gallery/online_gallery_scroll_prefetch_coordinator.dart"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac253c3d57cd8656c9333e828266d4aebc2d882dfd3d2057c6ba0e7eb41f699"}},{"ruleId":"D2","level":"warning","message":{"text":"_GenerationSettingsSectionState.build (cognitive 21): _GenerationSettingsSectionState.build has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 7 (8 pts), error handling 2, boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/settings/sections/generation_settings_section.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"143f207f72c7ad0b88531278c2f8af45ac4922634bbb1cd92469b0657b0a3fee"}},{"ruleId":"D2","level":"warning","message":{"text":"_WorkflowImportWizardState._pickWorkflowFile (cognitive 21): _WorkflowImportWizardState._pickWorkflowFile has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 2, error handling 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/presentation/screens/settings/widgets/workflow_import_wizard.dart"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cca045ef8cfb4c3835c685838e0db3bbe9966a9f8384f88ae1469b195651c2"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeImportController._processSources (cognitive 21): VibeImportController._processSources has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/vibe_library/vibe_import_controller.dart"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5c55f6cce4a5fcb97bf5acb5575a68131b73c7618f4383bf73e646d61a4c3e"}},{"ruleId":"D2","level":"warning","message":{"text":"DroppedFileReader.downloadRemoteMetadataPrefix (cognitive 21): DroppedFileReader.downloadRemoteMetadataPrefix has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (2 pts), boolean chains 1, error handling 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/presentation/utils/dropped_file_reader.dart"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"caeeea30a9e07663312379687afce2afdd3c93cc75de167018c02969120cae78"}},{"ruleId":"D2","level":"warning","message":{"text":"_CredentialsLoginFormState.build (cognitive 21): _CredentialsLoginFormState.build has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 4 (6 pts), boolean chains 5 (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/presentation/widgets/auth/credentials_login_form.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac11f6f3b07e5ce77db5ae965043c1b5de8ab0360c11dc8e51ec85be69e43b20"}},{"ruleId":"D2","level":"warning","message":{"text":"AutocompleteUtils._parseCurrentTagSegment (cognitive 21): AutocompleteUtils._parseCurrentTagSegment has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, 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/presentation/widgets/autocomplete/autocomplete_utils.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a30fbd02a22b4423aa9254d144423682359794fc94f24509fcd25bdc4e0cfc"}},{"ruleId":"D2","level":"warning","message":{"text":"_AutocompleteWrapperState._onTextChanged (cognitive 21): _AutocompleteWrapperState._onTextChanged has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 6 (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/presentation/widgets/autocomplete/autocomplete_wrapper.dart"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6ceac4832e4dc3b4ce6f5517ab33c2ca3eefdbcf3befb5010bad4e140dacfc"}},{"ruleId":"D2","level":"warning","message":{"text":"_IncomingImageShareHandlerState._drain (cognitive 21): _IncomingImageShareHandlerState._drain has cognitive complexity 21 (threshold 15). Drivers by points: if/else 2 (9 pts), loops 2 (5 pts), error handling 1 (4 pts), boolean chains 3 (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/presentation/widgets/drop/incoming_image_share_handler.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d81ba10482b65b6baad1273ebc19f2c80d5ac0646e640d9d32c5c9713e6d5a5"}},{"ruleId":"D2","level":"warning","message":{"text":"_GalleryCategoryTreeViewState._buildCategoryNode (cognitive 21): _GalleryCategoryTreeViewState._buildCategoryNode has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 9 (10 pts), boolean chains 7, if/else 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/gallery/gallery_category_tree_view.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4631fdb3fef59596d86be6fb62ca7bbab736ee38129a73c68094f75b4cb62f6d"}},{"ruleId":"D2","level":"warning","message":{"text":"InputHandler.handlePointerDown (cognitive 21): InputHandler.handlePointerDown has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 7 (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/presentation/widgets/image_editor/core/input_handler.dart"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8501a8a637e49f17e69ba8ab321cca5b32b24f4a292c54d339b4868d41b551f"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionState.findEntriesOnBranch (cognitive 20): SessionState.findEntriesOnBranch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/harness/session/session_state.dart"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8ec064f54a18e886725779fd84aee8690775decd83afcb6d35b2303419ab37"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptTokenParser.apply (cognitive 20): PromptTokenParser.apply has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 6 (10 pts), boolean chains 5, if/else 4 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/autocomplete/prompt_token_parser.dart"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"c120e5990fe815d182e7a54a7ed2f54c57d9e5c6f65aeda36a50f6f4f6c5c0ab"}},{"ruleId":"D2","level":"warning","message":{"text":"FocusedInpaintUtils._findBinaryMaskBounds (cognitive 20): FocusedInpaintUtils._findBinaryMaskBounds has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/focused_inpaint_utils.dart"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe6ef9c0cd7b8f3445002afdc9ae5e557798a8b1d52bda57227ea0eaf298979"}},{"ruleId":"D2","level":"warning","message":{"text":"InpaintMaskUtils.encodeEditorOverlayPatch (cognitive 20): InpaintMaskUtils.encodeEditorOverlayPatch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a19d6511891527c47dd32583745f926eedcf095ec22c6eaa87416d17636888"}},{"ruleId":"D2","level":"warning","message":{"text":"NaiPromptParser._extractWeight (cognitive 20): NaiPromptParser._extractWeight has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 2, ternaries 2 (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/core/utils/nai_prompt_parser.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5ff03abc269911430d6467de12574cae2c66b2a4989149dd889cf1670e851c"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptEditDocument._span (cognitive 20): PromptEditDocument._span has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 12, if/else 8. 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/core/utils/prompt_edit_document.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1dd869a00c990230e93958c06d3f70fd261eeeedc02fbae988277486d37fe4"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptEditDocument.effectiveText (cognitive 20): PromptEditDocument.effectiveText has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 5, loops 3 (4 pts), ternaries 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/prompt_edit_document.dart"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a3455e84caaae1b0a3ba39e2342c0e3850e76a705fdf8e79add36d8bf588c7"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeLibraryPathHelper._migrateFromOldLocationIfNeeded (cognitive 20): VibeLibraryPathHelper._migrateFromOldLocationIfNeeded has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 2 (4 pts), 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/core/utils/vibe_library_path_helper.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5672ebf2d47b777f7da497bec771d950a02163f379c96e440f5b790978733ac8"}},{"ruleId":"D2","level":"warning","message":{"text":"CloudSyncOperationStorage._validRecordIndex (cognitive 20): CloudSyncOperationStorage._validRecordIndex has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 20. 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/data/cloud_sync/cloud_sync_operation_storage.dart"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"8492917b03526ffaa2f9006d470e91e88f19ef80e7381f0bebc3dbda1c26328c"}},{"ruleId":"D2","level":"warning","message":{"text":"AiTagGenerationInfo.toJson (cognitive 20): AiTagGenerationInfo.toJson has cognitive complexity 20 (threshold 15). Drivers by points: if/else 20. 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/data/models/online_gallery/ai_tag_generation_info.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4126fa0587cab02d88ed19db5a362198178350576d42c5483b5da40bf612d6e9"}},{"ruleId":"D2","level":"warning","message":{"text":"AccountManagerNotifier.addAccount (cognitive 20): AccountManagerNotifier.addAccount has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/account_manager_provider.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"77be6ff88ef929db55f7b0702d147fca6f9a311334a86c93c20305f35f41738f"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentChatSessionController._finishTurn (cognitive 20): AgentChatSessionController._finishTurn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/agent_chat_session_controller.dart"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a441d06b4b3c89ae42a0110cf24b729b9be00ff99dbac6166081984d167973"}},{"ruleId":"D2","level":"warning","message":{"text":"KritaBridgeService._generate (cognitive 20): KritaBridgeService._generate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, error handling 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/presentation/providers/krita/krita_bridge_service.dart"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0858f4eda3f00dfce2eddabe8e5c0b3ef26bb8a5ae6b25454ba6f0260862fee4"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueExecutionNotifier._onGenerationStateChanged (cognitive 20): QueueExecutionNotifier._onGenerationStateChanged has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 8 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/queue_execution_provider.dart"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"306feb6cc28a4eeb449021dd5f8a13f182d32a0f8642516184a9f7fe2aa1f493"}},{"ruleId":"D2","level":"warning","message":{"text":"RandomPresetNotifier._loadPresets (cognitive 20): RandomPresetNotifier._loadPresets has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 3 (4 pts), loops 3, boolean chains 2, error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/random_preset_provider.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab17f38c85930fa8ff968ad55d97022ea8daa20af5801adaf5df7302d8733ec"}},{"ruleId":"D2","level":"warning","message":{"text":"_HeatmapChartState.build (cognitive 20): _HeatmapChartState.build has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 12, boolean chains 5, loops 1 (2 pts), if/else 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/statistics/widgets/charts/heatmap_chart.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9834b799286ef70a8fa4f6ed584eb4cbdb556e2b4b68039bfd527ff681b51d72"}},{"ruleId":"D2","level":"warning","message":{"text":"_CategoryItemState.build (cognitive 20): _CategoryItemState.build has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 12 (14 pts), boolean chains 3, if/else 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"656458cf236caba7d237031557730e2ae51388e57132b6688eaebb43a0a3c94d"}},{"ruleId":"D2","level":"warning","message":{"text":"_VibeDetailViewerState._imageBytes (cognitive 20): _VibeDetailViewerState._imageBytes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5 (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/presentation/screens/vibe_library/widgets/vibe_detail_viewer.dart"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed73ff501afbc3f3e35cf1d433da5b4c0cc8b2c2d03c696140c96e053325751"}},{"ruleId":"D2","level":"warning","message":{"text":"DroppedFileReader._resolve (cognitive 20): DroppedFileReader._resolve has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, ternaries 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/utils/dropped_file_reader.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b756886ea5124a1975c5a204a9a2ee21a7f2e7361f649a2191a69e8ef999c600"}},{"ruleId":"D2","level":"warning","message":{"text":"_AutocompleteWrapperState._onCompletionStateChanged (cognitive 20): _AutocompleteWrapperState._onCompletionStateChanged has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (9 pts), ternaries 1 (nesting depth added 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/presentation/widgets/autocomplete/autocomplete_wrapper.dart"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8330bc5117e05e101301f4d19a92285bcb57c97574c9380e4ef3baafa2593f"}},{"ruleId":"D2","level":"warning","message":{"text":"_ActionButton.build (cognitive 20): _ActionButton.build has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9, ternaries 6 (9 pts), boolean chains 2 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/bulk_action_bar.dart"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c6796080895b27883b0f0a165aa4970412c35fc7bba92cc5c97395c4cb1663"}},{"ruleId":"D2","level":"warning","message":{"text":"AppStateView.build (cognitive 20): AppStateView.build has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 5 (6 pts), boolean chains 2, match/switch 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/presentation/widgets/common/app_state_view.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed53d5bff9e7c6a676cfe9b51ac18f822e5f94c944dd792df85d5efa23520a0"}},{"ruleId":"D2","level":"warning","message":{"text":"_ThemedInputState.build (cognitive 20): _ThemedInputState.build has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 5 (7 pts), boolean chains 4 (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/presentation/widgets/common/themed_input.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b00b7f5c634641071683bd546f0ef439a5a825ea134e2e05ec8a7908776fcb6"}},{"ruleId":"D2","level":"warning","message":{"text":"_HoverPreviewCardInnerState.build (cognitive 20): _HoverPreviewCardInnerState.build has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 4 (6 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/presentation/widgets/danbooru_post_card.dart"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a366e3b668e073b613b0e7584014a1040979eaee15c4ceee72f74d79ab7fd47"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorExitCoordinator.exportAndClose (cognitive 20): EditorExitCoordinator.exportAndClose has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 7, ternaries 1 (2 pts), error handling 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/presentation/widgets/image_editor/controllers/editor_exit_coordinator.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa24b22e4b36d14e9cb0d923649de16a0548fc98a7f49c036baf270f1b219dc"}},{"ruleId":"D2","level":"warning","message":{"text":"InpaintMaskActionsController.loadMaskFile (cognitive 20): InpaintMaskActionsController.loadMaskFile has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, error handling 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/presentation/widgets/image_editor/controllers/inpaint_mask_actions_controller.dart"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d6cc1d110c52c1bba52fb7ad2749ac8ec4d9173fe5d6ac8967ee6c6410c8b1"}},{"ruleId":"D2","level":"warning","message":{"text":"_GlobalSettingsDialogState._showAddTagOptionDialog (cognitive 20): _GlobalSettingsDialogState._showAddTagOptionDialog has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 5 (8 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/presentation/widgets/prompt/global_settings_dialog.dart"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4173210980dfcdf8eb610f7b43da01f73868a306612df285d89e66a48833f53"}},{"ruleId":"D2","level":"warning","message":{"text":"_TaskListItemState._buildActionButtons (cognitive 20): _TaskListItemState._buildActionButtons has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, match/switch 1 (2 pts), ternaries 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/queue/task_list_item.dart"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd24045876bff6adc1078f04e4d076edb7ab4d3bd0ba2954b9891253d3a2b80d"}},{"ruleId":"D2","level":"warning","message":{"text":"acceptance_report._manual_evidence_from_args (cognitive 20): acceptance_report._manual_evidence_from_args has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, ternaries 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"krita_plugin/acceptance_report.py"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33c17f877af071372c911ccad3c828fe0c66193829ce9e89824f5486698e8da"}},{"ruleId":"D2","level":"warning","message":{"text":"editor.applySceneState (cognitive 20): editor.applySceneState has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/model3d_editor/editor.js"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"a711e3a8063a9d5f914403655888dede3944f682484cb288ab021544f2ca8665"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentProfileService.previewImport (cognitive 19): AgentProfileService.previewImport has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 3, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/agent_profile_service.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3587ce2d3412010dc0afd638ee9f3334a8a7a067a81be1d086ddbee1b7eb1ecb"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillArchiveService.install (cognitive 19): SkillArchiveService.install has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), error handling 2 (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/core/agent/skill_archive_service.dart"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5556c83b2a7abfa389de4c4706c353bdcf0b54e102e92289ec0d5674116866"}},{"ruleId":"D2","level":"warning","message":{"text":"TagCatalogRepository.search (cognitive 19): TagCatalogRepository.search has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, ternaries 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/autocomplete/tag_catalog_repository.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f101962ca00536f1d0d8afeb1d766a57fbdb2f4b59276c14e400fa728171ee"}},{"ruleId":"D2","level":"warning","message":{"text":"TagCatalogRepository.searchTranslations (cognitive 19): TagCatalogRepository.searchTranslations has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (12 pts), if/else 3 (4 pts), boolean chains 2, 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/core/autocomplete/tag_catalog_repository.dart"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b6f1a894f25de4a0965747a56fb7e3e25253a64592f089bc67e62b11a12cfe"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryDetailCoordinator.request (cognitive 19): OnlineGalleryDetailCoordinator.request has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 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/core/cache/online_gallery_detail_coordinator.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b83f96fec0daa9feec2ede94116c722a000e55e96994dac728b80a7c715f29"}},{"ruleId":"D2","level":"warning","message":{"text":"SyncOperationRunner.run (cognitive 19): SyncOperationRunner.run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, error handling 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/core/cloud_sync/sync_operation_runner.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3293d66b32ac8cfa9f5a8a4976d4e652ef02f53e956ae28c9e33d5bbff348438"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionPoolHolder.warmup (cognitive 19): ConnectionPoolHolder.warmup has cognitive complexity 19 (threshold 15). Drivers by points: error handling 5 (13 pts), if/else 3, loops 2, 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/core/database/connection_pool_holder.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cd149bebd1997d5aea037a13b48558b1c7d1d56ca4346eec0a7efc21ebc9a4"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthInterceptor.onError (cognitive 19): AuthInterceptor.onError has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, error handling 1 (nesting depth added 8). 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/core/network/dio_client.dart"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0493057d6e230aef93ed73263c951ebdf18d2ab7188c8049a8c4ada6b7306b"}},{"ruleId":"D2","level":"warning","message":{"text":"DanbooruTagsRefreshService._fetchCategory (cognitive 19): DanbooruTagsRefreshService._fetchCategory has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 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/core/services/danbooru_tags_refresh_service.dart"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4504083707ae13193666cbf2cc015137e79e5054e111f6cc26d39780a1ff9c5"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticLogExportService._buildArchive (cognitive 19): DiagnosticLogExportService._buildArchive has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), ternaries 1 (4 pts), loops 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/core/services/diagnostic_log_export_service.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ddbe06a622ca1ec6a20b6ee1dfbc6e8b47e5bceaaab38d656654011d331dfd"}},{"ruleId":"D2","level":"warning","message":{"text":"InpaintMaskUtils.fillClosedMaskRegions (cognitive 19): InpaintMaskUtils.fillClosedMaskRegions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4, boolean chains 2, error handling 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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57ea21abac8a92b4833703313b88edff35b4e5576adb32d83a72b30019e7320"}},{"ruleId":"D2","level":"warning","message":{"text":"InpaintOutpaintUtils._createExpandedMask (cognitive 19): InpaintOutpaintUtils._createExpandedMask has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (8 pts), boolean chains 3 (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/core/utils/inpaint_outpaint_utils.dart"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60c18f4035ca38808633ec66e81615366a5800a0d0a735581a1c41b42385a0a"}},{"ruleId":"D2","level":"warning","message":{"text":"NovelAiVibeCodec._imageMimeType (cognitive 19): NovelAiVibeCodec._imageMimeType has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 12, if/else 6 (7 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/novelai_vibe_codec.dart"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abe54f0d584d255cfb15fc0ddb8607a6d7fe0514a534842c3a6ae563958090f"}},{"ruleId":"D2","level":"warning","message":{"text":"StrictHiveCloudSyncAdapter._deepEquals (cognitive 19): StrictHiveCloudSyncAdapter._deepEquals has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), boolean chains 3 (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/data/cloud_sync/strict_hive_cloud_sync_adapter.dart"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f80a0d3a7aa51a174b588ea82cb424100d773421ad46fc4ed4f3fe9cdbf87f6"}},{"ruleId":"D2","level":"warning","message":{"text":"NaiImageMetadataRawDecoder._extractNestedEncoding (cognitive 19): NaiImageMetadataRawDecoder._extractNestedEncoding has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 2 (4 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/data/models/gallery/nai_image_metadata_raw_decoder.dart"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9c38ce1927646696edb280049f95c282af692e87245f1248455bcf467c8e95"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryBlacklistRepository._isValidV2 (cognitive 19): OnlineGalleryBlacklistRepository._isValidV2 has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 13, if/else 3 (5 pts), loops 1 (nesting depth added 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/data/repositories/online_gallery_blacklist_repository.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d2fff46f51e90529feb5b1f90ed635e1ea57aa6937bf9e910cfc2225db83e1"}},{"ruleId":"D2","level":"warning","message":{"text":"DiscordShareService.authenticate (cognitive 19): DiscordShareService.authenticate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, error handling 1 (2 pts), loops 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/data/services/discord_share_service.dart"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6ea2ad2809ebb5c3ad61890c3fc5ba8b6d904757f385c1fff1d0644fba464b"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalOnnxModelService._inferKind (cognitive 19): LocalOnnxModelService._inferKind has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 13, if/else 6. 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/data/services/local_onnx_model_service.dart"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"db79dab97c57efac7536307ab962b81cb7a9077906729e3af0891efecd2d32fd"}},{"ruleId":"D2","level":"warning","message":{"text":"NaiCommentComposer._fieldsComment (cognitive 19): NaiCommentComposer._fieldsComment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, loops 3 (6 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/data/services/metadata/nai_comment_composer.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c3bf712c1f3503ba3adc16cdc7de1821b169b14df6071c8f0b0e61781ff9fd"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGallerySearchService.filterByPlan (cognitive 19): OnlineGallerySearchService.filterByPlan has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (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/data/services/online_gallery/online_gallery_search_service.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8914a601501e5fd87be53718dc934ce8c11b5b77715d7fcbd4494f07efc1a8"}},{"ruleId":"D2","level":"warning","message":{"text":"PreciseRefLibraryArchiveService._stageVerifiedResources (cognitive 19): PreciseRefLibraryArchiveService._stageVerifiedResources has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 4, loops 2 (4 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/data/services/precise_ref_library_archive_service.dart"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed6969ac5f02f54c001cf0d465c3c554df3e1c7129cb7c79711740068263f0e"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerationQueueTaskService.queueTask (cognitive 19): GenerationQueueTaskService.queueTask has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 1 (3 pts), boolean chains 2, ternaries 2, error handling 1 (nesting depth added 5). 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/presentation/agent_chat/services/generation_queue_task_service.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50bcd66a9a31fc45b326771eee081fc05b8e5e98f90f221b72001b33a0d995b"}},{"ruleId":"D2","level":"warning","message":{"text":"InpaintDraftAuthoringService._commit (cognitive 19): InpaintDraftAuthoringService._commit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 2, error handling 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/presentation/agent_chat/services/inpaint_draft_authoring_service.dart"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"990c66d167ab90afed16e3c075299f1948e29fae5437143c5f7a07a0a158dd3d"}},{"ruleId":"D2","level":"warning","message":{"text":"ManualInpaintToolbox._create (cognitive 19): ManualInpaintToolbox._create has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, error handling 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/presentation/agent_chat/services/manual_inpaint_toolbox.dart"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8f022e07b739721d745505870c0db7392325353f91bd286cf4cf85e6bb6ac6"}},{"ruleId":"D2","level":"warning","message":{"text":"_AgentChatSessionPickerBodyState.build (cognitive 19): _AgentChatSessionPickerBodyState.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 15, if/else 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/presentation/agent_chat/widgets/agent_chat_session_picker.dart"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3dcdc37c2f6580b7ed59ade7b3319e287a851f9db4059602cfa46c8ebb18fc"}},{"ruleId":"D2","level":"warning","message":{"text":"_ToolResultResourcePreviewState._openOriginal (cognitive 19): _ToolResultResourcePreviewState._openOriginal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, error handling 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/presentation/agent_chat/widgets/agent_chat_tool_resource_preview.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1da4101f7e24aa49bbda9c592b939f0fe4fa9c6c1a57012b245401286571ee"}},{"ruleId":"D2","level":"warning","message":{"text":"_WorkItemGroupTileState.build (cognitive 19): _WorkItemGroupTileState.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (8 pts), if/else 5 (7 pts), loops 1 (2 pts), match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/widgets/agent_chat_turn.dart"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab1747e00f7eed1b82e65ac6ed31173d9270e66e80f00bcfc1bd54e7623d4bb"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentSettingsNotifier._load (cognitive 19): AgentSettingsNotifier._load has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 1 (3 pts), error handling 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/presentation/agent_settings/providers/agent_settings_provider.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86832b000716174d0f7a6720a4129684ab424e2512727d32a8769857bfc1be4"}},{"ruleId":"D2","level":"warning","message":{"text":"McpImageResponseService._imageContent (cognitive 19): McpImageResponseService._imageContent has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, error handling 2, ternaries 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/mcp/services/mcp_image_response_service.dart"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ead933230331dc76ef4feabcccba340a781ba96f7c77ee7e884a93a70ea9da6"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptAssistantService._detectImageMime (cognitive 19): PromptAssistantService._detectImageMime has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 15, if/else 4. 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/presentation/prompt_assistant/services/prompt_assistant_service.dart"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c1846f370d9d12c80a1cfacef12d69d03af86269db2a6f93fb66d7fb766be1"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageUpscaleCoordinator._runSeedVr2 (cognitive 19): ImageUpscaleCoordinator._runSeedVr2 has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 4 (7 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/generation/image_upscale_coordinator.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebf679ec845a1f8a5a7ee86397a43d310df4c118ac8c80b22ca4a4f7f088f54"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeExportHandler.embedIntoImage (cognitive 19): VibeExportHandler.embedIntoImage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 1 (2 pts), boolean chains 1, error handling 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/presentation/screens/generation/handlers/vibe_export_handler.dart"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a55ceb441aa40375303bac749de3e67f5d86188ec57a1aa8c5e192771fdc96"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerateButtonWithCost._buildPrimaryButton (cognitive 19): GenerateButtonWithCost._buildPrimaryButton has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 10 (12 pts), if/else 4, boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/widgets/generation_controls/generate_button.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d10438c41fb8030b426472a65ef25274b428f96018f940755505e780c3fbfe9"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptInputToolbar.build (cognitive 19): PromptInputToolbar.build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 4 (8 pts), boolean chains 3 (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/presentation/screens/generation/widgets/prompt_input_toolbar.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cbd82de2a9300d5e3c39736f81baaed12cee1232eded46812990b02114f552"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryScrollPrefetchCoordinator._loadNextForDemand (cognitive 19): OnlineGalleryScrollPrefetchCoordinator._loadNextForDemand has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 6, ternaries 1 (3 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/presentation/screens/online_gallery/online_gallery_scroll_prefetch_coordinator.dart"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d659c4d732234622e549cc986c8d07762e139236e656f9a4d3ff7a02497e73ab"}},{"ruleId":"D2","level":"warning","message":{"text":"_AnimatedRefreshButtonState.build (cognitive 19): _AnimatedRefreshButtonState.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (8 pts), boolean chains 7, if/else 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/statistics/widgets/dashboard/animated_refresh_button.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de7be60c2b6d6770292a271da58af506ec863e00089a504e7b906e2f621b31d"}},{"ruleId":"D2","level":"warning","message":{"text":"_VibeLibraryContentViewState._updateEntryParams (cognitive 19): _VibeLibraryContentViewState._updateEntryParams has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/vibe_library/widgets/vibe_library_content_view.dart"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1cfd70ffd8b13651975385f6066eb971c60a0e9677cbe3f86944c14a4eb104"}},{"ruleId":"D2","level":"warning","message":{"text":"CardResourceDragFactory.create (cognitive 19): CardResourceDragFactory.create has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, ternaries 1 (2 pts), match/switch 1 (nesting depth added 7). 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/presentation/utils/card_resource_drag_factory.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fbbfba51caff09558bd74f5e25a2fb4b3d7640865e6efb3ef01664a0cce298"}},{"ruleId":"D2","level":"warning","message":{"text":"_SaveVibeDialogState._save (cognitive 19): _SaveVibeDialogState._save has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, error handling 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/presentation/widgets/common/save_vibe_dialog.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcbdd56f754b7fe8ed3962d0f4df5c4933eadca4856c44b9770d29876ec551b"}},{"ruleId":"D2","level":"warning","message":{"text":"_WeightAdjustToolbar.build (cognitive 19): _WeightAdjustToolbar.build has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 3 (4 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/presentation/widgets/common/weight_adjust_toolbar.dart"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3828000afa5c548752c1485fb3189dc783421b10af66d63f4603b8f4f17636"}},{"ruleId":"D2","level":"warning","message":{"text":"_DanbooruPostCardState._buildNoImageContent (cognitive 19): _DanbooruPostCardState._buildNoImageContent has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (13 pts), if/else 4, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/danbooru_post_card.dart"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"031aa03fab4fd35b9dac66fc94c8aa5502952cfd0b76c1cf8c45e12c67ac2b71"}},{"ruleId":"D2","level":"warning","message":{"text":"_LocalImageHoverPreviewCardState._buildPreview (cognitive 19): _LocalImageHoverPreviewCardState._buildPreview has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 5, boolean chains 3 (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/presentation/widgets/gallery/local_image_hover_preview.dart"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e690619e117bbc7e3fbdb3e0a92abfc36acac97f444c7d72e774b4fb753891"}},{"ruleId":"D2","level":"warning","message":{"text":"ColorPickerTool._updatePreviewDebounced (cognitive 19): ColorPickerTool._updatePreviewDebounced has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (9 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/presentation/widgets/image_editor/tools/color_picker_tool.dart"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9018c8553361a4c25a34c942cd0ff71ffa563555f79d99c432c016f32ce4cd"}},{"ruleId":"D2","level":"warning","message":{"text":"TagEditorSession.select (cognitive 19): TagEditorSession.select has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 2 (6 pts), boolean chains 3, loops 1 (3 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/presentation/widgets/prompt/tag_editor_session.dart"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"511afbdc5790d820d4e73336fa8885440a2c6e92a586570a4cf64c58504524c8"}},{"ruleId":"D2","level":"warning","message":{"text":"TagEditorSession.moveSelectedBefore (cognitive 19): TagEditorSession.moveSelectedBefore has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (6 pts), loops 4 (5 pts), boolean chains 4, ternaries 4 (nesting depth added 2). 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/presentation/widgets/prompt/tag_editor_session.dart"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"437498fd28ffeb04f37ca09a43b1245001612a344d66e87bebee99fee21c4e15"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionJsonlLineStorage._truncateIncompleteTailSync (cognitive 18): SessionJsonlLineStorage._truncateIncompleteTailSync has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/harness/session/jsonl/session_jsonl_line_storage.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c496b9d85fa340f6148de206989b18a46d7acc706cf4b59172b3c188e85e491f"}},{"ruleId":"D2","level":"warning","message":{"text":"CooccurrenceSqliteRepository.validateAndOpen (cognitive 18): CooccurrenceSqliteRepository.validateAndOpen has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (4 pts), boolean chains 3, error handling 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/core/autocomplete/cooccurrence_sqlite_repository.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e550f2a7eb2ab4b2d1739a3cbd8e71822817811958dabf29b59f3a42ca3e846"}},{"ruleId":"D2","level":"warning","message":{"text":"ZhDictionaryDownloader.fetchLatestSource (cognitive 18): ZhDictionaryDownloader.fetchLatestSource has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, error handling 3 (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/core/autocomplete/zh_dictionary_download.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a02402c6f1d6a0842354485177e172410c954bc7c8801c14368fb15277494a"}},{"ruleId":"D2","level":"warning","message":{"text":"OneDriveApiClient.listChildren (cognitive 18): OneDriveApiClient.listChildren has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 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/core/cloud_sync/backend/onedrive_api_client.dart"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b47cff3416f0b26d5b933eab7503f4db744fd133daab4323bc53df905e88a2a"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotObjectPacker.pack (cognitive 18): SnapshotObjectPacker.pack has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/snapshot_object_packer.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd791bf5ff3577db9257c40ed5fdca89f2edafe225e038b6fd2f5ec251bb6063"}},{"ruleId":"D2","level":"warning","message":{"text":"EnhancedBaseDataSource.execute (cognitive 18): EnhancedBaseDataSource.execute has cognitive complexity 18 (threshold 15). Drivers by points: error handling 4 (8 pts), if/else 2 (4 pts), ternaries 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/base_data_source.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f22c2ec0d7e02e745ab3812b6a696ee9d34cfa0304ad780be318ac171405778"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionPool._startEvictionTimer (cognitive 18): ConnectionPool._startEvictionTimer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 1 (4 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/connection_pool.dart"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a843337df8403f3fcdffe4f982bd6207ad2048f66955d2e03d3cf2012f8eae"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteGalleryQuery.searchByDelimitedTextSegments (cognitive 18): SqliteGalleryQuery.searchByDelimitedTextSegments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 3 (8 pts), boolean chains 1, error handling 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/core/database/datasources/gallery_query.dart"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"8110d4fdec3ae417d593c14d67d500dd55e072e2c63bdee8e36bd944a49ba34f"}},{"ruleId":"D2","level":"warning","message":{"text":"GalleryExceptionConverter.convert (cognitive 18): GalleryExceptionConverter.convert has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (7 pts), boolean chains 6, if/else 5 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/exceptions/gallery_exceptions.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"e266d20c45a275427444090a741ea39776248fe945d5d41d0b71a27ecc72d8d6"}},{"ruleId":"D2","level":"warning","message":{"text":"GalleryTagQueryParser.parse (cognitive 18): GalleryTagQueryParser.parse has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 3 (6 pts), boolean chains 3, loops 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/core/online_gallery/gallery_tag_query.dart"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed84ad1e235eb2e90ee77496fbf7804454d6f8f0485f205dad7aefbf2a5a2860"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopAppShutdownService._performShutdown (cognitive 18): DesktopAppShutdownService._performShutdown has cognitive complexity 18 (threshold 15). Drivers by points: error handling 7 (11 pts), boolean chains 4, if/else 2, 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/core/services/desktop_app_shutdown_service.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacbff732ed53e7ce2ff0426299058c04ade19d473dbc8c5b75decc5cd9c3cdd"}},{"ruleId":"D2","level":"warning","message":{"text":"QwenPromptTokenEncoder._mergeCount (cognitive 18): QwenPromptTokenEncoder._mergeCount has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), boolean chains 4 (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/core/services/tokenizers/qwen_prompt_token_encoder.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa1d56ddae948fdbbb43a1eee9a440f6b4dc2623a652464074c50121de43215"}},{"ruleId":"D2","level":"warning","message":{"text":"VerifiedResumableDownloader._download (cognitive 18): VerifiedResumableDownloader._download has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 5, ternaries 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/services/verified_resumable_downloader.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bc0abe77a164e2900c9e8aeb3a2e1ec91b9a7e19b86bbb96246f5553c3af35"}},{"ruleId":"D2","level":"warning","message":{"text":"InpaintMaskUtils.fillEditorMaskRegionAtPoint (cognitive 18): InpaintMaskUtils.fillEditorMaskRegionAtPoint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, loops 2, error handling 1 (nesting depth added 2). 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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eeadad02b7815f6eca3faf58b123993d4b0cbf12102ba509b95d44825bb4cfb"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptRegexReplacer.expandReplacement (cognitive 18): PromptRegexReplacer.expandReplacement has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/prompt_regex_replacer.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b4b8e4da4547800a9a423aa48d05cf9d676c41011431202520443b0a3929d2"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeExportUtils._buildBundleVibesFromEntry (cognitive 18): VibeExportUtils._buildBundleVibesFromEntry has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (10 pts), boolean chains 6, if/else 1, 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/core/utils/vibe_export_utils.dart"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32d8cfaed1e8bd943d15516b096cf9e76816302cb09ceffef27f6311af0e35f"}},{"ruleId":"D2","level":"warning","message":{"text":"CloudSyncOperationStorage.readSnapshot (cognitive 18): CloudSyncOperationStorage.readSnapshot has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 5 (6 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 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/data/cloud_sync/cloud_sync_operation_storage.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c397f1c82d344c16f7353e4f399bd6dae68e9fec5cd41f65ba6f6ca941e58b"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeLibraryCloudSyncAdapter.validateRecord (cognitive 18): VibeLibraryCloudSyncAdapter.validateRecord has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 11, if/else 5 (6 pts), ternaries 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/cloud_sync/vibe_library_cloud_sync_adapter.dart"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"398d09a01d84cf42f44ac01d289ddc8485587d4cdda5f18b26b283860a21d6ae"}},{"ruleId":"D2","level":"warning","message":{"text":"DanbooruTagGroupService.getTagGroup (cognitive 18): DanbooruTagGroupService.getTagGroup has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, error handling 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/data/datasources/remote/danbooru_tag_group_service.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac522c2b386596bf40a4fbf3d9eb0d2f24b039c8f15eed020a554dac1137295"}},{"ruleId":"D2","level":"warning","message":{"text":"DanbooruTagGroupService.syncTagGroupMappings (cognitive 18): DanbooruTagGroupService.syncTagGroupMappings has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (4 pts), ternaries 2 (4 pts), boolean chains 1, error handling 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/data/datasources/remote/danbooru_tag_group_service.dart"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2147f90969d7054ffe037b945b96bc83b664e1fbe66111dd0c5e9a7f763877"}},{"ruleId":"D2","level":"warning","message":{"text":"NaiGenerationTransport.buildGenerationMultipart (cognitive 18): NaiGenerationTransport.buildGenerationMultipart has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/datasources/remote/nai_generation_transport.dart"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f7325a73d8e619cea7723645aa7403386745d97f39822a0cdcc3b47e1fde5c"}},{"ruleId":"D2","level":"warning","message":{"text":"NAIImageEnhancementApiService._mapDioError (cognitive 18): NAIImageEnhancementApiService._mapDioError has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 1 (3 pts), boolean chains 2, ternaries 1 (2 pts), match/switch 1 (nesting depth added 7). 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/data/datasources/remote/nai_image_enhancement_api_service.dart"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc3ef09e65a239626bd029442397ab0e799c82ef108ff5249bd656567632ba7"}},{"ruleId":"D2","level":"warning","message":{"text":"NaiPromptExportCodec.tryDecode (cognitive 18): NaiPromptExportCodec.tryDecode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 4 (6 pts), loops 3, error handling 1 (2 pts), boolean chains 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/data/models/gallery/nai_prompt_export_codec.dart"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b39df56d72fc5f1a8fb664c0d1b020946cd5634b2e002924ad21aecd893f042"}},{"ruleId":"D2","level":"warning","message":{"text":"AiTagGenerationInfo.hasAnyParam (cognitive 18): AiTagGenerationInfo.hasAnyParam has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 18. 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/data/models/online_gallery/ai_tag_generation_info.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"87aad1c5beb15963af76beca0e8ddbcfb5b9812d9de59f18dc3952d4a8899e75"}},{"ruleId":"D2","level":"warning","message":{"text":"BulkImageStateService._resolveImageIds (cognitive 18): BulkImageStateService._resolveImageIds has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 3 (6 pts), error handling 2 (4 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/data/services/bulk_image_state_service.dart"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9c0b32fd1f73df636b1ab0b29d3039159faee4e20e2675f719d929669f4411"}},{"ruleId":"D2","level":"warning","message":{"text":"FilterCriteria.copyWith (cognitive 18): FilterCriteria.copyWith has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 18. 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/data/services/gallery/gallery_filter_service.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca96ddab130a2cb18fbc0b28d5fa387c6114a6c8c798418ab1bcc36bdd7a247f"}},{"ruleId":"D2","level":"warning","message":{"text":"ExifMetadataExtractor._fromTiff (cognitive 18): ExifMetadataExtractor._fromTiff has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, ternaries 2 (4 pts), error handling 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/data/services/metadata/exif_metadata_extractor.dart"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d59e56df7aaa2febac85f7deb868f5bf0e9f5ac20a48286b7a33da4e752d20"}},{"ruleId":"D2","level":"warning","message":{"text":"ExifUserCommentDecoder._decodeUtf16 (cognitive 18): ExifUserCommentDecoder._decodeUtf16 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 1, 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/data/services/metadata/exif_user_comment_decoder.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"004af9592072fa895f86e265e12f44717fbe1f63129b73971eb056f82929e66c"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageMetadataContainerCodec.copySupportedMetadata (cognitive 18): ImageMetadataContainerCodec.copySupportedMetadata has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 2 (4 pts), ternaries 1 (4 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/data/services/metadata/image_metadata_container_codec.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc8c75271e77adf8f5e818c9a1dfac874962c16c72b63b8457b98dfdc978971"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageMetadataContainerCodec.embedTextChunks (cognitive 18): ImageMetadataContainerCodec.embedTextChunks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, loops 2 (3 pts), ternaries 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/data/services/metadata/image_metadata_container_codec.dart"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80aa02136944dd77798ab240083768aa4dbd71dcdd534cce43c998c5e3b0751"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataTextDecoder.tryCombineParsers (cognitive 18): MetadataTextDecoder.tryCombineParsers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, error handling 1 (3 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/data/services/metadata/metadata_text_decoder.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f7ae041cbdc726eaf2047c049d1932a2c549b0b2e4484139f3848fb8523047"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogRandomGeneratorStrategy._generateNoHumanPrompt (cognitive 18): CatalogRandomGeneratorStrategy._generateNoHumanPrompt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/strategies/catalog_random_generator_strategy.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcff84a05c936a3494e79af79e12d66e6e5e4966af145a32c2abb0fa65440ff9"}},{"ruleId":"D2","level":"warning","message":{"text":"TempImageService.cleanupOldTempFiles (cognitive 18): TempImageService.cleanupOldTempFiles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), error handling 2 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/temp_image_service.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee05b121035f4c4d54d5a3ca10f1fa888e0a054843a1cc156a7c7a9b5ee1396"}},{"ruleId":"D2","level":"warning","message":{"text":"AdaptivePresenter.showForm (cognitive 18): AdaptivePresenter.showForm has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 8, ternaries 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/presentation/adaptive/adaptive_presenter.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"747ce0c97516ec8c1f28be54d07252390c79dc6341112ae9f4b4a17f4daac44f"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerationImageFavoriteToolbox.setFavorite (cognitive 18): GenerationImageFavoriteToolbox.setFavorite has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), error handling 3 (4 pts), boolean chains 3 (nesting depth added 2). 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/presentation/agent_chat/services/generation_image_favorite_toolbox.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31fcc4d2fb503f213347a821222419658d9c10866281cb05e1bc2fc376547fe"}},{"ruleId":"D2","level":"warning","message":{"text":"GalleryAlbumNotifier.exportSidecar (cognitive 18): GalleryAlbumNotifier.exportSidecar has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 2 (6 pts), ternaries 1 (3 pts), boolean chains 1, error handling 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/presentation/providers/gallery_album_provider.dart"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"74132170cb1e820d4055fa0a0d0d90b1d4a6866c2e9d9aae2826d4c379038835"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageGenerationCoordinator._runFallbackWithRetry (cognitive 18): ImageGenerationCoordinator._runFallbackWithRetry has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 4, error handling 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/presentation/providers/generation/image_generation_coordinator.dart"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc4e046d9f68c2afcb9b6093f1dbe32967f0f9a635966e434271bb062d85ca7"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryOutputFilterSettings._isFullyWrapped (cognitive 18): OnlineGalleryOutputFilterSettings._isFullyWrapped has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 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/presentation/providers/online_gallery_output_filter_provider.dart"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f131a2e74b96b2d59082ce3e3ab94f4b0ac4c47c3d5132819bbd4f20ac45f12c"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeImportHandler.importDroppedResources (cognitive 18): VibeImportHandler.importDroppedResources has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 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/presentation/screens/generation/handlers/vibe_import_handler.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc5c3c5cbfc28d99ea8c72fe3a05dca88a4ece1d0be3f640019598e1ac5aa34"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerationImageDeletion.confirmAndDelete (cognitive 18): GenerationImageDeletion.confirmAndDelete has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2, ternaries 1 (2 pts), boolean chains 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/presentation/screens/generation/services/generation_image_deletion.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3c25145ea8631176b36a392ff38d18816dced7009dc8f9cea75eb3013ef7f3"}},{"ruleId":"D2","level":"warning","message":{"text":"_GenerationToggleButtonState.build (cognitive 18): _GenerationToggleButtonState.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 10 (14 pts), if/else 3, boolean chains 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/presentation/screens/generation/widgets/generation_toggle_button.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb05d277099f5c6dcc8176568bf2572ce7334607bedebdfbf40b240c2371f7d"}},{"ruleId":"D2","level":"warning","message":{"text":"_PreciseReferencePanelState._applyDroppedReferences (cognitive 18): _PreciseReferencePanelState._applyDroppedReferences has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, ternaries 1 (2 pts), error handling 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/presentation/screens/generation/widgets/precise_reference_panel.dart"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f1cf618ab3f0b37784a3d46e6ebea24863a24ea5ea736280b6df3c263943a9"}},{"ruleId":"D2","level":"warning","message":{"text":"_VibeCardState._buildEncodingStatusChip (cognitive 18): _VibeCardState._buildEncodingStatusChip has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (10 pts), boolean chains 4, if/else 4 (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/presentation/screens/generation/widgets/vibe_card.dart"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8d5b16a25390f7d3869a32feed10b0b97a5eb2848d8a69127438b2de84c5a8"}},{"ruleId":"D2","level":"warning","message":{"text":"_WebAccessSettingsState.build (cognitive 18): _WebAccessSettingsState.build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, ternaries 7, loops 2, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/settings/sections/web_access_settings.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"873751d4e37d706879950d77bb701d8d86f74578cdfb4c646e2644242f11b061"}},{"ruleId":"D2","level":"warning","message":{"text":"_PolarChartPainter.paint (cognitive 18): _PolarChartPainter.paint has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (8 pts), loops 5 (6 pts), if/else 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/statistics/widgets/charts/polar_activity_chart.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8ae9527529d6de21228af2367d7f82bcc12d94974c2f572be3799d6e2da2d6"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeDetailParamPanel._buildActionBar (cognitive 18): VibeDetailParamPanel._buildActionBar has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 9 (11 pts), boolean chains 4, match/switch 1 (2 pts), if/else 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/vibe_library/widgets/vibe_detail/vibe_detail_param_panel.dart"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbe7c8d3718e7b047a9661e67e54556c69313988a46f9b23a52c294b3536a82"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeExportAdvancedExecutor.exportEncodingFile (cognitive 18): VibeExportAdvancedExecutor.exportEncodingFile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_advanced_executor.dart"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e938c95b88d8d0526b7be9b637be21a48acaae2a05a9e363f39d9d2223989e8"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataImportApplier.applyPromptAndGenerationParams (cognitive 18): MetadataImportApplier.applyPromptAndGenerationParams has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (8 pts), ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/utils/metadata_import_applier.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2a81e4a57ab14afdf113f39fb3d9628f8710bf419e8f66236afc2e1c05fa78"}},{"ruleId":"D2","level":"warning","message":{"text":"BulkActionBar.build (cognitive 18): BulkActionBar.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (9 pts), if/else 5 (8 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/presentation/widgets/bulk_action_bar.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"84472b0b143a501725682d3fa99731395b084125ba4144324283d2f9b7c1f256"}},{"ruleId":"D2","level":"warning","message":{"text":"_CardDragSourceState._prepareSession (cognitive 18): _CardDragSourceState._prepareSession has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), loops 4, ternaries 1 (2 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/card_drag_source.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b71919e84eba70c0e924b3d7031b98b8f21507b70899ef74e6cbde7552a461"}},{"ruleId":"D2","level":"warning","message":{"text":"_ImagePickerCardState._buildDefaultContent (cognitive 18): _ImagePickerCardState._buildDefaultContent has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (11 pts), if/else 3 (4 pts), boolean chains 3 (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/presentation/widgets/common/image_picker_card/image_picker_card.dart"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e54d3df7c87d625b9c639a3fec19fe067ddad0749c0fbf936ddfabc7c495e9"}},{"ruleId":"D2","level":"warning","message":{"text":"_DiscordShareDialogState._buildVerificationState (cognitive 18): _DiscordShareDialogState._buildVerificationState has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 9 (14 pts), if/else 4 (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/presentation/widgets/discord_share/discord_share_dialog.dart"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6039e0375d45e1ea393f714116715fbd45f6a9c0c88905142332e134e0b945"}},{"ruleId":"D2","level":"warning","message":{"text":"_GalleryAlbumTreeViewState._buildAlbumContent (cognitive 18): _GalleryAlbumTreeViewState._buildAlbumContent has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (8 pts), boolean chains 7, if/else 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/gallery/gallery_album_tree_view.dart"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0b729f4821855b0bb61ab349b5464deacd590e90c98a352a9b6dedd93245fd"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolManager._restoreToolSettings (cognitive 18): ToolManager._restoreToolSettings has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (18 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/presentation/widgets/image_editor/core/tool_manager.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9217de35f60c4333f3a70ea3d54520d5c04fe27fde9e4b14fc74d78205a93406"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageEditorEffectsController._apply (cognitive 18): ImageEditorEffectsController._apply has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, match/switch 1 (2 pts), error handling 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/presentation/widgets/image_editor/effects/image_editor_effects_controller.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8215819c0216b830128e080e65711b4eb5146227c9961975c4d6b03ceb86ede3"}},{"ruleId":"D2","level":"warning","message":{"text":"_MetadataImportDialogState._buildReferenceSection (cognitive 18): _MetadataImportDialogState._buildReferenceSection has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 2 (4 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/presentation/widgets/metadata/metadata_import_dialog.dart"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccb70598707105293b5a3a34132f82fd5690baa27f56dfdd8895ea4a4f147c3"}},{"ruleId":"D2","level":"warning","message":{"text":"BranchConditionsEditor._buildConditionRow (cognitive 18): BranchConditionsEditor._buildConditionRow has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3, boolean chains 2, ternaries 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/diy/panels/branch_conditions_editor.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3668d000dbe477c835068639e27604489773fcebcfbcf029bbc48e98220723"}},{"ruleId":"D2","level":"warning","message":{"text":"FixedTagLinkPainter.paint (cognitive 18): FixedTagLinkPainter.paint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 3, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/fixed_tags_link_layer.dart"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dfe136b1d558767700ad26db3cc442ab42496f14b99a550c6fefaa62448fa5"}},{"ruleId":"D2","level":"warning","message":{"text":"NaiSyntaxController._styleDisabled (cognitive 18): NaiSyntaxController._styleDisabled has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (5 pts), boolean chains 3, ternaries 1 (3 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/presentation/widgets/prompt/nai_syntax_controller.dart"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"885762589ed4b6af54ef08a081ddb9199a1ee063db5d0a091cfd1bb6db80c65a"}},{"ruleId":"D2","level":"warning","message":{"text":"NaiSyntaxController._applyOfficialEmphasis (cognitive 18): NaiSyntaxController._applyOfficialEmphasis has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 4, ternaries 1 (3 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/presentation/widgets/prompt/nai_syntax_controller.dart"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b49d06f86630294d10b5da507f886ab1fc1382f49977bb10f56acd0bcf7fcfe"}},{"ruleId":"D2","level":"warning","message":{"text":"UnifiedPromptConfig.== (cognitive 18): UnifiedPromptConfig.== has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 17, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/unified/unified_prompt_config.dart"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"412a5dd85af18c4588deaf27688ea7603a36190b492d586a7461819dc3ad7494"}},{"ruleId":"D2","level":"warning","message":{"text":"_QueueManagementPageState.build (cognitive 18): _QueueManagementPageState.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (9 pts), if/else 4 (5 pts), boolean chains 4 (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/presentation/widgets/queue/queue_management_page.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b243fc7dcbc21b2c3f0d9a4462714a57abd88525dea1b0b57aaff7a9e94df52f"}},{"ruleId":"D2","level":"warning","message":{"text":"_ShortcutBindingEditorState._processKeyCombination (cognitive 18): _ShortcutBindingEditorState._processKeyCombination has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/shortcuts/shortcut_binding_editor.dart"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd72bc4ab9b382bcdd1bebd664113dc5c811caa71f019773b535ae17e0e966d"}},{"ruleId":"D2","level":"warning","message":{"text":"_StatisticsExportDialogState._generateCsvExport (cognitive 18): _StatisticsExportDialogState._generateCsvExport has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 6 (nesting depth added 6). 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/presentation/widgets/statistics/export_dialog.dart"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"705294a766680fb6212e9e16616b97b03a29f575e343f6383e13bdf0b112b3a3"}},{"ruleId":"D2","level":"warning","message":{"text":"OleDataInspector.Inspect (cognitive 17): OleDataInspector.Inspect has cognitive complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"tool/ole_drag_inspector/windows/Program.cs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1c18eebbb3ebf7ae0242c3d519ced5e4ccbb2617b1f46a9d906d7a0c934f4a"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionJsonlCodec._decodeAssistantContent (cognitive 17): SessionJsonlCodec._decodeAssistantContent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (4 pts), match/switch 1 (4 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/core/agent/harness/session/jsonl/session_jsonl_codec.dart"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fb30891cb1b75d0b98f91b09b3e237e5203bb0ba4f771f658a1c1fca00b446"}},{"ruleId":"D2","level":"warning","message":{"text":"_TranslatableTagSlice.parse (cognitive 17): _TranslatableTagSlice.parse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/autocomplete/tag_translation_lookup.dart"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93691d523400f87210e2953fb832557f85b86737e8938159aac5d02769df83b"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalGalleryThumbnailMigration._isVerifiedLegacyThumbnail (cognitive 17): LocalGalleryThumbnailMigration._isVerifiedLegacyThumbnail has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, error handling 1, loops 1 (nesting depth added 2). 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/core/cache/local_gallery_thumbnail_migration.dart"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1c99d31e50edd64bccbce811ea26b18b996c7ea24df88cc829b5cd25865bd5"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryPrefetchCoordinator.submit (cognitive 17): OnlineGalleryPrefetchCoordinator.submit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cache/online_gallery_prefetch_coordinator.dart"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f09f5d626a22cf1f793281a2c899f5664c1642410fd546cf4c15a43b0a342e3"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotRecordRef.SnapshotRecordRef (cognitive 17): SnapshotRecordRef.SnapshotRecordRef has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5 (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/core/cloud_sync/models.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed146cb3de6fb1a2d99af2f6c296830b321e5004f760d1e8ac58f883ef983fb"}},{"ruleId":"D2","level":"warning","message":{"text":"AssetDatabaseManager._migrateBundledCooccurrence (cognitive 17): AssetDatabaseManager._migrateBundledCooccurrence has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/asset_database_manager.dart"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaec0449ad1848e00daf7a474640d61cccf75184b14b45c448489830ac90a86e"}},{"ruleId":"D2","level":"warning","message":{"text":"ExaSearchClient.searchApi (cognitive 17): ExaSearchClient.searchApi has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (9 pts), error handling 3, if/else 2 (3 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/core/network/web_access/exa_search_client.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b94d02fd1ed6686221336d5af5b16ccfc58b820fc181008d9bfcf24427e2fc"}},{"ruleId":"D2","level":"warning","message":{"text":"AvatarService.cleanupOrphanedAvatars (cognitive 17): AvatarService.cleanupOrphanedAvatars has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), error handling 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/core/services/avatar_service.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"883990812f149656d55821d1f5ab2e22d95c5dbba499493fc3fbf2be586ca92e"}},{"ruleId":"D2","level":"warning","message":{"text":"HardEdgeMaskExporter.exportRaster (cognitive 17): HardEdgeMaskExporter.exportRaster has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 3, ternaries 1 (3 pts), boolean chains 1 (nesting depth added 6). 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/core/utils/hard_edge_mask_exporter.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb667b62e8fbf964f65863bb5fbe1e2a51b5ac85ca61f319aeb488cdb77a2c25"}},{"ruleId":"D2","level":"warning","message":{"text":"OutpaintResolvedGeometry.== (cognitive 17): OutpaintResolvedGeometry.== has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 17. 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/core/utils/inpaint_outpaint_utils.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26c83c2d72e2e49339a01af12dca425e09d8b3cc53af216cf5ac01a7270f637"}},{"ruleId":"D2","level":"warning","message":{"text":"PicaLanczosResizer._createTiles (cognitive 17): PicaLanczosResizer._createTiles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 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/core/utils/pica_lanczos_resizer.dart"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd0d22b54fa2beb02098f3f014e345e6c906653ee8d5fbbb9b86c14bae9a396"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptEditDocument.singleSelected (cognitive 17): PromptEditDocument.singleSelected has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, loops 4 (5 pts), if/else 2 (4 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/core/utils/prompt_edit_document.dart"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eab488588cf0d25ebea17eb6964adab0fbcd7877eb022e6d1406d5e5d22d3ba"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeFileParser._extractThumbnailFromJson (cognitive 17): VibeFileParser._extractThumbnailFromJson has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, error handling 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/core/utils/vibe_file_parser.dart"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"3433a7641a66181a23ffe430dbb0efee62e5ddd8d76c2ad5729bc603eafc3d76"}},{"ruleId":"D2","level":"warning","message":{"text":"AppCloudSyncDataSource.captureLocal (cognitive 17): AppCloudSyncDataSource.captureLocal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/cloud_sync/app_cloud_sync_data_source.dart"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba776bcbc125e3f0887523b18eb0653313f2ea4d3e57c8966e58c3c6196af601"}},{"ruleId":"D2","level":"warning","message":{"text":"AppCloudSyncDataSource._encodePortable (cognitive 17): AppCloudSyncDataSource._encodePortable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (5 pts), boolean chains 1, 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/data/cloud_sync/app_cloud_sync_data_source.dart"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3eb996de5417dfa01e7bbb3b7fce40d1c7fa18d9d3039bd5fd4a42f63b35b95"}},{"ruleId":"D2","level":"warning","message":{"text":"CloudSyncOperationStorage._snapshotOwners (cognitive 17): CloudSyncOperationStorage._snapshotOwners has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 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/data/cloud_sync/cloud_sync_operation_storage.dart"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81529abcbfed5c40832e904d53403c027fdf865269f255f36026ff0aeb71dfe"}},{"ruleId":"D2","level":"warning","message":{"text":"CloudSyncOperationStorage._pruneOrphanedState (cognitive 17): CloudSyncOperationStorage._pruneOrphanedState has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 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/data/cloud_sync/cloud_sync_operation_storage.dart"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a426a5c54832f2f4d2b426d62e4a4f05be6b40c7a8e0882ec95f265ac37bef"}},{"ruleId":"D2","level":"warning","message":{"text":"DanbooruTagGroupService.getTopLevelTagGroups (cognitive 17): DanbooruTagGroupService.getTopLevelTagGroups has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 1 (3 pts), error handling 2, 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/data/datasources/remote/danbooru_tag_group_service.dart"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f75044b0c44306148be341a5e1560e629da34c81a4698d98f91f623d7563da"}},{"ruleId":"D2","level":"warning","message":{"text":"AiTagGenerationInfo.modelBadgeLabel (cognitive 17): AiTagGenerationInfo.modelBadgeLabel has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, ternaries 2 (4 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/data/models/online_gallery/ai_tag_generation_info.dart"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ec1458e6f5cb58833ffe1299913318caf844ad7015b2f485dcab7e32f5735b"}},{"ruleId":"D2","level":"warning","message":{"text":"PostProcessRule.isTriggered (cognitive 17): PostProcessRule.isTriggered has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 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/data/models/prompt/post_process_rule.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e44b0fb60b69d7d1d413ee15f2c924714932f8f4dca12d4f376d612e665668d"}},{"ruleId":"D2","level":"warning","message":{"text":"EfficientVitSamModelManager.ensureModels (cognitive 17): EfficientVitSamModelManager.ensureModels has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 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/data/services/efficient_vit_sam_model_manager.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"706ecaee7d7032e1c70fd6d0b7bd62b84ab057e8fec140cb6e9314865e673441"}},{"ruleId":"D2","level":"warning","message":{"text":"GalleryService._initializeService (cognitive 17): GalleryService._initializeService has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 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/data/services/gallery/unified_gallery_service.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e460ca3be6ec7ad3282498d2c56aaebfd6a8655c5f58a87a24cbd0b2d053d2dc"}},{"ruleId":"D2","level":"warning","message":{"text":"AiTagGenerationParser._parseNaiJson (cognitive 17): AiTagGenerationParser._parseNaiJson has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 4 (5 pts), error handling 1, ternaries 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/metadata/ai_tag_generation_parser.dart"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ea70ebc659b7bbc087df8b62838ee9e5031d07ec976eb02d6472fa80743705"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeFileRepository.overwriteBundleFile (cognitive 17): VibeFileRepository.overwriteBundleFile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 2 (3 pts), ternaries 1 (2 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/data/services/vibe_file_repository.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0d2e1a5dfd502be126f6955e1bff88f3b2a85605f822f971b28221e35df63f"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataFilterCriteria.matches (cognitive 17): MetadataFilterCriteria.matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/domain/entities/gallery_image_entity.dart"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"245a906619a27b96cf3caf035937c716e98653c19ca947bb2e52b4d9f8f27243"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentChatNotifier._init (cognitive 17): AgentChatNotifier._init has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), error handling 1 (2 pts), loops 1 (2 pts), 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/presentation/agent_chat/providers/agent_chat_notifier.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3c8c1f62361fb9f43ada4bd86f26456ec34741a3d03524d5e51c7cbbf886d4"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentChatPanelCoordinator._editQueuedMessage (cognitive 17): AgentChatPanelCoordinator._editQueuedMessage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 1 (3 pts), boolean chains 2, ternaries 1 (2 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/presentation/agent_chat/widgets/agent_chat_panel_coordinator.dart"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"562e0f0cfe7207d9e0e9b4d1203cbb03d868bda005d87e4e84e37e68c052b44d"}},{"ruleId":"D2","level":"warning","message":{"text":"_AgentChatToolResultTileState.build (cognitive 17): _AgentChatToolResultTileState.build has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8, boolean chains 7, if/else 2. 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/presentation/agent_chat/widgets/agent_chat_tool_widgets.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b274b74b97dda887b7ebd2850a2ed33cc387b23b4143a8e352bf91e71cf6ee"}},{"ruleId":"D2","level":"warning","message":{"text":"ComfyUITask._waitForWebSocketResult (cognitive 17): ComfyUITask._waitForWebSocketResult has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 1 (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/presentation/providers/comfyui/comfyui_provider.dart"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeecbf3c78424035aa0f7725d9323172c7974ce8cf50b5d0f58b8df267f53a0d"}},{"ruleId":"D2","level":"warning","message":{"text":"ComfyUISeedvr2Models._fetchFromServer (cognitive 17): ComfyUISeedvr2Models._fetchFromServer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), error handling 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/presentation/providers/comfyui/comfyui_provider.dart"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"c498c8ae2d466ac48e43c4ca673a0431b0f7650f53218fe1ae83bcabbb8fa611"}},{"ruleId":"D2","level":"warning","message":{"text":"RandomPresetNotifier.resetToDefault (cognitive 17): RandomPresetNotifier.resetToDefault has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/random_preset_provider.dart"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bb55a19e1eb0cbeb86babdebf9c1ae9bf89e3b75f9f7a8e3e5e365628ff85f"}},{"ruleId":"D2","level":"warning","message":{"text":"_PreciseReferencePanelState.build (cognitive 17): _PreciseReferencePanelState.build has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 13, if/else 3, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/widgets/precise_reference_panel.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e120c2dad392af1a5e1e53ade574b59fc2a135b346464b9ada4c461f2a9976"}},{"ruleId":"D2","level":"warning","message":{"text":"_MosaicEditorCanvasState._hitRegion (cognitive 17): _MosaicEditorCanvasState._hitRegion has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/mosaic/mosaic_editor_canvas.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c54de4f65ab0b14e82734878b9b5fff10c5d3ebc87bef70e6db795b217cec81"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryDetailLauncher._downloadGalleryMediaBatch (cognitive 17): OnlineGalleryDetailLauncher._downloadGalleryMediaBatch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (6 pts), loops 1 (2 pts), error handling 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/presentation/screens/online_gallery/online_gallery_detail_launcher.dart"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6aeac3585140f16c43e3dee73843d16565645e2e9359630462dd7322cd6adc6"}},{"ruleId":"D2","level":"warning","message":{"text":"_OnlineGalleryScreenState._goToPage (cognitive 17): _OnlineGalleryScreenState._goToPage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/online_gallery/online_gallery_screen.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d5f409c0925cde16b421399f664d1ac40d0e4af96b038861d4d2864b069563"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryToolbarSearch._buildSearchFields (cognitive 17): OnlineGalleryToolbarSearch._buildSearchFields has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (10 pts), if/else 6, match/switch 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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_search.dart"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bc3d313f329a2903434a7a1955f41c6d5e085d81cdd9cec0c8b06c10af4993"}},{"ruleId":"D2","level":"warning","message":{"text":"_PreciseRefLibraryScreenState.build (cognitive 17): _PreciseRefLibraryScreenState.build has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7, if/else 5 (6 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/precise_ref_library/precise_ref_library_screen.dart"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c244349aa4594aaf4eeeaf75924ca6b899f6629386b5ccd6793126c62e89f4"}},{"ruleId":"D2","level":"warning","message":{"text":"_EntryListItemState._buildActions (cognitive 17): _EntryListItemState._buildActions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 4 (7 pts), match/switch 1 (2 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/presentation/screens/tag_library_page/widgets/entry_list_item.dart"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16157e5963636f1e3605ca701466fde1c9f7c73a5e87e69e454de24f1d26c8a"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeExportAdvancedExecutor.exportSelectedInternalVibes (cognitive 17): VibeExportAdvancedExecutor.exportSelectedInternalVibes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, loops 2, ternaries 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_advanced_executor.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66625d6ae5d788e5052a4ade2eda4782549544ef1170c451ee9d3cfa21494d7"}},{"ruleId":"D2","level":"warning","message":{"text":"_WatermarkEditorScreenState._chooseLogo (cognitive 17): _WatermarkEditorScreenState._chooseLogo has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, error handling 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/presentation/screens/watermark/watermark_editor_screen.dart"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"779bd60ce95c6e56c7247c040d72fe802aa3ccf081fa80a2a4177826c17c5fd2"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerationHistoryStorageService._decodeRecord (cognitive 17): GenerationHistoryStorageService._decodeRecord has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, ternaries 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/services/generation_history_storage_service.dart"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d19267656b8c55710b9ff16694331c1eef5e52b6b5cc50700166fe151a86c51"}},{"ruleId":"D2","level":"warning","message":{"text":"_TokenLoginCardState.build (cognitive 17): _TokenLoginCardState.build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 5 (7 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/auth/token_login_card.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a63448ff648d4fd6c6e68e8b8f0f22d3236e20b545e8c09c4345930f745952"}},{"ruleId":"D2","level":"warning","message":{"text":"GalleryDetailInfoPanel._buildItemBadges (cognitive 17): GalleryDetailInfoPanel._buildItemBadges has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 2, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 2). 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/presentation/widgets/online_gallery/gallery_detail_info_panel.dart"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1538fbbe0f552f7f7dea6dd298f02411c38ee3270cebd7a98984f72ad59f4fe"}},{"ruleId":"D2","level":"warning","message":{"text":"FixedTagsDialogView.build (cognitive 17): FixedTagsDialogView.build has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 13, boolean chains 3, if/else 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/fixed_tags_dialog_view.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ec2c507362fbd2c3cf5e14eb33cdd22a52845699cfe2a21beeaefbc0322859"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptDisplayController.value (cognitive 17): PromptDisplayController.value has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 5, ternaries 3 (5 pts), loops 2 (4 pts), if/else 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/prompt_display_controller.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"454fccce5c2ced9c303336910601a3e9a5530e466a184d9bf9a73e667e4f358e"}},{"ruleId":"D2","level":"warning","message":{"text":"TagEditorSession.replaceLabel (cognitive 17): TagEditorSession.replaceLabel has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10, if/else 3, boolean chains 2, loops 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/tag_editor_session.dart"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"32945f86d2f6daa696481c5ffa4a1dddec92989f3e1999e9f9099845f7f40b17"}},{"ruleId":"D2","level":"warning","message":{"text":"_PromptScrollCoordinatorState._scrollAncestors (cognitive 17): _PromptScrollCoordinatorState._scrollAncestors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 3 (5 pts), boolean chains 4 (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/presentation/widgets/prompt/unified/prompt_scroll_coordinator.dart"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"59150115bb6119be421c55912afc902e764da37eb994feae367764d93c8f12be"}},{"ruleId":"D2","level":"warning","message":{"text":"editor.clearCurrentModel (cognitive 17): editor.clearCurrentModel has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 2 (5 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 179). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/model3d_editor/editor.js"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3e2acc1fa6c782c8693c169e35cc56707205693742ac38fd961fd0559bda99"}},{"ruleId":"D2","level":"warning","message":{"text":"OneDriveApiClient._decodeItem (cognitive 16): OneDriveApiClient._decodeItem has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 15, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/backend/onedrive_api_client.dart"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"5839a81c1e8e8eed62708a58fa9cb6c85fdac8421b8bbf47b46b2c257b155280"}},{"ruleId":"D2","level":"warning","message":{"text":"OneDriveCloudSyncBackend._commitMutable (cognitive 16): OneDriveCloudSyncBackend._commitMutable has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 2, error handling 1 (2 pts), loops 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/core/cloud_sync/backend/onedrive_cloud_sync_backend.dart"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e82bacda20e0b9c185a155bb89e8f8ca04a8d315de69aa300830f0b38a96921"}},{"ruleId":"D2","level":"warning","message":{"text":"SyncCoordinator.previewRestore (cognitive 16): SyncCoordinator.previewRestore has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 3, ternaries 1 (3 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/core/cloud_sync/coordinator.dart"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"096d64b86c3b032a32088e157344dca87bb803a6db714cef7976876f963a0778"}},{"ruleId":"D2","level":"warning","message":{"text":"CloudDriveOAuthConfig.diagnose (cognitive 16): CloudDriveOAuthConfig.diagnose has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/oauth/cloud_drive_oauth_config.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c68b0769b3cbcbc68c1d21d0dc828039fae6ec8a963c344ed562d5079840077"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteGalleryFavoriteTagRepository.getTagsByImageIds (cognitive 16): SqliteGalleryFavoriteTagRepository.getTagsByImageIds has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (5 pts), boolean chains 1, error handling 1 (nesting depth added 8). 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/core/database/datasources/gallery_favorite_tag_repository.dart"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d9e9c9bd1618fa7260cc6fcb7ac08d75182abbcc7874b14f523d893383d13b"}},{"ruleId":"D2","level":"warning","message":{"text":"McpStreamableHttpTransport._handlePost (cognitive 16): McpStreamableHttpTransport._handlePost has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 5, error handling 2. 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/core/mcp/mcp_streamable_http_transport.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfa07ac5b96e3ad942352bbf345199f8e173135476cd505dd27419312a8e31f"}},{"ruleId":"D2","level":"warning","message":{"text":"ExaSearchClient._parseRpcEnvelope (cognitive 16): ExaSearchClient._parseRpcEnvelope has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 2 (4 pts), boolean chains 2, 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/core/network/web_access/exa_search_client.dart"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc84395d4ed45324aaab044540d0bbbec177c0833bbb2bd9d36823129398cd0"}},{"ruleId":"D2","level":"warning","message":{"text":"PixelSnapEngine._refineGrid (cognitive 16): PixelSnapEngine._refineGrid has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 4 (7 pts) (nesting depth added 6). 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/core/services/pixel_snap/pixel_snap_engine.dart"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7027839b8398bd6a28efc2e476fa0a5102552f9214cfdc9a190046b6481cc7"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateInstallerService.restorePendingUpdate (cognitive 16): UpdateInstallerService.restorePendingUpdate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, ternaries 1 (2 pts), error handling 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/core/services/update_installer_service.dart"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66b8d4c6f9f5bb4f9b5f55574b25abd9dc8629ca44b268c6d270a391275ed2d"}},{"ruleId":"D2","level":"warning","message":{"text":"EfficientVitSamImageProcessor.parseLowResolutionMask (cognitive 16): EfficientVitSamImageProcessor.parseLowResolutionMask has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 5, loops 3 (4 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/core/utils/efficient_vit_sam_image_processor.dart"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51c3e444e471fd4b82f06a0de2a54fa77e525aee62d812ff3385a762d785719"}},{"ruleId":"D2","level":"warning","message":{"text":"InpaintOutpaintUtils._createResizedMask (cognitive 16): InpaintOutpaintUtils._createResizedMask has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), boolean chains 3, loops 2 (3 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/core/utils/inpaint_outpaint_utils.dart"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd9aad8a8d36a100451cc6279e5f57ffa6030c2f6427b810fdc45801277aa24"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptEditDocument.numericClosings (cognitive 16): PromptEditDocument.numericClosings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, loops 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/core/utils/prompt_edit_document.dart"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"991e750ef78b47429b625ae1f0eba7f68a729b469639550a6a9c3c43e436d5db"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentSystemPromptCloudSyncAdapter.validateRecord (cognitive 16): AgentSystemPromptCloudSyncAdapter.validateRecord has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (5 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/cloud_sync/agent_cloud_sync_adapters.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"757b990867ec2890a74ab5d89ba164fa80d6fee243890b1b40e1da9ae112cacc"}},{"ruleId":"D2","level":"warning","message":{"text":"CloudSyncOperationStorage._reserveRef (cognitive 16): CloudSyncOperationStorage._reserveRef has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (3 pts), error handling 1 (2 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/data/cloud_sync/cloud_sync_operation_storage.dart"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce68dd5ab47adc1980347980d7150f45660bf3268f17d69c560241dfba50a72c"}},{"ruleId":"D2","level":"warning","message":{"text":"DonmaiGallerySourceAdapter.ranking (cognitive 16): DonmaiGallerySourceAdapter.ranking has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 2 (4 pts), error handling 3, loops 1 (2 pts), match/switch 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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"792ea6f54ca14fb93499bf34e463c7497941b240b05a0acff4952dfae81adf99"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptAssistantConfigState.decode (cognitive 16): PromptAssistantConfigState.decode has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (4 pts), ternaries 4, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/models/prompt_assistant/prompt_assistant_models.dart"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74e3cd7d708f74284a6ada3eb1c3c666b6cd2b81178af43f7c5fba0015ca0f5"}},{"ruleId":"D2","level":"warning","message":{"text":"DlssFloatFrame.decode (cognitive 16): DlssFloatFrame.decode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 6, ternaries 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/dlss/dlss_float_frame.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9087530614972adbcdfeefefbd4d11b0644cfe7b35df3be603b10d179b0f1e"}},{"ruleId":"D2","level":"warning","message":{"text":"EfficientVitSamService.selectRgba (cognitive 16): EfficientVitSamService.selectRgba has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (7 pts), ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/efficient_vit_sam_service.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a86ffcae95619664996b4796c2753df8b7af1911ca4215c9acfd947528b926"}},{"ruleId":"D2","level":"warning","message":{"text":"AiTagGenerationParser._buildNaiInfo (cognitive 16): AiTagGenerationParser._buildNaiInfo has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, ternaries 5, boolean chains 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/data/services/metadata/ai_tag_generation_parser.dart"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7e4b850382a470466076908f58c7c6ee9790258ed8c227b83468fb92c6d46b"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataWorkerPool._initializeReplacementWorker (cognitive 16): MetadataWorkerPool._initializeReplacementWorker has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, error handling 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/data/services/metadata/metadata_worker_pool.dart"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbb7b003f15249da1b0ff3b2d6296858dfea033d90375429e667a628bbeb85d"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeFileDocumentCodec.mergeCompatibleBundleMap (cognitive 16): VibeFileDocumentCodec.mergeCompatibleBundleMap has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, 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/data/services/vibe_file_document_codec.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c282b7ad9d709b96734ef2f4710b8fa569c2b18a48926e4726f097e63cf3516"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentImageObservationLedger._identityKeys (cognitive 16): AgentImageObservationLedger._identityKeys has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/agent_image_observation_ledger.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef370990ce721652178f3a0362777cc1b183cfe110b2b56c02e69ec93170099"}},{"ruleId":"D2","level":"warning","message":{"text":"TagLibraryToolbox._createEntryWithThumbnail (cognitive 16): TagLibraryToolbox._createEntryWithThumbnail has cognitive complexity 16 (threshold 15). Drivers by points: error handling 3 (7 pts), if/else 2 (4 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/tag_library_toolbox.dart"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"16da6b038c9135b1adb88385107ed3ad01d7f84cca9c97683498de2c03eb6d3d"}},{"ruleId":"D2","level":"warning","message":{"text":"AssistantModelCatalog.resolveProvider (cognitive 16): AssistantModelCatalog.resolveProvider has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, match/switch 1 (2 pts), ternaries 1 (nesting depth added 2). 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/presentation/prompt_assistant/models/assistant_model_capability.dart"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"a642d5d3a7980b6f260dfe10eaf1209b198f01cce1a01d57fababb0db40786d1"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptAssistantConfigNotifier.addProviderModels (cognitive 16): PromptAssistantConfigNotifier.addProviderModels has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 5 (6 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/providers/prompt_assistant_config_provider.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3a40fde56c879a4de68aea832411aa038f3b38b3258ab67d9a194715e7da94"}},{"ruleId":"D2","level":"warning","message":{"text":"CloudSyncApplicationService._detectRemote (cognitive 16): CloudSyncApplicationService._detectRemote has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 3 (4 pts), boolean chains 3, error handling 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/presentation/providers/cloud_sync/cloud_sync_application_service.dart"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0efe226f2f6b49eeb2329ca6a9e81aa7f2a437e4fd1f470bf25b4371af6e35"}},{"ruleId":"D2","level":"warning","message":{"text":"ComfyUITask.execute (cognitive 16): ComfyUITask.execute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 2, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/comfyui/comfyui_provider.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed414b0c66d28386f40ece488a5889dac0d1fc290a9466fca3dc3e54a2d9813"}},{"ruleId":"D2","level":"warning","message":{"text":"DlssController._enhance (cognitive 16): DlssController._enhance has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/dlss_provider.dart"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bdaa25ae55a6c628bc1d6c581142a7e089ce6194bc7c6292f654c204d6dc81"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchGenerationNotifier._generateSingle (cognitive 16): BatchGenerationNotifier._generateSingle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 1 (2 pts), boolean chains 1, error handling 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/presentation/providers/generation/batch_generation_notifier.dart"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"484e20795bdf2533b408347774e3822057dfec8849fc4abfed667f5c5fa2829d"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueExecutionNotifier._generateReadyTask (cognitive 16): QueueExecutionNotifier._generateReadyTask has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (6 pts), error handling 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/presentation/providers/queue_execution_provider.dart"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"37681d972b7c4c62c1cbea10260dbcaaefb9f1ddbc9b36f4c98d292ba8b3bc4d"}},{"ruleId":"D2","level":"warning","message":{"text":"DerivativeEditorLauncher.openForLocalPath (cognitive 16): DerivativeEditorLauncher.openForLocalPath has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/derivatives/derivative_editor_launcher.dart"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ddcf16dbd3e114afb3551c5327420930c2c372f70988607a9700e29c54b5bc"}},{"ruleId":"D2","level":"warning","message":{"text":"_DlssEnhancementPanelState._controls (cognitive 16): _DlssEnhancementPanelState._controls has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (9 pts), if/else 4, boolean chains 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/dlss/dlss_enhancement_panel.dart"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cc6cbb5c9e1959812ba2b7209c2a887d3260a6115e6e10c9a48d87de4610b2"}},{"ruleId":"D2","level":"warning","message":{"text":"_EnhancePanelState.build (cognitive 16): _EnhancePanelState.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 2 (4 pts), boolean chains 3 (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/presentation/screens/generation/widgets/img2img_adjustment_section.dart"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"746deff23fe00ad7801eceb3358e2e64427bf7bbaf545c29d830e0407d737f17"}},{"ruleId":"D2","level":"warning","message":{"text":"_TooltipFinalPromptSectionState.build (cognitive 16): _TooltipFinalPromptSectionState.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (9 pts), if/else 4, boolean chains 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/widgets/prompt_tooltip_components.dart"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d3a917b29f6500ae34754bcbe9c074bc7b9e15908fd319aa83a0290a49c483"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlineGalleryRatingDropdown.build (cognitive 16): OnlineGalleryRatingDropdown.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 10, if/else 4, boolean chains 2. 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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar.dart"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"49062654e5b58153d6c62df21bee276db477e54b900cb6690000ecdeb4d05457"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataImportCoordinator._applyFixedTags (cognitive 16): MetadataImportCoordinator._applyFixedTags has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, ternaries 2 (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/presentation/utils/metadata_import_coordinator.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7326832735b6cb92d14fc7dfa5f13524ab136dd117a0b101a04ac7ea26e5d4"}},{"ruleId":"D2","level":"warning","message":{"text":"_AutocompleteWrapperState._onPointerUp (cognitive 16): _AutocompleteWrapperState._onPointerUp has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 5 (7 pts) (nesting depth added 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/presentation/widgets/autocomplete/autocomplete_wrapper.dart"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adf42255d26103c391256888ed4f59e190fe174718d87a3f2ba2bc3520b267d"}},{"ruleId":"D2","level":"warning","message":{"text":"_SaveVibeDialogState.build (cognitive 16): _SaveVibeDialogState.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7 (10 pts), if/else 5, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/save_vibe_dialog.dart"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"586bd17c5395b8239c78611a18ab868e3615f809d4397ff73e29a3d2775b1250"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateNoticeBanner.build (cognitive 16): UpdateNoticeBanner.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 11, boolean chains 3, if/else 2. 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/presentation/widgets/common/update_notice_banner.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a2b7eb40c5b0847bce2fb1e405914ee852b80df0ed5824606570d65f60d8d8"}},{"ruleId":"D2","level":"warning","message":{"text":"_DanbooruPostCardState._handleDownload (cognitive 16): _DanbooruPostCardState._handleDownload has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (4 pts), error handling 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/presentation/widgets/danbooru_post_card.dart"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"af150965adf00b44371dfcfc4adfeb7b71f711389c5a51fe12dbbc0d2f392b3e"}},{"ruleId":"D2","level":"warning","message":{"text":"_DiscordShareDialogState._initialize (cognitive 16): _DiscordShareDialogState._initialize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 2, ternaries 1 (2 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/presentation/widgets/discord_share/discord_share_dialog.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"70026de2400383f305456f652c3268391fce106bd261500979e7e850a113f553"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalDropActionCoordinator._handleVibeTransfer (cognitive 16): GlobalDropActionCoordinator._handleVibeTransfer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 1 (3 pts), loops 1 (2 pts), boolean chains 1, error handling 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/presentation/widgets/drop/global_drop_action_coordinator.dart"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3da4266c2a497823af83800b227d05000a1d9f9ea56c38307976c58a6e816dc"}},{"ruleId":"D2","level":"warning","message":{"text":"_PromptSelectionCardState.build (cognitive 16): _PromptSelectionCardState.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 3 (6 pts), boolean chains 3 (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/presentation/widgets/drop/image_destination_dialog.dart"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb3a3674dc0ca8b6797ec5bad15b9c24a254772d49c78aa03497ff948ccf9a1"}},{"ruleId":"D2","level":"warning","message":{"text":"_LocalGalleryToolbarState._pickDateAndJump (cognitive 16): _LocalGalleryToolbarState._pickDateAndJump has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/gallery/local_gallery_toolbar.dart"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f7a5b5b7329ff029f8681042ee91fe0b16642bbaa435ab56e8e913f06270df"}},{"ruleId":"D2","level":"warning","message":{"text":"_GelbooruCredentialsDialogState.build (cognitive 16): _GelbooruCredentialsDialogState.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7 (8 pts), if/else 6, boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/gelbooru_credentials_dialog.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc0476548dfe8f022bc378c7f49a2f252ac97433cd2a392a92dde6608dc806a"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceDesktopMenuBar.build (cognitive 16): WorkspaceDesktopMenuBar.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 3 (4 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/presentation/widgets/image_editor/workspace/workspace_desktop_layout.dart"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc4f9eb02faf03e10970c331321fb5e649eeb1bfe2de30259613f688aa48ec9"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptWeightEditing.protectNegativeBlockSyntax (cognitive 16): PromptWeightEditing.protectNegativeBlockSyntax has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, 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/presentation/widgets/prompt/prompt_weight_editing.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16a64589000e2b94cd0467b60d470bd15b2fac6d8a99a5cf00230ebeda1c307"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptWeightEditing.parseWeightSyntax (cognitive 16): PromptWeightEditing.parseWeightSyntax has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/prompt_weight_editing.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9e4b4d92b1b35ab9fdf6811afc801112c4249b587965f5b633bc203db1abc1"}},{"ruleId":"D2","level":"warning","message":{"text":"_TagEditorViewState.build (cognitive 16): _TagEditorViewState.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, ternaries 4 (5 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/tag_editor_view.dart"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"67cf83a7f542683db00bd3aeb04f54bbbdf92428eb863c4d2df6b99103998603"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LocalStorageService: TooManyMethods \u2014 179 methods. The bar is 30 methods; this is 149 over it, 5.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/core/storage/local_storage_service.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"813dbe467e0676d3ba0acb7561543d6eb754759513a8f554b624853bc4682124"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GenerationToolDefinitions.tools: MethodTooLong \u2014 tools runs 392 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 292 over it, 3.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/generation_tool_definitions.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b499fadd9a37f12d1c42ae0e0bee2a00f5f55c0ebcd7045cf93d480f9eba371"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: nai_inpaint_parity_browser.main: FunctionTooLong \u2014 main runs 378 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 278 over it, 3.78\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":"tool/diagnostics/nai_inpaint_parity_browser.cjs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f86a6c71bd77b3040f023776c3c5847b7b306e5799fde0e5512a3e0f5fe6be"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OnlineGalleryPaginationService.load: MethodTooLong \u2014 load runs 340 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 240 over it, 3.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/presentation/providers/online_gallery_pagination_service.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfb8c8cb4841e8806cd05287ead22e412dddda8921388cfd7cff2ba8e412d9c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OnlineGalleryFavoritesLoaderService.load: MethodTooLong \u2014 load runs 325 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 225 over it, 3.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/online_gallery_favorites_loader_service.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1322d8c8209e0c6a0ae638ac14e94f045f60b7eb37bdb4c52f8bfff0241960f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorState: TooManyMethods \u2014 97 methods. The bar is 30 methods; this is 67 over it, 3.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/presentation/widgets/image_editor/core/editor_state.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd0354054ef0fd2c12e8ac448ecd2e7427a42a04add5da5ac346bf86c2596a1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _PrivacySettingsSectionState.build: MethodTooLong \u2014 build runs 318 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 218 over it, 3.18\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/presentation/screens/settings/sections/privacy_settings_section.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"413c0030b7806702d55098408737a0823808ea47d3be89cbde49122445141a38"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WatermarkEditorControls.build: MethodTooLong \u2014 build runs 303 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 203 over it, 3.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/presentation/screens/watermark/watermark_editor_controls.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b63fc1fc9064ffc80c298ff223e40ce1a5aefedb166edd111d91fe774baf01"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GenerationParamsNotifier: TooManyMethods \u2014 90 methods. The bar is 30 methods; this is 60 over it, 3.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/presentation/providers/generation/generation_params_notifier.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0dc930bb48928f56fb82a1dc520b1fc9af53b0c661b13cc10bd2630d3c0913"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InpaintMaskUtils: ClassTooLong \u2014 1187 significant lines (blank, comment-only and punctuation-only lines excluded), 63 methods. The bar is 400 significant lines; this is 787 over it, 2.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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c43ef7417e64a6f076d3bd901821e83e5908ffe711b6665012552215e444842"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _DanbooruPostCardState._buildCard: MethodTooLong \u2014 _buildCard runs 285 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 185 over it, 2.85\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/presentation/widgets/danbooru_post_card.dart"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"da80ac0dd79a04f9ad26a139f7771fb8610ee0d69be748803b67ee10ca4ecb27"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PromptToolbox.tools: MethodTooLong \u2014 tools runs 276 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 176 over it, 2.76\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/presentation/agent_chat/services/prompt_toolbox.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d775fe51f0d79e9078549c21099949576a443c8f5c9037eb0c7680a0993bdf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GenerationPreparationService.prepareForKind: MethodTooLong \u2014 prepareForKind runs 263 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 163 over it, 2.63\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/presentation/agent_chat/services/generation_preparation_service.dart"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabb4cedb57f8a6cb1f4b42942b4cf13df313ecebae2a0816d291b9e6fb3b186"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OnlineGalleryNotifier: TooManyMethods \u2014 77 methods. The bar is 30 methods; this is 47 over it, 2.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/online_gallery_provider.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"55da44a65ff6e312fd20b2c6f956cfe9bbde134a7d72ccf7cbcc5e74297b4b2d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AgentChatNotifier: ClassTooLong \u2014 1023 significant lines (blank, comment-only and punctuation-only lines excluded), 69 methods. The bar is 400 significant lines; this is 623 over it, 2.56\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/presentation/agent_chat/providers/agent_chat_notifier.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34b7a7fa5994a9c7c5027dae214e35124048e54b1068e24501317ec9eb362d2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ImageGenerationNotifier: ClassTooLong \u2014 1016 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 616 over it, 2.54\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/presentation/providers/image_generation_provider.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aeb2088359caaecf5f7a928b10758ea6d5b802cc878fc495848292a4fa7f941"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ImageEditorWorkspaceState: TooManyMethods \u2014 75 methods. The bar is 30 methods; this is 45 over it, 2.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/presentation/widgets/image_editor/image_editor_workspace.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"13159f54f2bd738e37d861a5a304ba8a96a545ca6920f89d1d79a475f968f519"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: prompt_assistant/prompt_assistant_models.dart: FileTooLong \u2014 1214 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 714 over it, 2.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/models/prompt_assistant/prompt_assistant_models.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73a2dad058b6d73f452928a6ba0350d68f4f43c2fcaff4259b76c0fa2bca3ce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentChatMessages._messageTile: MethodTooLong \u2014 _messageTile runs 242 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 142 over it, 2.42\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/presentation/agent_chat/widgets/agent_chat_messages.dart"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d98195018a86360af656366dea0051d0ba800110efbc54aec7ebd762356de5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inpaint_mask/inpaint_mask_operations.dart: FileTooLong \u2014 1199 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: InpaintMaskUtils (16-1748). The bar is 500 significant lines; this is 699 over it, 2.40\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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"345661f93f0345446dbb77b73ea8de851ac75b28d3c77d2b4e4407e4afb0604f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Layer: TooManyMethods \u2014 70 methods. The bar is 30 methods; this is 40 over it, 2.33\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/presentation/widgets/image_editor/layers/layer.dart"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffb96c1619d1397ba300814c48f29d77b7abcc257c0488b5413c2d15e0cdd4c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AgentChatNotifier: 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/presentation/agent_chat/providers/agent_chat_notifier.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36670058fb3afd98330e3452a66c0dc9c128f568a89982871b35a0ea7b2822a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _AgentChatComposerState: ClassTooLong \u2014 917 significant lines (blank, comment-only and punctuation-only lines excluded), 28 methods. The bar is 400 significant lines; this is 517 over it, 2.29\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/presentation/agent_chat/widgets/agent_chat_composer.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bac9fefc0287ab748cb1c9799f9ba226480734a37f8876b1fd8c18a0e24482e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _Img2ImgUpscaleSectionState.build: MethodTooLong \u2014 build runs 225 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 125 over it, 2.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/widgets/img2img_upscale_section.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb74fe0488cbc6f09f3e0652e6783b0edaf13bb42c7a3bf472c03634a58a186"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _PromptLibraryEntryDialogState.build: MethodTooLong \u2014 build runs 222 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 122 over it, 2.22\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/presentation/widgets/drop/prompt_library_entry_dialog.dart"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90221b66ca4ac9920710c945b6a60e886abfabfbe16688510a18f07d794789f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VibeLibraryStorageService: TooManyMethods \u2014 66 methods. The bar is 30 methods; this is 36 over it, 2.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/data/services/vibe_library_storage_service.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c004d383bdee7783ac20ea8bd634f5e58114563abec358197fc995a10e293ee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OnlineGalleryRandomLoaderService.load: MethodTooLong \u2014 load runs 218 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 118 over it, 2.18\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/presentation/providers/online_gallery_random_loader_service.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd60f56523481d888d65c82ea501495c423e39048015af899b0db943e087e51"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/agent_chat_notifier.dart: FileTooLong \u2014 1089 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: AgentChatNotifier (79-1449). The bar is 500 significant lines; this is 589 over it, 2.18\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/presentation/agent_chat/providers/agent_chat_notifier.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"014dec2e906994dfcd75d8a1265d3dc66170fc7300747d47e65d19d8536dfab9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _PreciseRefLibraryScreenState: ClassTooLong \u2014 870 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods. The bar is 400 significant lines; this is 470 over it, 2.18\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/presentation/screens/precise_ref_library/precise_ref_library_screen.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6402eb61f5e3e87e2cc0677087ecde4eabaaa560efa71eef841e9f2e26bfa5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/image_generation_provider.dart: FileTooLong \u2014 1084 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: ImageGenerationNotifier (74-1376). The bar is 500 significant lines; this is 584 over it, 2.17\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/presentation/providers/image_generation_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51141f0cb7f54b33321896d07dcdcea690026f564c6a504043e5b26ef268ddb5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AgentChatPanelController: TooManyMethods \u2014 65 methods. The bar is 30 methods; this is 35 over it, 2.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/presentation/agent_chat/widgets/agent_chat_panel_controller.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e5310afe3989c389e615e1f1f471807d31e1fb238adc30438dc4ec030f3c63"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LayerManager: TooManyMethods \u2014 65 methods. The bar is 30 methods; this is 35 over it, 2.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/presentation/widgets/image_editor/layers/layer_manager.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20521a9d07a2d35ef069d3b3ebe35d62ac9d9c399c84a4a0966d2ed3fbd8d42"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _GenerationSettingsSectionState.build: MethodTooLong \u2014 build runs 212 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 112 over it, 2.12\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/presentation/screens/settings/sections/generation_settings_section.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e135163112e90ed979d517a073dfef4d3f45bb9200a5d903abd8f338ed6a0a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InpaintMaskUtils: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 over it, 2.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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6789b67e8b51b7195b0a75aa4ef38cacefef81602c33166712487dfcf24a9819"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: windows/Program.cs: FileTooLong \u2014 1028 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 528 over it, 2.06\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":"tool/ole_drag_inspector/windows/Program.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0caef33978fde6a0988e9180a35df304c6971c2e3fb37742fe8e718a1f964e03"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _DetailTopBarActions._buildActions: MethodTooLong \u2014 _buildActions runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\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/presentation/widgets/common/image_detail/components/detail_top_bar.dart"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"9440cd305ae080798b11db021bb6702cd68a30bdb9a172d4aa33f44d5bd8ed23"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GalleryDetailInfoPanel.build: MethodTooLong \u2014 build runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\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/presentation/widgets/online_gallery/gallery_detail_info_panel.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d25e5b0744e3af3520a8fa201cd7b2021c2ee47db1cc3096a225e10757d3b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/danbooru_post_card.dart: FileTooLong \u2014 1018 significant lines (blank, comment-only and punctuation-only lines excluded), about 63% of them inside a single declaration: _DanbooruPostCardState (128-954). The bar is 500 significant lines; this is 518 over it, 2.04\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/presentation/widgets/danbooru_post_card.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f601087d1d685941408d1812bf77f53964bd5521e33a8a6ddd51bb7403856da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/agent_chat_composer.dart: FileTooLong \u2014 1005 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: _AgentChatComposerState (43-1238). The bar is 500 significant lines; this is 505 over it, 2.01\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/presentation/agent_chat/widgets/agent_chat_composer.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3deda6c840faff86ce87f4aff65934a3c91ea6ddaaa7cc0096c539a245cbc1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ResumableSnapshotUploader.resume: MethodTooLong \u2014 resume runs 201 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\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/core/cloud_sync/snapshot_uploader.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"548d65976c1f54f79358b0d0649b764b18ba4f7bd811d37f9e99252011c8f051"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MetadataImportDialogState._buildPromptSection: MethodTooLong \u2014 _buildPromptSection runs 194 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\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/presentation/widgets/metadata/metadata_import_dialog.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22e876a7fe5cc0ffd68db730259a4403ea5810f9a1ebbe84423f15203a14869"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: drop/image_destination_dialog.dart: FileTooLong \u2014 961 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 461 over it, 1.92\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/presentation/widgets/drop/image_destination_dialog.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27689136fc14151f55339858639eb58108aa3829e45089d9f67da55f961f382"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImageGenerationCoordinator.execute: MethodTooLong \u2014 execute runs 192 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/generation/image_generation_coordinator.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b305dc6d4c6377436bffaf85039040e3e62c476e5296d90a15d13e371caa099"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: precise_ref_library/precise_ref_library_screen.dart: FileTooLong \u2014 948 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: _PreciseRefLibraryScreenState (61-1225). The bar is 500 significant lines; this is 448 over it, 1.90\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/presentation/screens/precise_ref_library/precise_ref_library_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bcc5f157619b704ae525084d9399d8c87322eb08fe5171f04f4664593eb095"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CollapsibleImagePanelState.build: MethodTooLong \u2014 build runs 189 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\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/presentation/widgets/common/collapsible_image_panel.dart"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a951af183dff849013f7e75591111640f5e08e9e08afe745de18450e17f7d05"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RandomPromptGenerator: ClassTooLong \u2014 752 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 352 over it, 1.88\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/data/services/random_prompt_generator.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd7c2c11da2bdc2dca79c545415c4ae1b5023be9edc7f5859cf4c17f2ba89ba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ComfyUISettingsSectionState.build: MethodTooLong \u2014 build runs 186 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\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/presentation/screens/settings/sections/comfyui_settings_section.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca44c7186f33f5044c1ff51bc35e061adaa46d7a7262d8b37c21c157ea06516"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImageCardActionCatalog.build: MethodTooLong \u2014 build runs 186 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\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/presentation/widgets/common/image_card_actions.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"40136b4b82bf881efce4ba6daca9c5a2d39388df24982490cc220af8d3ab3f7c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LocalGalleryNotifier: ClassTooLong \u2014 740 significant lines (blank, comment-only and punctuation-only lines excluded), 49 methods. The bar is 400 significant lines; this is 340 over it, 1.85\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/presentation/providers/local_gallery_provider.dart"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f052fa3ac989edf060971578c3d08fd5b0ba4cb19af3c80983bc0745f0dd5d6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _GitHubLogoPainter.paint: MethodTooLong \u2014 paint runs 185 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 85 over it, 1.85\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/presentation/widgets/navigation/github_logo.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cfe13b6350cf7a1f490110bbe369d937fd646fdfefee26a9fd106b2d285503"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AppCloudSyncDataSource: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\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/data/cloud_sync/app_cloud_sync_data_source.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"955d651f687f449355a5ac2e84ce9feb6a71ec81c38e591104d7095ee241d11b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: queue/task_list_item.dart: FileTooLong \u2014 916 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 416 over it, 1.83\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/presentation/widgets/queue/task_list_item.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3429eda8b64bde8ff5e5dc80f0891c39b0f45c25e1aca70cd277e90ebbf2040e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _QuickTagCloudToolbarState.build: MethodTooLong \u2014 build runs 183 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\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/presentation/widgets/online_gallery/quick_tag_cloud_toolbar.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef22753046659c9747d8f0ce6bb41b76381d4cfa441c8eba396904e816204d59"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImageGenerationNotifier._reduce: MethodTooLong \u2014 _reduce runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\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/presentation/providers/image_generation_provider.dart"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"24144ae100540a0b3044d1caf33f10c6089d54b3dce2ae35dc05fe344cada2af"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ThemeComposer.buildTheme: MethodTooLong \u2014 buildTheme runs 181 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\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/presentation/themes/core/theme_composer.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"142f9da2bd2d51e32b05ca43fc33cf010b2c5c25e2db617fb6aa2f62c6eca560"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SecureStorageService: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\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/core/storage/secure_storage_service.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30c4b4a7f80590764e78746698d6b1e5517215c93ce5e34c70afd2dd88b1bd2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VibeLibraryNotifier: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\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/presentation/providers/vibe_library_provider.dart"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f859c64f5f70ac4fa4ece544ee748a8a027ba0a462823e80022b4b19e0acc0a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _StorageSettingsSectionState.build: MethodTooLong \u2014 build runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\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/presentation/screens/settings/sections/storage_settings_section.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"00aee2902fef86023abb8c88fcfec29e9578c21965902bddb5508fd22dc4d94a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GalleryDataSource: TooManyMethods \u2014 53 methods. The bar is 30 methods; this is 23 over it, 1.77\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/core/database/datasources/gallery_data_source.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3ecf8841a8bd7f308ad8815e28c027e7161d0ea13954a832bd2996891253a9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentChatEventController.handle: MethodTooLong \u2014 handle runs 176 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\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/presentation/agent_chat/services/agent_chat_event_controller.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed253a8e4c8ea5580954b5e00f8cd1e30fe22c0886eb1ed40f952e81795ca50"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImageCardSurface._buildSurface: MethodTooLong \u2014 _buildSurface runs 176 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\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/presentation/widgets/common/image_card_surface.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb297936af028cf5ccbe4cbb69e2224f0b978797c5bbee935a7866ddefdf1a0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AgentChatSessionController: ClassTooLong \u2014 703 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods. The bar is 400 significant lines; this is 303 over it, 1.76\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/presentation/agent_chat/services/agent_chat_session_controller.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efd8224e2f844eda33ef757605d907a94dcaac3a62a9229291a85561cdefe33"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _PreciseReferencePanelState.build: MethodTooLong \u2014 build runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\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/presentation/screens/generation/widgets/precise_reference_panel.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"361f3b26dbead88fd7e4f2280b4ccbf681e6ccc9fde640d7593aec61449cb2e5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _ImagePreviewWidgetState: ClassTooLong \u2014 697 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 297 over it, 1.74\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/presentation/screens/generation/widgets/image_preview.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac562de9ea7d5626d8349e1c3c58cab01796f301fff479e5f8021c0128a2d829"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/inpaint_outpaint_utils.dart: FileTooLong \u2014 870 significant lines (blank, comment-only and punctuation-only lines excluded), about 64% of them inside a single declaration: InpaintOutpaintUtils (396-1148). The bar is 500 significant lines; this is 370 over it, 1.74\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/core/utils/inpaint_outpaint_utils.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"caff7772d3dfc8061cdf0e9d6e990f7521644988a3d32cd2af011878d58308ac"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NaiImageMetadataRawDecoder: ClassTooLong \u2014 694 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 400 significant lines; this is 294 over it, 1.74\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/data/models/gallery/nai_image_metadata_raw_decoder.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f34d8a2f9c308642b4d5a2efaeae472f96e4d10a0a1fde6c566690f6e55506c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PromptToolbox: ClassTooLong \u2014 693 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 293 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/prompt_toolbox.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27bf521e06691a2791ab52f586e07558e872a5ccbd6961a4adfdbe5aeb19f1b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _OnlineGalleryContentPresenter._buildResolvedPostCard: MethodTooLong \u2014 _buildResolvedPostCard runs 172 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\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/presentation/screens/online_gallery/online_gallery_content.dart"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"194f7f8bedb87213e1d2aa85f468ea83b8ed06b2365239edb00cce12171c5661"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LocalGalleryActionCoordinator: ClassTooLong \u2014 686 significant lines (blank, comment-only and punctuation-only lines excluded), 38 methods. The bar is 400 significant lines; this is 286 over it, 1.72\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/presentation/screens/local_gallery/local_gallery_action_coordinator.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1544676aa36e2a18cb8f7740f25934d4ae6c77369a25e16f2b65d4a6c053d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OpenAiResponsesAdapter.completeAgent: MethodTooLong \u2014 completeAgent runs 171 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\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/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b41b2ec4a9dc3e31af5613a11553c867aa651da8e0dfab72dee16a3681b0080"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _MetadataImportDialogState: ClassTooLong \u2014 682 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 282 over it, 1.71\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/presentation/widgets/metadata/metadata_import_dialog.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"93899a99a512d788c19e0f2a48db87fae5eece2414e98e020b27f8ab1411fb69"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OnlineGalleryToolbarAuthControls._buildUserButton: MethodTooLong \u2014 _buildUserButton runs 170 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_auth.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"faad3efa2e0bce7192b2ad6586f9314368005c30f61d8e0c39139f7abd3ed26a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DonmaiGallerySourceAdapter: ClassTooLong \u2014 679 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 279 over it, 1.70\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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"13132d84bea439394594cab87d9faa35c0f9aea0f8a5b09ce738fc3d8afa0453"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _TagEditorViewState: ClassTooLong \u2014 676 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods. The bar is 400 significant lines; this is 276 over it, 1.69\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/presentation/widgets/prompt/tag_editor_view.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70265016258dbf13313b6950d37da21e14e6cbd5430231a6442154fe21bc94b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NaiImageMetadataRawDecoder.decode: MethodTooLong \u2014 decode runs 169 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\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/data/models/gallery/nai_image_metadata_raw_decoder.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fad0475d14da23edc4c853ad1253e7e5c5bb363d6e8a484e283f26ad4c46117"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: online_gallery/ai_tag_gallery_source_adapter.dart: FileTooLong \u2014 842 significant lines (blank, comment-only and punctuation-only lines excluded), about 79% of them inside a single declaration: AiTagGallerySourceAdapter (20-892). The bar is 500 significant lines; this is 342 over it, 1.68\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/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a77f921a3164da54ef103cff7002e1aab44a69e9b919571707e6459496b703d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: auth/login_screen.dart: FileTooLong \u2014 836 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 336 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/auth/login_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"658f84429ac9aa0348b026727f5a05841b80a797f602f7a32487672fab701d58"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GalleryStreamScanner._processSingleFile: MethodTooLong \u2014 _processSingleFile runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\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/data/services/gallery/gallery_stream_scanner.dart"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"726a0b89ba42ac9eadbf47a56f0bbd5186dd5b4902b69936ceb45eb6be152552"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _TagLibraryPageScreenState: ClassTooLong \u2014 667 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods. The bar is 400 significant lines; this is 267 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/presentation/screens/tag_library_page/tag_library_page_screen.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"182d57fb34885ea50dd65e6a1df3aec9f603b71084ae062f31863775f0a32682"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ScanStateManager: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 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/data/services/gallery/scan_state_manager.dart"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb1b7873f4ce5ac3599802cd7df86f955c8472a997bfae1dccaa36b2807d598"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: constants/api_constants.dart: FileTooLong \u2014 829 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 329 over it, 1.66\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/core/constants/api_constants.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9350bcc1a7b906fefefeb98af2c57695fe5641f13b8176df792e96f65a1232ac"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AiTagGallerySourceAdapter: ClassTooLong \u2014 663 significant lines (blank, comment-only and punctuation-only lines excluded), 30 methods. The bar is 400 significant lines; this is 263 over it, 1.66\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/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7274202f861bd97004b2e148fca2399366ce4d363b8133d8a603d620b8d08a5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VibeFileParser: ClassTooLong \u2014 662 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 262 over it, 1.66\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/core/utils/vibe_file_parser.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"314eb0e9b2551d627654ca33d8d944d861753fc5c18bd391862d97e21424cf86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/local_gallery_provider.dart: FileTooLong \u2014 826 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: LocalGalleryNotifier (148-1354). The bar is 500 significant lines; this is 326 over it, 1.65\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/presentation/providers/local_gallery_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"849c213d691bffaff45164622c330fad476d52e64d654085a2483bba1fb26618"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AuthNotifier._restoreStoredSession: MethodTooLong \u2014 _restoreStoredSession runs 165 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\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/data/services/auth_provider.dart"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7f6298fce071a33cd2573f74684ff6ed49de7a63b1cf19439d09bd4cf35a91"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gallery/nai_image_metadata_raw_decoder.dart: FileTooLong \u2014 823 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: NaiImageMetadataRawDecoder (14-1017). The bar is 500 significant lines; this is 323 over it, 1.65\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/data/models/gallery/nai_image_metadata_raw_decoder.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f71374c8448fbff78bd18fc620a5b8ed714ab023f1cb808fc29b529bad21e8f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _OfficialRecipeEngine: ClassTooLong \u2014 658 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 258 over it, 1.65\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/data/services/official_random_prompt_generator.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a4e38bd9df7d11724971c0b8546b4d4ff9481c606b1cff45d5511778ca8ef8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/image_preview.dart: FileTooLong \u2014 821 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: _ImagePreviewWidgetState (144-1093). The bar is 500 significant lines; this is 321 over it, 1.64\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/presentation/screens/generation/widgets/image_preview.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17be79548df3c12e0e3e03fd9481b2e5c7225d09d5c6f46cbc8c205ff16caa9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/random_prompt_generator.dart: FileTooLong \u2014 818 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: RandomPromptGenerator (37-1260). The bar is 500 significant lines; this is 318 over it, 1.64\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/data/services/random_prompt_generator.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"777953d5a62396ed8266c570071dfad262f1a45f60dfba49f79725419347cceb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LocalGalleryNotifier: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\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/presentation/providers/local_gallery_provider.dart"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e99767d829c65ef898ecbbd4f6544109927f6d5344441f776312791d8252bcc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/official_random_prompt_generator.dart: FileTooLong \u2014 816 significant lines (blank, comment-only and punctuation-only lines excluded), about 81% of them inside a single declaration: _OfficialRecipeEngine (103-953). The bar is 500 significant lines; this is 316 over it, 1.63\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/official_random_prompt_generator.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d460d87bbe8fee949f450232f2e94f445749d0cccd0b79f348e3506e7340f9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/fixed_tags_provider.dart: FileTooLong \u2014 816 significant lines (blank, comment-only and punctuation-only lines excluded), about 66% of them inside a single declaration: FixedTagsNotifier (400-1210). The bar is 500 significant lines; this is 316 over it, 1.63\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/fixed_tags_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb966b763c2b828049c93d36c78e64df4ea55546cb4980427772347656385f9e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _VibeSelectorDialogState: ClassTooLong \u2014 650 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 400 significant lines; this is 250 over it, 1.63\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/presentation/screens/vibe_library/widgets/vibe_selector_dialog.dart"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b8500d43e7cbe248f9708d860b3452ffce470bc7ec9909eae4a1a6e7639c82"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tag_library_page/tag_library_page_screen.dart: FileTooLong \u2014 803 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: _TagLibraryPageScreenState (65-1049). The bar is 500 significant lines; this is 303 over it, 1.61\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/presentation/screens/tag_library_page/tag_library_page_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17960574208b115528d62f4167bd563abec29606343be12802dabb292378149"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/outpaint_edge_drag_overlay.dart: FileTooLong \u2014 803 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 303 over it, 1.61\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/presentation/widgets/image_editor/widgets/outpaint_edge_drag_overlay.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"caee54166998f0dfc38fcd52b03c8b4f88cfa76d051c83c296e52dd36bebe866"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AgentChatPanelController: ClassTooLong \u2014 642 significant lines (blank, comment-only and punctuation-only lines excluded), 65 methods. The bar is 400 significant lines; this is 242 over it, 1.61\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/presentation/agent_chat/widgets/agent_chat_panel_controller.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4edccd2a339fedc16735363ef3ed32ddea2748eeeaa0fefd8fbf1b1012ec816"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _DanbooruPostCardState: ClassTooLong \u2014 642 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 242 over it, 1.61\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/presentation/widgets/danbooru_post_card.dart"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b538502a127177e841d67488e92b5536789dc047342ea6f18e47b90b176de7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NAILauncherBridgeDocker: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\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":"krita_plugin/nai_launcher_bridge/ui.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2095bb31fe6927d5548c58df654021bf39802836b164cbefb02c7495dce4a80"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: QuickTagCloudRemoteCatalogService: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\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/data/services/online_gallery/quick_tag_cloud_remote_catalog_service.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1a62571efabf90037e29b402736e675e6f96173efb6bcabbe0a9686c507c87"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ImageWorkflowController: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\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/presentation/providers/generation/image_workflow_controller.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0638dbe1ccc0a8470386940842b8c2473b4170dea385c9bea56c841d3c93cbaa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentToolRegistryBuilder.build: MethodTooLong \u2014 build 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/presentation/agent_chat/services/agent_tool_registry_builder.dart"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f5921a25aee43f5709d1a56a74bc8612e2f4783a9254b146a0f800837b529f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentChatNotifier._sendMessage: MethodTooLong \u2014 _sendMessage runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\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/presentation/agent_chat/providers/agent_chat_notifier.dart"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"22920e95be380966cf8eb6f4881c29269c1e60cfdd5507fb0de578ce8b0e405e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _HoverPreviewCardInnerState.build: MethodTooLong \u2014 build runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\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/presentation/widgets/danbooru_post_card.dart"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a28c5b10dd0d7b34a798a151140200c0546725f12bce9272c6624a1172e6c85"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _VibeBundleImportDialogState: ClassTooLong \u2014 635 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 235 over it, 1.59\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/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55160acfcc70b481c6bf234bcd449bf6a161089900cc71e079b63af559f58e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/vibe_selector_dialog.dart: FileTooLong \u2014 790 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: _VibeSelectorDialogState (210-1154). The bar is 500 significant lines; this is 290 over it, 1.58\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/presentation/screens/vibe_library/widgets/vibe_selector_dialog.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e444b72639ab1a1c77b3106ba5e8644f2ee4065852698ae6195d30c9cd56a69"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _PreciseRefSelectorDialogState.build: MethodTooLong \u2014 build runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/precise_ref_library/widgets/precise_ref_selector_dialog.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"d574751e36dce69968759e07bae82453f1bc9716f52af7ffac4c2ce45fef772e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CategoryItemState.build: MethodTooLong \u2014 build runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/gallery/gallery_category_tree_view.dart"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"d657af247d3864b4e0b63db53bc69d2cb3b34842619d9108bd4d761607dc0188"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _PresetImportDialogState.build: MethodTooLong \u2014 build runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/diy/dialogs/preset_import_dialog.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"24dec592ab2eeb25454e21821fe91d9cce2ff6f63cf3d4721730234f18b5c2d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nai_launcher_bridge/ui.py: FileTooLong \u2014 782 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 282 over it, 1.56\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":"krita_plugin/nai_launcher_bridge/ui.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"433dbb390a3852316f180ac8dd72a7104619deedaf5f1a0cbc331400a62de01c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataSourceCacheSettings.build: MethodTooLong \u2014 build 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/presentation/screens/settings/widgets/data_source_cache_settings.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f71e16a698a1d7ae75fb3f6e0f331bc31e0ddc16920d25903f2e53b26f20787"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _AutocompleteWrapperState: ClassTooLong \u2014 623 significant lines (blank, comment-only and punctuation-only lines excluded), 38 methods. The bar is 400 significant lines; this is 223 over it, 1.56\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/presentation/widgets/autocomplete/autocomplete_wrapper.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22daaabc460d47421213538684f22fc22a7b959aa6aa887719be9ec1795dd03"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Layer: ClassTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded), 70 methods. The bar is 400 significant lines; this is 222 over it, 1.56\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/presentation/widgets/image_editor/layers/layer.dart"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfd23e9106f4b27421f20dd2b0fb45668fdae9218eee1e94dd027f2bf5cbef9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VibeImageEmbedder: ClassTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods. The bar is 400 significant lines; this is 222 over it, 1.56\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/core/utils/vibe_image_embedder.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b88e002db956b7c0ce2e69a7aa8966d81ad6ef79a4a59082a6fcc64477f9e5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GoogleDriveCloudSyncBackend: ClassTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded), 43 methods. The bar is 400 significant lines; this is 221 over it, 1.55\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/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4a5fff4a5cae6b98d032959e0f23b69a29ae70a489a12a928e096284fada09"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _OnlineGalleryToolbarPresenter: ClassTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods. The bar is 400 significant lines; this is 219 over it, 1.55\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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_feature.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d831ed20500f1157811ee68cf8dc779d8221e5831f1b638460ff0448c74a65"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/agent_chat_resource_widgets.dart: FileTooLong \u2014 772 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 272 over it, 1.54\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/presentation/agent_chat/widgets/agent_chat_resource_widgets.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"419e646b33098661169068823b401746f7c23906a4b9994f33b60c00f9809b1a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AppCloudSyncDataSource: ClassTooLong \u2014 617 significant lines (blank, comment-only and punctuation-only lines excluded), 55 methods. The bar is 400 significant lines; this is 217 over it, 1.54\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/data/cloud_sync/app_cloud_sync_data_source.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f324cb68d15cf9ce7368ccfc0823872f332bb5d8574d48c87aeb5d90a6c6913"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CredentialsLoginFormState.build: MethodTooLong \u2014 build runs 154 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\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/presentation/widgets/auth/credentials_login_form.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2698eb1146b41bd1055313cf4c83112ae9e44ec3b0c67e49f19cfdaf25f199"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GalleryDetailInfoPanel: ClassTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded), 13 methods. The bar is 400 significant lines; this is 215 over it, 1.54\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/presentation/widgets/online_gallery/gallery_detail_info_panel.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9445687f9601e1d6337b26db8f38c5b28adcf171cfe6b79d8a452717ed6b99c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/detail_metadata_panel.dart: FileTooLong \u2014 766 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 266 over it, 1.53\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/presentation/widgets/common/image_detail/components/detail_metadata_panel.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9e80f6bc79ee43de824dbf99f84458c8e264b5570b28a5c7c65fc73b4fa55c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OnlineGalleryBlacklistNotifier: ClassTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 400 significant lines; this is 212 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/presentation/providers/online_gallery_blacklist_provider.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90f1e799e2b9527707201962d688458d5f0094df02bd806738062746a8e47e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WebDavCapabilityProbe.run: MethodTooLong \u2014 run runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\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/core/cloud_sync/backend/webdav_capability_probe.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2063f0adff8d7c53db5cb5f12f80d50df21fb3624f5a6aea099a6cbd67d3ccf6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Img2ImgSourceSection.build: MethodTooLong \u2014 build runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\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/presentation/screens/generation/widgets/img2img_source_section.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25d4754ff4ac2729092c1a194b4a3b51be4be96b70c8c8e29f171a4ba408a60"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MainNavRail.build: MethodTooLong \u2014 build runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\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/presentation/widgets/navigation/main_nav_rail.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b480923cc4ca652725bbcd4b4f507a13e733daabff9ecd13838c5c64a22f115"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AgentChatMessages: ClassTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 207 over it, 1.52\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/presentation/agent_chat/widgets/agent_chat_messages.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22f8b0c33e92aa8be4ae77f863c717222b07e21dff0723064713b958f6c5d82"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: local_gallery/local_gallery_action_coordinator.dart: FileTooLong \u2014 756 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: LocalGalleryActionCoordinator (154-1055). The bar is 500 significant lines; this is 256 over it, 1.51\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/presentation/screens/local_gallery/local_gallery_action_coordinator.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"677cc6e013cbec6cd02bc18f59d3d2afc3cfe723113429c510e5c3d9df70444f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _DiscordShareDialogState: ClassTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 204 over it, 1.51\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/presentation/widgets/discord_share/discord_share_dialog.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9de497e43d8656e95bc52ea8231abcda57a5da93b3e72d5ec499a6a90b07543"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UpdateCheckDialog: ClassTooLong \u2014 603 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 203 over it, 1.51\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/presentation/widgets/common/update_check_dialog.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a66bd284195a38d4391f829a4b10f7c8a0fce9821f7dda9a42c90fa1a33bb0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layers/layer.dart: FileTooLong \u2014 753 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: Layer (200-1175). The bar is 500 significant lines; this is 253 over it, 1.51\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/presentation/widgets/image_editor/layers/layer.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9b3647cd79993a4669ced277cae6402be0c4402cc35e484ce1c409e1c9955a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TagLibraryService.getBuiltinLibrary: MethodTooLong \u2014 getBuiltinLibrary runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\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/data/services/tag_library_service.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9766ad421f980bbfe4be314e24db550486d2d1f51f7fdb73cd0c815cb27ee2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GeminiGenerateContentAdapter.completeAgent: MethodTooLong \u2014 completeAgent runs 149 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\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/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdde0772b369e9c3b33e2a71e869848928a4f35e0a2670f78ac9f8b7c1325f3c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _GlobalSettingsDialogState._showAddTagOptionDialog: MethodTooLong \u2014 _showAddTagOptionDialog runs 149 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\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/presentation/widgets/prompt/global_settings_dialog.dart"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82d3a662cba6e565179ea317268354bfe7690c50ffb4829207647932bdcf162"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LocalStorageService: ClassTooLong \u2014 595 significant lines (blank, comment-only and punctuation-only lines excluded), 179 methods. The bar is 400 significant lines; this is 195 over it, 1.49\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/core/storage/local_storage_service.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b5051502e54063d81b6f2fc1854345f53554a9c0b27eff1ac0cf7f5774998a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _VibeExportDialogState: ClassTooLong \u2014 595 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 195 over it, 1.49\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/presentation/screens/vibe_library/widgets/vibe_export_dialog.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"507cc5675a2212d7c224444ac9c4e669ef1eafa78b24055b9fbffc4fd9192697"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metadata/metadata_import_dialog.dart: FileTooLong \u2014 742 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: _MetadataImportDialogState (76-1016). The bar is 500 significant lines; this is 242 over it, 1.48\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/presentation/widgets/metadata/metadata_import_dialog.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9330b67d235d0b8fa6b67f3d677e8c3c806c131c167ddbcf2629f35cfe505dc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _WatermarkEditorScreenState: ClassTooLong \u2014 593 significant lines (blank, comment-only and punctuation-only lines excluded), 30 methods. The bar is 400 significant lines; this is 193 over it, 1.48\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/presentation/screens/watermark/watermark_editor_screen.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf6aef1a024abe385bcd32880794bda57392a0f90bb7b03b15ee175c584bf2c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SqliteGalleryAlbumRepository: ClassTooLong \u2014 593 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 193 over it, 1.48\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/core/database/datasources/gallery_album_repository.dart"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"289e023044da89f4f2ad6effe44a6cb4a38f0523a8679affb2a36aa03fb2e31f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _BulkProgressDialogState.build: MethodTooLong \u2014 build runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\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/presentation/widgets/bulk_progress_dialog.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa946c42fc400a2ca592454678ab7c42045daa39006c9b16bf84d1c706d606f0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ExecutionStatsPanelState.build: MethodTooLong \u2014 build runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\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/presentation/widgets/queue/execution_stats_panel.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"53be713630cf12c9d2057d8fe701431b41725330255e4d6df06711e2df4cb0a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/agent_chat_session_controller.dart: FileTooLong \u2014 738 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: AgentChatSessionController (43-951). The bar is 500 significant lines; this is 238 over it, 1.48\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/presentation/agent_chat/services/agent_chat_session_controller.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5539b644fcd67a43f094d82c37d4a61eba51f807dbb1a9eb32b56652f88d2a8f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ManualInpaintToolbox: ClassTooLong \u2014 589 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 189 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/presentation/agent_chat/services/manual_inpaint_toolbox.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"7173e2c8a97a37bd599e9042a3708785e8a5429a90f4ce3a40706f7af1454ac9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/auth_provider.dart: FileTooLong \u2014 735 significant lines (blank, comment-only and punctuation-only lines excluded), about 77% of them inside a single declaration: AuthNotifier (265-1154). The bar is 500 significant lines; this is 235 over it, 1.47\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/data/services/auth_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6b18b5375f197f5ea551a038aef19a5fd3372cc6dbed35556c2091acb1e4a9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AgentChatComposerState._editor: MethodTooLong \u2014 _editor runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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/presentation/agent_chat/widgets/agent_chat_composer.dart"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c23b5a6d94dde1bd6bc0f2f2fb5d32cee2e6f6ba8c2b8d948de1967609dca7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ImagePreviewWidgetState._buildGeneratedImageCard: MethodTooLong \u2014 _buildGeneratedImageCard runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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/presentation/screens/generation/widgets/image_preview.dart"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"205c8a06c805658d8a6574928826b90deafe571d8bbfb75f92732478e90509c9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OnlineGalleryDetailLauncher.show: MethodTooLong \u2014 show runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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/presentation/screens/online_gallery/online_gallery_detail_launcher.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"60248bdef09aa4c9624841ee0fa1e73c4fa2801e14a10457f05c103672728703"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SaveAsPresetDialogState.build: MethodTooLong \u2014 build runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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/presentation/widgets/common/save_as_preset_dialog.dart"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"415d895fd5a93ce39c7a86678b524c43423a3a6488c4800f9fa9d0f0c4ec1b7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/prompt_toolbox.dart: FileTooLong \u2014 733 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: PromptToolbox (20-929). The bar is 500 significant lines; this is 233 over it, 1.47\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/presentation/agent_chat/services/prompt_toolbox.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0faf148beaa0a79330cddce56a4c5030aeab1f77415291ac41b94bb514c5eb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: autocomplete/autocomplete_wrapper.dart: FileTooLong \u2014 730 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: _AutocompleteWrapperState (127-933). 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/presentation/widgets/autocomplete/autocomplete_wrapper.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4a4646ece9577137ae3cab7361c5e2f416b3f3a1e21b8d6a53524a5accf7d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: prompt/tag_editor_view.dart: FileTooLong \u2014 727 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: _TagEditorViewState (60-924). The bar is 500 significant lines; this is 227 over it, 1.45\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/presentation/widgets/prompt/tag_editor_view.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e1fbfefc236d2d3def18ca76d2ba3a94a38cb2c8024ef3a9554135a4a72acb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/agent_chat_messages.dart: FileTooLong \u2014 721 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: AgentChatMessages (23-825). The bar is 500 significant lines; this is 221 over it, 1.44\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/presentation/agent_chat/widgets/agent_chat_messages.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cea63b5c4633086595f5d109581d56f5bab301a4bec2f625414cce98a627557"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: discord_share/discord_share_dialog.dart: FileTooLong \u2014 720 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: _DiscordShareDialogState (115-897). The bar is 500 significant lines; this is 220 over it, 1.44\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/presentation/widgets/discord_share/discord_share_dialog.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c98ff6c89fa69ae1b048fedb2356e4d170841e0cd6219aac822e69dbf049b0b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _TokenLoginCardState.build: MethodTooLong \u2014 build runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\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/presentation/widgets/auth/token_login_card.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6af65e1c949b2963f48c4acded981005bd18655ab90172f9d7a2c0fe3d9fcd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/google_drive_cloud_sync_backend.dart: FileTooLong \u2014 718 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: GoogleDriveCloudSyncBackend (22-851). The bar is 500 significant lines; this is 218 over it, 1.44\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/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"698a905d5c799dd2f141ea28050a4fc6725775700c994fc098e6f0832d51b872"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: online_gallery/quick_tag_cloud_remote_catalog_service.dart: FileTooLong \u2014 718 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 218 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/online_gallery/quick_tag_cloud_remote_catalog_service.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c17115283407abc56eec75ca2c3b2a6e1813ec59318f4504f36b06ea988462"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/vibe_export_dialog.dart: FileTooLong \u2014 717 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: _VibeExportDialogState (127-1026). The bar is 500 significant lines; this is 217 over it, 1.43\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/presentation/screens/vibe_library/widgets/vibe_export_dialog.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8209ec42edef18020a7eb1dd73d74cb3d5136be409e6536f58cf533c6adb2d0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GoogleDriveCloudSyncBackend: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.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/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ca720f5099436d82c9069718eca15b2cbaef2b9f3c8f243a118de57dea3306"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OnlineGalleryScreenController: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.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/presentation/screens/online_gallery/online_gallery_screen_controller.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9d87d116b0552a0f75d64fe0eda8e0f9044d99a29c20b750f860154567b047"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JsonlSessionStorage: ClassTooLong \u2014 572 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 400 significant lines; this is 172 over it, 1.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/core/agent/harness/session/jsonl/session_jsonl_storage.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e83442c3bd1d7f8eaae21234eb99369cef0e86b03f91e9c5ea0c5e09b59ce86"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VibeDetailParamPanel._buildActionBar: MethodTooLong \u2014 _buildActionBar runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/vibe_library/widgets/vibe_detail/vibe_detail_param_panel.dart"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9745239520336f999ab91bbeb7334e3c986636293a1cac6121c2a0eb899d573"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _VibeExportDialogAdvancedState.build: MethodTooLong \u2014 build runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/vibe_library/widgets/vibe_export_dialog_advanced.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"7341559555d4aafe0514d668b4f40f36257a73c88f4db926734867ed7351b821"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _DanbooruPostCardState._buildActions: MethodTooLong \u2014 _buildActions runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/danbooru_post_card.dart"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"5731112784adfdba825d9c5a8e15ff4a7213fd20787b1e525ce40bdece1870f8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _FixedTagEditDialogState: ClassTooLong \u2014 571 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 171 over it, 1.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/presentation/widgets/prompt/fixed_tag_edit_dialog.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53cbdfac237a392e0ab0e741802d902d5e28b56dbdea3a5fef2e7e5fd5f98b7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AuthNotifier: ClassTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 169 over it, 1.42\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/data/services/auth_provider.dart"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecc6ecc6a3d91701a50ac043f81ecd62337b9e02740bafd0e8a416471a941b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/vibe_bundle_import_dialog.dart: FileTooLong \u2014 711 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: _VibeBundleImportDialogState (102-993). The bar is 500 significant lines; this is 211 over it, 1.42\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/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"923df6dab7e50360bc0ad0ebd1c3b1a82fe132524758ec49bf710decc0ebc939"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AlbumItemState.build: MethodTooLong \u2014 build runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\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/presentation/widgets/gallery/gallery_album_tree_view.dart"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"f813f6fa3f7eeee5744839f323a97262290ee89344c48a220f5903e4d1226bca"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DroppedFileReader: ClassTooLong \u2014 567 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 167 over it, 1.42\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/presentation/utils/dropped_file_reader.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b2191bd69fb3848d188cfc5d574f5636c3af3973c549eb08e67a1ac0c5916f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/agent_chat_panel_controller.dart: FileTooLong \u2014 705 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: AgentChatPanelController (39-883). The bar is 500 significant lines; this is 205 over it, 1.41\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/presentation/agent_chat/widgets/agent_chat_panel_controller.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc02a1faf7e43f82efde8ea25b9176d6248027d33c02542da5d2a7085449368"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _VibeCardState: ClassTooLong \u2014 562 significant lines (blank, comment-only and punctuation-only lines excluded), 28 methods. The bar is 400 significant lines; this is 162 over it, 1.41\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/presentation/screens/vibe_library/widgets/vibe_card.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a1baf8fae092e79fc1d0066c2e628561428eeed78be2344c3cf0dd2b39e5ac"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DanbooruTagGroupTree: ClassTooLong \u2014 562 significant lines (blank, comment-only and punctuation-only lines excluded), 4 methods. The bar is 400 significant lines; this is 162 over it, 1.41\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/data/models/prompt/danbooru_tag_group_tree.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb76982862bfa71aed46c7d96931f8dfc14547cc527fb5175716e2063ad782a0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ImageGenerationNotifier: 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/presentation/providers/image_generation_provider.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"624cba7053dd7023ed8dc24f9116efa80508f067d57af626b7c15542a56f99ff"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorCompressionController: 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/presentation/widgets/image_editor/controllers/editor_compression_controller.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0786c788830946b0febfde05820e96363db3a79d29536c639032ca83fcc9468a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InpaintOutpaintUtils: ClassTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 160 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/core/utils/inpaint_outpaint_utils.dart"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e652bcab273728f926333c3f942e394e42f70caadbce7552d4e9b0412849c8c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _VibeCategoryItemState.build: MethodTooLong \u2014 build runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e006fed1f0460e3a8c2802ee0fd2cb2577d8e4ca1b40720dee8e56cf35f5791"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/online_gallery_blacklist_provider.dart: FileTooLong \u2014 699 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: OnlineGalleryBlacklistNotifier (95-894). The bar is 500 significant lines; this is 199 over it, 1.40\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/presentation/providers/online_gallery_blacklist_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f42a06431fbd6a189fa42f1ae419e4adcca977ba63690800948c0b34cda0b2f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OpenAiChatCompletionsAdapter.completeAgent: MethodTooLong \u2014 completeAgent runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdf139b82003d0d1210a6e69eb5f3f9b9290f4b3c9f162907ee4d6a5422bcc8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _GalleryFilterPanelState.build: MethodTooLong \u2014 build runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/gallery_filter_panel.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee387295b66b4d41eb995388c50e882f832b9646aa968d619614378604197451"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: database/build_cooccurrence_only.dart: FileTooLong \u2014 690 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 190 over it, 1.38\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":"tool/database/build_cooccurrence_only.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ebc9246365bdbf9358a5bbdfd9e874524216a39573f84ead1ecd457c2732f8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _HeatmapChartState.build: MethodTooLong \u2014 build runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\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/presentation/screens/statistics/widgets/charts/heatmap_chart.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bfdcd39fc30e4bea8767f140718d5f9bfedb13493ed23538a8ceb2a46fbbb5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _LocalGalleryToolbarState.build: MethodTooLong \u2014 build runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\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/presentation/widgets/gallery/local_gallery_toolbar.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecedd9dcf8ad1715213013702576833758420ff70563ed2e6a7e8c79f806ade1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OpenAiChatCompletionsAdapter: ClassTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 150 over it, 1.38\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/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc4dcc3343b6162e757ca3e8b64a32ed1e323c5e8bf45a6381ce3dd6cc83eae"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OnlineGalleryDetailLauncher: ClassTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 150 over it, 1.38\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/presentation/screens/online_gallery/online_gallery_detail_launcher.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd14a92fecb0560d55926913fde6d8755d72ff9563da046b7bad765dfc4baea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: online_gallery/donmai_gallery_source_adapter.dart: FileTooLong \u2014 686 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: DonmaiGallerySourceAdapter (11-933). The bar is 500 significant lines; this is 186 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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09715a49b523fce1b0ea3b74278c02d6deb4023de0e1071536beacde0dc5c7b4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SlideshowScreenState.build: MethodTooLong \u2014 build runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\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/presentation/screens/slideshow_screen.dart"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"589c97fd7f252f5d39947cdf4762151954b3828f864f18b62c3c6254ea892c0d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _AccountProfileBottomSheetState: ClassTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 147 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/settings/account_profile_sheet.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5732495852d261dd829a2535f9528bb2e567cf9063b858456306e8320feb3b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _GlobalSettingsDialogState: ClassTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded), 16 methods. The bar is 400 significant lines; this is 147 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/global_settings_dialog.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c30811a26f3d8dd83bd6e0431700d5e24dee92fd23c20c662831631e3a3d92c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GenerationPreparationService: ClassTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 147 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/generation_preparation_service.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7ba8ce1e7412842490a1f5ece2183b03255e89f1ad7a650a8f84059d7d6134"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OnlineGalleryBlacklistNotifier: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/online_gallery_blacklist_provider.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"12717ed40e4532290db6b7d151f15ad8a272a1026039004f1678fd13cf92f5dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compaction/compaction.dart: FileTooLong \u2014 683 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 183 over it, 1.37\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/core/agent/harness/compaction/compaction.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64972b3dd433bf59ca9693ac6e777eaa8660d7651eb392fdc7e964f7ae4b6cf4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _OnlineGalleryContentPresenter: ClassTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 144 over it, 1.36\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/presentation/screens/online_gallery/online_gallery_content.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecbd4aef3c6fac74bcbecb89cd44107ecfaa459a0a5e6863957b4d60ec386f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NAIImageRequestBuilder.buildVibeTransferParameters: MethodTooLong \u2014 buildVibeTransferParameters runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\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/core/network/request_builders/nai_image_request_builder.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea322fc2b7bd30f6a243797636ffdfff466c5289fc7c0ee68e4756f43bb0e40"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImageGenerationNotifier.generate: MethodTooLong \u2014 generate runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\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/presentation/providers/image_generation_provider.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ad0dd02ecd3608e618bc4c54c68fe4740c4d2772f9e8ca2fd60089ff938d83"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _TagLibraryToolbarState.build: MethodTooLong \u2014 build runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\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/presentation/screens/tag_library_page/widgets/tag_library_toolbar.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"942e87419d7b234425ab709f64caa7e20a8f5a62f82c5a80b820423f65b0e28a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SaveVibeDialogState.build: MethodTooLong \u2014 build runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\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/presentation/widgets/common/save_vibe_dialog.dart"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda25a7dee1f444536556ff6bc7a739c7277bdc89d8f17227e078de9fbf77e02"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/vibe_file_parser.dart: FileTooLong \u2014 679 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: VibeFileParser (23-1033). The bar is 500 significant lines; this is 179 over it, 1.36\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/core/utils/vibe_file_parser.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0f937d37fd23f0cc431adf4d137dc6261e5ad0e88fa6b45d95128c975b99fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: common/update_check_dialog.dart: FileTooLong \u2014 678 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: UpdateCheckDialog (28-892). The bar is 500 significant lines; this is 178 over it, 1.36\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/presentation/widgets/common/update_check_dialog.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09a78523e658c85517d08e2da46e2ad1741c9f166b60c227c22bc9f21de3abf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FixedTagsNotifier: ClassTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods. The bar is 400 significant lines; this is 140 over it, 1.35\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/presentation/providers/fixed_tags_provider.dart"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0d65c6f4c145edd1d632f904a733f3bb1e9fb10833ce73123a374097e8a050"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AgentChatSessionPickerBodyState.build: MethodTooLong \u2014 build runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\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/presentation/agent_chat/widgets/agent_chat_session_picker.dart"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5de827464e2c4fef4f0261b41868eaf716e5cdec3f55207e8ea19fbe22ce99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: online_gallery_toolbar/online_gallery_toolbar_feature.dart: FileTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: _OnlineGalleryToolbarPresenter (69-873). 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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_feature.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebb0830f57cc11fb6f50fdad3e4d2688b4b8dd17ef15f6064b6ced9422b200f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _QuickTagCloudToolbarState: ClassTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded), 12 methods. The bar is 400 significant lines; this is 136 over it, 1.34\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/presentation/widgets/online_gallery/quick_tag_cloud_toolbar.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"46874a2b9b36076abc958493734270272b57cf8f8a8002c70135d52c89f29339"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/vibe_image_embedder.dart: FileTooLong \u2014 670 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: VibeImageEmbedder (19-950). The bar is 500 significant lines; this is 170 over it, 1.34\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/core/utils/vibe_image_embedder.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5fe63ebabea0625656a0fbdee61a7401102bc5cc8ae0ec06adda12b9d94586"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnthropicMessagesAdapter.completeAgent: MethodTooLong \u2014 completeAgent runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\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/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f3030e6c38112caf9b5bd2e277201365d6fea7e948a8dbebfdee9795527853"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _WebAccessSettingsState.build: MethodTooLong \u2014 build runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\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/presentation/screens/settings/sections/web_access_settings.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c50be686facdc01963e99f14a25a372987979212ff824a7e3e2855d75eb6f3a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FixedTagColumn.build: MethodTooLong \u2014 build runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\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/presentation/widgets/prompt/fixed_tags_columns.dart"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c32e7fdc45268ca411cdb68e461d804ad11a1919b3fe9f4647a568ddad7706"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GenerationParamsNotifier: ClassTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded), 90 methods. The bar is 400 significant lines; this is 135 over it, 1.34\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/presentation/providers/generation/generation_params_notifier.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab54ad4d29f8765cd0842f9bd6d2ffd065f6ad7330cbb9053511033773d89caa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OnlineGalleryPrefetchCoordinator: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\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/core/cache/online_gallery_prefetch_coordinator.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83cd4bd0cf422188c827ce8029c8d52c8dc0e775c46b0f996d1f1296ab42575"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RandomPresetNotifier: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\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/presentation/providers/random_preset_provider.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f525d3c60234c14b55db594db99875db5ec653b9d403089fbbb3b6406e8f4f7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LayerTransformController: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\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/presentation/widgets/image_editor/core/layer_transform_controller.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"864b4851044c36798c678834fef18d211fea7f79395a71f659b333a3f7a2d78b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/agent_chat_turn.dart: FileTooLong \u2014 666 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 166 over it, 1.33\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/presentation/agent_chat/widgets/agent_chat_turn.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfab07463d371ceb896fab3151262b6e10bd1c0984e194b1cb88db02f5489d57"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _VibeLibraryContentViewState: ClassTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded), 12 methods. The bar is 400 significant lines; this is 132 over it, 1.33\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/presentation/screens/vibe_library/widgets/vibe_library_content_view.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fd499783d61d5506dd9290f0c67f92087fca74f7d2c35feb129732fe401c0a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NAIImageRequestBuilder.build: MethodTooLong \u2014 build runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\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/core/network/request_builders/nai_image_request_builder.dart"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"7327b058a72edf4b1fc74f067ea8a0b011576be65c1516593492d32e2f5a5f0b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _OnlineGalleryToolbarPresenter._buildPrimaryActions: MethodTooLong \u2014 _buildPrimaryActions runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_feature.dart"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01f4e2b759740e4d49c956898b10a1b260f7e4f1f033c69da643d398188b2cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: panels/canvas_size_dialog.dart: FileTooLong \u2014 659 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 159 over it, 1.32\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/presentation/widgets/image_editor/widgets/panels/canvas_size_dialog.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"080862505639059b985206039119794ffddfe41440f0a8bd23fd6b180b48796e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: online_gallery/quick_tag_cloud_toolbar.dart: FileTooLong \u2014 658 significant lines (blank, comment-only and punctuation-only lines excluded), about 81% of them inside a single declaration: _QuickTagCloudToolbarState (36-728). The bar is 500 significant lines; this is 158 over it, 1.32\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/presentation/widgets/online_gallery/quick_tag_cloud_toolbar.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b9553c74459b95642f3087449e13e9356768ce1402ae1afe9a9670b8a026dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: common/searchable_model_picker.dart: FileTooLong \u2014 656 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 156 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/searchable_model_picker.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb2daf9ae0fad64590bfad22be61353346d6832fe4fbea7c053e7eed80038a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: watermark/watermark_editor_screen.dart: FileTooLong \u2014 655 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: _WatermarkEditorScreenState (77-860). The bar is 500 significant lines; this is 155 over it, 1.31\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/watermark/watermark_editor_screen.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"316e13777a68581ecb9d4e43dcbe7edf9c88a4c806329a20414d845ee15f362c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReadHarnessTool.executeWithContext: MethodTooLong \u2014 executeWithContext runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/harness/tools/read.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ec18a13ad0958f44792197e96e2a8311d497786f840cb22022e0bc69d34cb5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AgentChatWorkTrailState.build: MethodTooLong \u2014 build runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/widgets/agent_chat_turn.dart"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b70899df2234f8527569e0bf29a3baaea084c3b5e14db211e8955cfa75cf960"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _TaskListItemState.build: MethodTooLong \u2014 build runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/queue/task_list_item.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3c46af84a3754edf374a922f6f23cfea6df4a1a5b878d53f5c82593a7ca75c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PicaLanczosResizer: ClassTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 123 over it, 1.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/core/utils/pica_lanczos_resizer.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"564b9fa7a346fa070fb15c758089abfd71e85e838a8cfd1f39227302b38f00c4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VibeImageEmbedder: 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/core/utils/vibe_image_embedder.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d65cd603063c05671b2e600df7418740db244e89e1ac6efff38db33ddbfd86"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FixedTagsNotifier: 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/presentation/providers/fixed_tags_provider.dart"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4c6980b8120f062446aeec8fc361685e2ff8b619f1c9f92778330ecb905b10"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OnlineGalleryCommandService: 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/presentation/providers/online_gallery_command_service.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8ae2f5c655d9e7610166cfc3c2fa23ec9ff90f6288b7b697b75b4a484884a6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _ImageEditorScreenState: 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/presentation/widgets/image_editor/image_editor_screen.dart"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"90281e3ec2a1b469545ddd626808e3dba34b1d07c52c2d6b204bfd9714cb2613"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/manual_inpaint_toolbox.dart: FileTooLong \u2014 650 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: ManualInpaintToolbox (83-874). The bar is 500 significant lines; this is 150 over it, 1.30\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/presentation/agent_chat/services/manual_inpaint_toolbox.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23d4f7aa2959fc505d60b9a325f3dc2f64ded6af50b86344fccddbc3af0f6b5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _OfficialRecipeEngine._furryCharacter: MethodTooLong \u2014 _furryCharacter runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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/data/services/official_random_prompt_generator.dart"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"682228efc63928910748c0909641deadfd9495e56975c82a11e95ac1e1c5def0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _WebLeftPanelState._buildExpanded: MethodTooLong \u2014 _buildExpanded runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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/presentation/screens/generation/widgets/web_left_panel.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4c2d5f7ff1492b4bcdcb41ae51f1263b5e2d636fc90fb9d1fb8981aeddf796"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ImportDialogState._buildPreview: MethodTooLong \u2014 _buildPreview runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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/presentation/screens/tag_library_page/widgets/import_dialog.dart"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79feb920c2a8b74bef4032d6e461a4c1042c9665e4eda0acf09fd6ddc38dbac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompletionOverlay.build: MethodTooLong \u2014 build runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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/presentation/widgets/autocomplete/completion_overlay.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a75f01ec8e904447ee8644ee237042f5715b46bcaa7891490e1d6c8f397a52"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AddToLibraryDialogState.build: MethodTooLong \u2014 build runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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/presentation/widgets/common/add_to_library_dialog.dart"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df1f7a8aa57e6ffd339ef97f80900050f83880285cf63c500a7285be8101328"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CompletionOrchestrator: ClassTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 118 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/core/autocomplete/completion_orchestrator.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aad3683eddbac8571024e52ccb576eb69959545dde185ce7118b34c49d7e3d5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ShortcutSettingsPanelState._buildContent: MethodTooLong \u2014 _buildContent runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\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/presentation/screens/settings/widgets/shortcut_settings_panel.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"70796f4b3b0e52518a2fe8bd2b441de8c0aba8f157281807a15233572c7543f0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: QuickTagCloudParser: ClassTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 111 over it, 1.28\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/data/services/online_gallery/quick_tag_cloud_parser.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c76d9b10c6ec46d37b468f33666f20d80fcbac73d697cc710c83e9ca2e38ed3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: datasources/gallery_album_repository.dart: FileTooLong \u2014 638 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: SqliteGalleryAlbumRepository (113-934). The bar is 500 significant lines; this is 138 over it, 1.28\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/core/database/datasources/gallery_album_repository.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"192bdcf5ce3aff92f19f4e7d175f4114829ca1e6f75a2674263f3c5ee5280c81"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/generation_param_sections.dart: FileTooLong \u2014 636 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 136 over it, 1.27\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/presentation/screens/generation/widgets/generation_param_sections.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e3da8afd445b361ec9ab825c1fb09fbc8b74158cf8e0cbe2df4b49ade795d9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _EntryAddDialogState: ClassTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 108 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/tag_library_page/widgets/entry_add_dialog.dart"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ee25f8a10582c62194e808f553f6e5365e0d3b2c79fc192ba8629a42924742"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SqliteGalleryImageRepository: ClassTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded), 16 methods. The bar is 400 significant lines; this is 108 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/datasources/gallery_image_repository.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a027db108471e6bb7fe3e8cc77f0bb6cd486cdc3dab3339f0f3efc1775bb5602"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MobileCollapsedPromptLauncher.build: MethodTooLong \u2014 build 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/presentation/screens/generation/mobile_generation_workspace.dart"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40b576ecf081591a5704adbffa78446f252978129239ccc00db4ae6b21eb4f0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _GalleryFilterPanelState: ClassTooLong \u2014 507 significant lines (blank, comment-only and punctuation-only lines excluded), 12 methods. The bar is 400 significant lines; this is 107 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/gallery_filter_panel.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c6f70657d895f668a301c3e66b9ec9344792c7f50201ae2d2de423b4a01f42"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Agent: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/agent.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cab118e71f19ab1eb0259ff8bdace8dbbc5bf5e1a1513f9e46d3dbd3c4ae61f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WebDavCloudSyncBackend: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/backend/webdav_cloud_sync_backend.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9147f6b493fbd3a9d8b409df4ff86824294483a9a658c5bb2d8a3f2db4b3df"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LocalGalleryActionCoordinator: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/local_gallery/local_gallery_action_coordinator.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2830a963c90ca58818e5e37ff6ef49961b5f242f247d5497454b90bb41dcf0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _AutocompleteWrapperState: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/autocomplete/autocomplete_wrapper.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f60ea4a68d1281417ac5977191acd6a1f90408e3abc66b4f8b0c32c3272521e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GalleryCategoryRepository: ClassTooLong \u2014 506 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 106 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/repositories/gallery_category_repository.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9a5ca9ecd12452c2d7e7534072271a6243999b262d1a9fded87cf2d7ab93eb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PromptAssistantService: ClassTooLong \u2014 506 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 106 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/services/prompt_assistant_service.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b0c3d749455c1ed35d1eeeb8c63097491ce67873da823f0be1e9dd5b741afe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/online_gallery_state.dart: FileTooLong \u2014 632 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 132 over it, 1.26\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/presentation/providers/online_gallery_state.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7577e7574e99b82ca6daf716840b243a0db0169af13e21c47ec39ac8aa78f43d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cloud_sync/app_cloud_sync_data_source.dart: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: AppCloudSyncDataSource (18-826). The bar is 500 significant lines; this is 131 over it, 1.26\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/cloud_sync/app_cloud_sync_data_source.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee72cb2da333b5f6b7cd3615a057b31a6f379a87e17bdf0b2d8d0b837d90d63e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent/agent_loop.dart: FileTooLong \u2014 630 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 130 over it, 1.26\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/core/agent/agent_loop.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd1194526fdf84693428405ece12800daa99661e7f5c04aee07cbcf1ad2e9f7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WatermarkRenderService.render: MethodTooLong \u2014 render runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/watermark/watermark_render_service.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd87b626cbc9a41a29a3f143f9aeac8adf309e39a4fde4ca078025d6c2a9e1d0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OneDriveApiClient: ClassTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods. The bar is 400 significant lines; this is 103 over it, 1.26\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/core/cloud_sync/backend/onedrive_api_client.dart"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cea697a4bb76576de96bcc156594e6238445a1c142ab7dfab5faae535c2b6e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _ImportDialogState: ClassTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 103 over it, 1.26\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/presentation/screens/tag_library_page/widgets/import_dialog.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"88549ff24058859dc8f2c4f372fdfc0c4996cd1aa457fa521487b311eef2f75c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _PaginationBarState: ClassTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 102 over it, 1.26\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/presentation/widgets/common/pagination_bar.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30ca96ae04a552548c7e03cc73d63a591bf378e641f4bd115ead423c17fd121"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: online_gallery/gallery_detail_info_panel.dart: FileTooLong \u2014 627 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: GalleryDetailInfoPanel (16-823). The bar is 500 significant lines; this is 127 over it, 1.25\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/presentation/widgets/online_gallery/gallery_detail_info_panel.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed97c9b42344f0084b0b91cbf89f444121ed01f79c0fc60874158bed3bbbbff"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VibeImportService: ClassTooLong \u2014 500 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 100 over it, 1.25\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/data/services/vibe_import_service.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9108cdf50dcebe6602b4de73794f8f85eda932e07c6b4986f28f4c3a8abf1c1d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BashHarnessTool.executeWithContext: MethodTooLong \u2014 executeWithContext runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/harness/tools/bash.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"788b930a17c6f3d78b7fb460feeca23ba65658d1fa6655946f6ec185e4d2da0c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NetworkSettingsSectionState.build: MethodTooLong \u2014 build runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/settings/sections/network_settings_section.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b4e7f5f06215cb4d489b0aa80d7cc5e785383a0b75d6e5aa2e458686e995f6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ThirdPartyApiLoginCardState.build: MethodTooLong \u2014 build runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/auth/third_party_api_login_card.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae582c04fc5123a4458550d60eba73789355e7c657acf69a40e717bb82cdd5f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: prompt/fixed_tag_edit_dialog.dart: FileTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: _FixedTagEditDialogState (69-855). The bar is 500 significant lines; this is 124 over it, 1.25\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/presentation/widgets/prompt/fixed_tag_edit_dialog.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c898c5c574766606b56588aeee81e2725772f69bfb46c5a0d1f76a56f5c92422"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ImageDestinationDialog: ClassTooLong \u2014 499 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 99 over it, 1.25\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/presentation/widgets/drop/image_destination_dialog.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2416e8dad484ebf6ea275ce4f0957d493bba8c80064c52b70df254702979e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/vibe_library_content_view.dart: FileTooLong \u2014 623 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: _VibeLibraryContentViewState (66-806). The bar is 500 significant lines; this is 123 over it, 1.25\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/presentation/screens/vibe_library/widgets/vibe_library_content_view.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ee7ee98abfa25550aa45a8dcb6cb33ee4c0eac51160dbc9bc0d804257535b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/vibe_card.dart: FileTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: _VibeCardState (76-869). The bar is 500 significant lines; this is 120 over it, 1.24\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/presentation/screens/vibe_library/widgets/vibe_card.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3947e1313486cf37909435550551080be7709166495d881eb9a0ca2af1a6008"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PortableRecordCodec.decode: MethodTooLong \u2014 decode 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/data/cloud_sync/portable_record_codec.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe98277d984d4177541fc5aa3d32c288987f45946cfdd40561b44cff6522197"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _EntryAddDialogState._buildContent: MethodTooLong \u2014 _buildContent 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/presentation/screens/tag_library_page/widgets/entry_add_dialog.dart"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a371d94e7cd579b46102fd2e6d75632e269867c79630adfa9d8244f3c84f982"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ole_drag_inspector/validate_ole_dump.dart: FileTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 118 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/ole_drag_inspector/validate_ole_dump.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de92d55bd8a97856e6678eb023d77654b15b52f1f688e33af770a8fa3162659"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/focused_inpaint_utils.dart: FileTooLong \u2014 617 significant lines (blank, comment-only and punctuation-only lines excluded), about 78% of them inside a single declaration: FocusedInpaintUtils (190-871). The bar is 500 significant lines; this is 117 over it, 1.23\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/core/utils/focused_inpaint_utils.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d91974a69d2b9b5c3ab34f744d50a1c2706d52470c66a378bbca95db2ea0c24"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gallery/gallery_filter_service.dart: FileTooLong \u2014 617 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 117 over it, 1.23\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/data/services/gallery/gallery_filter_service.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"437a77f393727f215755feee8ec9be31652de9294aec2788296c25b64527e90d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NaiImageMetadataRawDecoder: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/models/gallery/nai_image_metadata_raw_decoder.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6f1952099ef39ac56fff07816b8fb3ca7edd5d1bcece5c5bb4fa6d854bbe10"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TagEditorSession: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/tag_editor_session.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"186326d3de183f0054746f8b07cd5f4b8ad46c5e7fbe5114309837e8ccad450b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/tag_library_page_provider.dart: FileTooLong \u2014 616 significant lines (blank, comment-only and punctuation-only lines excluded), about 78% of them inside a single declaration: TagLibraryPageNotifier (190-909). The bar is 500 significant lines; this is 116 over it, 1.23\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/presentation/providers/tag_library_page_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c8b53b326966a61b16ddaa4027f45e53fa0c27cd00961312f0084701e1758e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/queue_execution_provider.dart: FileTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded), about 77% of them inside a single declaration: QueueExecutionNotifier (175-920). The bar is 500 significant lines; this is 115 over it, 1.23\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/presentation/providers/queue_execution_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2aab9d50603efb39d3e451f414045dc8a7c521bf4d83dc68943fb22ce0cdf8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/dropped_file_reader.dart: FileTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: DroppedFileReader (38-816). The bar is 500 significant lines; this is 115 over it, 1.23\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/presentation/utils/dropped_file_reader.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5425a1052e9b80547d92f0c613fc790d7d59ce8fbb5f886e59b4fa45ad96b71"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AgentChatComposerState._contextIndicator: MethodTooLong \u2014 _contextIndicator runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\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/presentation/agent_chat/widgets/agent_chat_composer.dart"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e13d53d29289656170629d28465021d7310f8bbb2516ee15102674b50b603a0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PromptInputToolbar.build: MethodTooLong \u2014 build runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\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/presentation/screens/generation/widgets/prompt_input_toolbar.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99f9bd7ad273c73a348d363a4de1d157ed3c65c5fa61cf25044c263d0e0846e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TagEditorSession: ClassTooLong \u2014 491 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 400 significant lines; this is 91 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/presentation/widgets/prompt/tag_editor_session.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcca956881b1324a710e3a03390d79dbe0eb7c070dfd35982d79de3b88354074"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/vibe_import_service.dart: FileTooLong \u2014 613 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: VibeImportService (123-807). The bar is 500 significant lines; this is 113 over it, 1.23\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/data/services/vibe_import_service.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18b39629e2ffbe8bc97967516c25609e29c4b74506cd703ea9c37fe7ce870d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/pica_lanczos_resizer.dart: FileTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: PicaLanczosResizer (11-704). The bar is 500 significant lines; this is 112 over it, 1.22\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/core/utils/pica_lanczos_resizer.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6108e94840f6b141aa733bb863911ca89f341af69dbd36604b97f535e6fec98f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: prompt/global_settings_dialog.dart: FileTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: _GlobalSettingsDialogState (47-830). The bar is 500 significant lines; this is 112 over it, 1.22\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/presentation/widgets/prompt/global_settings_dialog.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aceae96367c56923f5fa6c7d2a2980c6628fc56f5ad19fb73e48ab219562bf72"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AiTagGenerationParser: ClassTooLong \u2014 489 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 89 over it, 1.22\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/data/services/metadata/ai_tag_generation_parser.dart"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d16c3afde68678f3a64dfcc4dfa1776ea3b0e05af3ea7542dcfdff1bb26f30"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NAIImageRequestBuilder: ClassTooLong \u2014 488 significant lines (blank, comment-only and punctuation-only lines excluded), 13 methods. The bar is 400 significant lines; this is 88 over it, 1.22\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/core/network/request_builders/nai_image_request_builder.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8934d6e6c4a16b3339ed0f9463db567120f0e4ff5996f6562c654900a3ea419"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/img2img_upscale_section.dart: FileTooLong \u2014 609 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 109 over it, 1.22\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/presentation/screens/generation/widgets/img2img_upscale_section.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57c2f681b3559f26db54c329cea9fde5c7bd21557e533070c403203cd595f19"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _QueueManagementPageState: ClassTooLong \u2014 486 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 86 over it, 1.22\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/presentation/widgets/queue/queue_management_page.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"45799f63780075ae8e00512d5aadc63f7ba4f3913e88d45d65d60e65c07903b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: storage/local_storage_service.dart: FileTooLong \u2014 606 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: LocalStorageService (13-1230). The bar is 500 significant lines; this is 106 over it, 1.21\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/core/storage/local_storage_service.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37b53d84183c9a26a2201d10e00dbc6cadd4fc850cc42c9a9e43757d8a6a33f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/precise_reference_panel.dart: FileTooLong \u2014 605 significant lines (blank, comment-only and punctuation-only lines excluded), about 65% of them inside a single declaration: _PreciseReferencePanelState (53-619). The bar is 500 significant lines; this is 105 over it, 1.21\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/presentation/screens/generation/widgets/precise_reference_panel.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bf3cd9429c87b3bca7e0a0e94be8b6f3013078b5b3404d5d43e08a5761fba6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VibeImportService._importParsedSources: MethodTooLong \u2014 _importParsedSources runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/vibe_import_service.dart"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"7931937573430346e86739f5ba34bea303cff6f58586e827e7ee8e74fa8cd054"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentChatMessages.build: MethodTooLong \u2014 build runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/widgets/agent_chat_messages.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f39bbfe964caa6163cc80b4684b384cd8a13faa9f49f8b7620cd090c32c161"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/entry_add_dialog.dart: FileTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: _EntryAddDialogState (130-875). The bar is 500 significant lines; this is 104 over it, 1.21\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/presentation/screens/tag_library_page/widgets/entry_add_dialog.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21f3811c2484edfdf6c93918fad05efb73055a76092db285b9396c9008b68a2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FocusedInpaintUtils: ClassTooLong \u2014 483 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 83 over it, 1.21\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/core/utils/focused_inpaint_utils.dart"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bfdaf8b1e3087a2d04d7cfbfb45e2046fc8a19c0de50654bb90bedc090e93a5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _PromptAssistantOverlayState: ClassTooLong \u2014 482 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 82 over it, 1.21\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/presentation/prompt_assistant/widgets/prompt_assistant_overlay.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6acfde7bc72f69e6960b614eff72da09578bb89d55502f499035e586c4724e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OnlineGalleryScrollPrefetchCoordinator: ClassTooLong \u2014 482 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 82 over it, 1.21\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/presentation/screens/online_gallery/online_gallery_scroll_prefetch_coordinator.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af12c456bd7bbc15bff824abe00327610d34fa4bc21d41ee6d44552cf07f604"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TagLibraryPageNotifier: ClassTooLong \u2014 481 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods. The bar is 400 significant lines; this is 81 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/presentation/providers/tag_library_page_provider.dart"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"da59f425b0d9f97b202639fc18ba1c63a0e5c6404a2c39e00804ad59ed30bf9e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AppLogger: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 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/core/utils/app_logger.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b896ac34b8ea8050951e626cb210e9bce0744c1f64a4eb3d6a39b926025a3e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RandomPromptGenerator: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 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/data/services/random_prompt_generator.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b5ed2fecb8ec28f3ba5267539072c4db758a92dd2c21d993e50c1f74467742"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DlssController: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 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/presentation/providers/dlss_provider.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"694c611a4d686f5b95010205685f3a39c2dbd1e12691990d015113fb479f61d6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsonlSessionStorage._decodeRecord: MethodTooLong \u2014 _decodeRecord runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/harness/session/jsonl/session_jsonl_storage.dart"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3469d5463f0501c1867b2ab11e60ae5d3f7f1c4a32b4f1b126aac7ff597f90b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/color_picker_tool.dart: FileTooLong \u2014 599 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 99 over it, 1.20\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/presentation/widgets/image_editor/tools/color_picker_tool.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"894447beac4de6b897df514b099df696cf0569a98973e7e7eddbea4b4a9b2b7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/account_profile_sheet.dart: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: _AccountProfileBottomSheetState (69-880). The bar is 500 significant lines; this is 96 over it, 1.19\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/presentation/widgets/settings/account_profile_sheet.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3dd9e5f4fd29dc006c620e7a060c9decea31870d8bda1b73a444efbdbfe157"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DanbooruApiService: ClassTooLong \u2014 476 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 76 over it, 1.19\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/data/datasources/remote/danbooru_api_service.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a058cd6be520b34be1c60b9c46f79aa6b7ce7b51857ada1f039a6bdb490636"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BackendHttp.request: MethodTooLong \u2014 request runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\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/core/cloud_sync/backend/backend_http.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"432f919bc8e484e8d199ab067ba30f5a24165f56c6fe5d8ad727096f33a0c6d3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VerifiedResumableDownloader._downloadToPartFile: MethodTooLong \u2014 _downloadToPartFile runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\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/core/services/verified_resumable_downloader.dart"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"586693819dc24b143f31427d88f80805d43882bfc029c153a88ebdcead444f39"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _TransformSection.build: MethodTooLong \u2014 build runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\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/presentation/widgets/image_editor/tools/move_tool_panel.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"075aa9bf932c921ebc2c37d452081f201359299132a742f89e3f632d2b96ac09"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: comfyui/comfyui_provider.dart: FileTooLong \u2014 594 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 94 over it, 1.19\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/presentation/providers/comfyui/comfyui_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"908155340863ec360b32b0cf013b260fc960612dea9dabc80888585c0251e17c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: QueueExecutionNotifier: ClassTooLong \u2014 473 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 73 over it, 1.18\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/presentation/providers/queue_execution_provider.dart"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"22848af1a186aeabe353623c31118389d8625a6b5f42956d19b2b4798e505a9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gallery/gallery_album_tree_view.dart: FileTooLong \u2014 590 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 90 over it, 1.18\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/presentation/widgets/gallery/gallery_album_tree_view.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7481c6f9948c333a4a09e2a630c3dfcac298fce5e5f607fe5c02b0b6d8f6d99"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImageComparisonToolbar.build: MethodTooLong \u2014 build runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\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/presentation/widgets/common/image_comparison_toolbar.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08c9ae09839bbc3bb440ed72884bcf154dc525146668e010f8d69256206517d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _GelbooruCredentialsDialogState.build: MethodTooLong \u2014 build runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\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/presentation/widgets/gelbooru_credentials_dialog.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e484b363a7a58abf4264503b2412099f11908e13141694731c287a7269dfec1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: online_gallery/online_gallery_content.dart: FileTooLong \u2014 589 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: _OnlineGalleryContentPresenter (55-744). The bar is 500 significant lines; this is 89 over it, 1.18\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/presentation/screens/online_gallery/online_gallery_content.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e7dc3c7e7c3a68c81ce3d25532dd47ae6e201a65d60ae23988c41d158d8028"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: online_gallery_toolbar/online_gallery_toolbar.dart: FileTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 88 over it, 1.18\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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43245ac529aba82eb1cdc56f6a82bc8d038a2f84180b164b4b87be42b661a5e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/vibe_detail_viewer.dart: FileTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded), about 74% of them inside a single declaration: _VibeDetailViewerState (231-869). The bar is 500 significant lines; this is 88 over it, 1.18\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/presentation/screens/vibe_library/widgets/vibe_detail_viewer.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91997f3f874609afb72d658635f2815cae914b84e690d5ccaa9d05db79dc125"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: image_detail/image_detail_viewer.dart: FileTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: _ImageDetailViewerState (197-866). The bar is 500 significant lines; this is 88 over it, 1.18\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/presentation/widgets/common/image_detail/image_detail_viewer.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c815ebf6a2539bd7fa67abe6d06fdf34f4fdbef01e85d378900c539d344143e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SyncCoordinator: ClassTooLong \u2014 470 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 70 over it, 1.18\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/core/cloud_sync/coordinator.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b64910a29ac4af55e5653deaface36f7be21165d8fc7f68fcd6b93c89e2700"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: online_gallery/online_gallery_detail_launcher.dart: FileTooLong \u2014 585 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: OnlineGalleryDetailLauncher (39-734). The bar is 500 significant lines; this is 85 over it, 1.17\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/presentation/screens/online_gallery/online_gallery_detail_launcher.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5364067024337e794ff76a04579e2db76f7b37e4200d711a71db9b1ddb74c940"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentChatNotifier._init: MethodTooLong \u2014 _init runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/providers/agent_chat_notifier.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a0a7b67323c6bbeaae3d9df41402c9907c202ac2f913f17eb9c033982fe66f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LocalOnnxModelService: ClassTooLong \u2014 467 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 67 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/data/services/local_onnx_model_service.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a684157f2b3c9823af132f23d998d6a02556f21f816929e48e469db397ab6c5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JsonlSessionStorage: 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/core/agent/harness/session/jsonl/session_jsonl_storage.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2badd067d478609b6c26d97b6896455bc2a2dc65fdf9f3100dfe9d4490470b59"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: McpStdioProxy: 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/core/mcp/cli/mcp_stdio_proxy.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0444c8a3e12b32528b4661a70662f466d25ff6a7801323b1b421c8d2e08f2e37"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ReplicationQueueNotifier: 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/presentation/providers/replication_queue_provider.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4825b984cef4ed8652fbc0fef79b46cf918c5808c3faf8eec6a9bc32d72ec335"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _VibeSelectorDialogState: 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/presentation/screens/vibe_library/widgets/vibe_selector_dialog.dart"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa571aec6ab7066fada8c9380ef8ce6b65b78d528e8f0ca9870665f204d60b1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CanvasController: 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/presentation/widgets/image_editor/core/canvas_controller.dart"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd06d03980929829c6d1bdb2d2056253f23958dc28f31fda5aa491f445451d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: jsonl/session_jsonl_storage.dart: FileTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: JsonlSessionStorage (19-757). The bar is 500 significant lines; this is 83 over it, 1.17\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/core/agent/harness/session/jsonl/session_jsonl_storage.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80522f6557f0abc2252c0d4af2133d2d736a87f1b0b7cbf686ff062116750b90"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/generation_preparation_service.dart: FileTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: GenerationPreparationService (41-766). The bar is 500 significant lines; this is 83 over it, 1.17\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/presentation/agent_chat/services/generation_preparation_service.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"316d71ae3ce3f8edfa41933ed7053a619027479455e0cdae89f72d59c6ab8749"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: panels/layer_panel.dart: FileTooLong \u2014 582 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 82 over it, 1.16\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/presentation/widgets/image_editor/widgets/panels/layer_panel.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d184fe32a1a5f0a3e8b1b0b63faf452bb8cd7aa96d89dd21dab3d92a57cbe51"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cloud_sync/cloud_sync_benchmark.dart: FileTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 81 over it, 1.16\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":"tool/cloud_sync/cloud_sync_benchmark.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae96720a0d8b2329fc02ec8c004d7ef52f0553977d23eb9c18968222e103b53"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompletionOverlayHeader.build: MethodTooLong \u2014 build 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/presentation/widgets/autocomplete/completion_overlay_header.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f6253f1c2322ed128e90c19a0f342338b368c8acdccb49d09dac629fd6145f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UpdateNoticeBanner.build: MethodTooLong \u2014 build 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/presentation/widgets/common/update_notice_banner.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"54191ff599a89104051ac7c5a07894e9e9ddedf3aa55d720590bbd1b6460b8f3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GalleryDetailDialogView.build: MethodTooLong \u2014 build 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/presentation/widgets/online_gallery/gallery_detail_dialog_view.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0a0717f082d6b95138f1a67290bec3973b6f5d334a655542df9a4f5685c880"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: prompt/danbooru_tag_group_tree.dart: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: DanbooruTagGroupTree (44-779). The bar is 500 significant lines; this is 78 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/models/prompt/danbooru_tag_group_tree.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64890cb2a4ca9aae10cd75e1782189766e035bcf78a43f44a850d2cbcd7e6d03"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _WorkflowImportWizardState: ClassTooLong \u2014 461 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 61 over it, 1.15\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/presentation/screens/settings/widgets/workflow_import_wizard.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb79f5b3f2cd5910b82a95e072048a36f6ab084995adff3605bad05c5c96e0f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: common/app_toast.dart: FileTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 75 over it, 1.15\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/presentation/widgets/common/app_toast.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea76186eab37305d193f542a4b661734267b65b5fe075f3f66b13154a124c9c3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CloudSyncContentSelectionBodyState.build: MethodTooLong \u2014 build runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\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/presentation/screens/cloud_sync/cloud_sync_content_selection_dialog.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8de82c0f1999890176efacac3ea4c85b0e1b39acb62afe9dfd7660d1a2bb9fb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PromptInputFooter.build: MethodTooLong \u2014 build runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\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/presentation/screens/generation/widgets/prompt_input_footer.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae28f650e4ea73668c55a980cb7eb3e5e4d7f60da5c66ce7ba547c04bf2e18da"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OnlineGalleryGrid.build: MethodTooLong \u2014 build runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/online_gallery/online_gallery_grid.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c00f599cbb95ec8c6889d83911e192e9a2ac09eb2a267b7daa92aed8b89b7bd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _EntryListItemState._buildActions: MethodTooLong \u2014 _buildActions runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/tag_library_page/widgets/entry_list_item.dart"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e90d726809836ca3dbbff5bf274ef9ee706955d9d33d4e65138d39f7d079165"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _DanbooruLoginDialogState.build: MethodTooLong \u2014 build runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/danbooru_login_dialog.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de1c747278dfbcb66c07bb129ba8d45dafe018bae7c17ee6e3774cd923b30d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/prompt_assistant_overlay.dart: FileTooLong \u2014 568 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: _PromptAssistantOverlayState (107-752). The bar is 500 significant lines; this is 68 over it, 1.14\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/presentation/prompt_assistant/widgets/prompt_assistant_overlay.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f8ffe91d52f0c900362c845d6839cad884b1cc30e52a087064900df3497200"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CloudSyncOperationStorage: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/cloud_sync/cloud_sync_operation_storage.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb62663b00302fca041960cd302ceaedfaa4cf3d206c453d3c8987e293170c34"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RandomPreset: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/models/prompt/random_preset.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"13925497f5fa581bd89523c36363c9f6fcc1a660a333a80b40c5dd130ea16abc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HiveVibeLibraryRepository: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/vibe_library_hive_repository.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"550696f6851c908cc40aef52f7c42b05cb953216cbfb47af05a0a27d160812b0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AgentChatSessionController: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/agent_chat_session_controller.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"085630f4c78fabab480d0726b1267005be92bcc6b09156e9854806a93f52521c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TagLibraryPageNotifier: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/tag_library_page_provider.dart"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d656b1bfeb72a45d22a7a824c323fb908067e39779354ef67f1d2405d86e626c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _MosaicEditorScreenState: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/mosaic/mosaic_editor_screen.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82d79fc064697976a46e3de830efbfdfa34df329bf19ca5bfb2f9423c72caa1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _PreciseRefLibraryScreenState: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/precise_ref_library/precise_ref_library_screen.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"987f2d24403a9ab4cb66780a99c10e2da61345478da45663a7055201e8467845"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _TagLibraryPageScreenState: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/tag_library_page/tag_library_page_screen.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0841dd999fd3150a23900b18f4ac7c600e1642a5e58d4e9c0da25a3bca4b2f10"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TransformParams: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/image_editor/core/transform_geometry.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a7a51b4204ff8c91bf712ae5bb34e02ea1cd7603c211506eafa3f027817e9a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _TagEditorViewState: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/tag_editor_view.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc447cbe10cbeb24d3ca9ba5b222fffb76ff42151caaaa4d51c201ae801816d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WebDavOperationInventory.findExisting: MethodTooLong \u2014 findExisting runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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/core/cloud_sync/backend/webdav_operation_inventory.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ae31aaaf935be3087dc139a00ff1cbd60450fb28138501568216142f11dad6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _EnhancePanelState.build: MethodTooLong \u2014 build runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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/presentation/screens/generation/widgets/img2img_adjustment_section.dart"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab430964b260e4308167ef3033155912c46835e52ace93c4c175fc8bf4334485"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _OnlineGalleryToolbarPresenter._buildToolbar: MethodTooLong \u2014 _buildToolbar runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_feature.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"66157b53b4fca06e6db333214c5562a6525347cf705bcbc787cf3c49d54a17a3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LocalGalleryContentView.build: MethodTooLong \u2014 build runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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/presentation/widgets/gallery/gallery_content_view.dart"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"5908a97bf7ce3423062cc1d8e784831a9cc1647bd6f0167b9c1d3163bce40511"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OnlineGalleryToolbarSourceControls: ClassTooLong \u2014 450 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods. The bar is 400 significant lines; this is 50 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_source_controls.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4a59480ce3b434a5fb0f2a751d8ae652dc72caadc73794c053538328057879"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: provider_adapters/openai_chat_completions_adapter.dart: FileTooLong \u2014 562 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: OpenAiChatCompletionsAdapter (12-770). The bar is 500 significant lines; this is 62 over it, 1.12\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/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7459527bc533966028420db67a14e9d57de563d295c1661ab4924fb49c461d5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generation/generation_params_notifier.dart: FileTooLong \u2014 562 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: GenerationParamsNotifier (33-986). The bar is 500 significant lines; this is 62 over it, 1.12\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/presentation/providers/generation/generation_params_notifier.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"360409274874f54069758411c445bd15bb59b7fc0bcea30d0c10dc73852efa1a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LayerManager: ClassTooLong \u2014 449 significant lines (blank, comment-only and punctuation-only lines excluded), 65 methods. The bar is 400 significant lines; this is 49 over it, 1.12\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/presentation/widgets/image_editor/layers/layer_manager.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"70efbd4f53fee1c207f2e52b1b04820d29e949319df308522f4cdded205a5ff0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _ImageDetailViewerState: ClassTooLong \u2014 448 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 48 over it, 1.12\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/presentation/widgets/common/image_detail/image_detail_viewer.dart"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"62923ece985c2954aa3a104ca7797918d67f769371983bda90be1b8bc2e99fff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PromptInputEditor.build: MethodTooLong \u2014 build runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\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/presentation/screens/generation/widgets/prompt_input_editor.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31553089a830992a9864a7c14818495493f98486798463c9ed085e139c6dd18"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VibeExportEmbedImageOptionCard.build: MethodTooLong \u2014 build runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\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/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_embed_and_encoding_sections.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c22a9e5cb3ddb043bbc5540f506072b78453ff461d8db0221f5a59c9862a477"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mosaic/mosaic_editor_canvas.dart: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 58 over it, 1.12\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/presentation/screens/mosaic/mosaic_editor_canvas.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5302c31709ffc2563365b43e0915d8dd3da72ccad2bd83f5c2cdf328049da574"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/import_dialog.dart: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: _ImportDialogState (57-779). The bar is 500 significant lines; this is 58 over it, 1.12\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/presentation/screens/tag_library_page/widgets/import_dialog.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16889500b016641c385aafb5e69cf9ba9bb2f7fa105f534ee103be6653388289"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: datasources/gallery_image_repository.dart: FileTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: SqliteGalleryImageRepository (59-786). The bar is 500 significant lines; this is 56 over it, 1.11\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/core/database/datasources/gallery_image_repository.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad3124def029b9e7b4487d9356baa27b0d846825284f62a62ae1b6dbd4b80ee"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LocalGalleryScreenController: ClassTooLong \u2014 444 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 44 over it, 1.11\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/presentation/screens/local_gallery/local_gallery_screen_controller.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"937ab6a137dec21e83aff2400318b7250aec4ab646e1d739bf6e88a7a91685bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/update_installer_service.dart: FileTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded), about 79% of them inside a single declaration: UpdateInstallerService (143-757). The bar is 500 significant lines; this is 55 over it, 1.11\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/core/services/update_installer_service.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40552bf0f53583d2cbaf2a8b2488ad66ad5cfb37ed54726a1eee1ff55a8415d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/image_share_sanitizer.dart: FileTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 55 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/image_share_sanitizer.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee9864d8083ba2acdcb58577760777128a18a04156741780a5ea2f7e23ac1d9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _LocalImageHoverPreviewCardState._buildPreview: MethodTooLong \u2014 _buildPreview runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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/presentation/widgets/gallery/local_image_hover_preview.dart"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fcae46f80b34a27ca038a0b45e1fe43e8f7b267ce0961e34c6335b80a7c9f9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CloudSyncApplicationService: ClassTooLong \u2014 442 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 42 over it, 1.11\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/presentation/providers/cloud_sync/cloud_sync_application_service.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5737e1e69174f197f5ad610753087ca3cebafc65952ff333e69ed6539f0c9ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/prompt_assistant_service.dart: FileTooLong \u2014 552 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: PromptAssistantService (61-716). The bar is 500 significant lines; this is 52 over it, 1.10\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/presentation/prompt_assistant/services/prompt_assistant_service.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3139a0dfabf916dc8c55d5260cfbce81f3baf53148faf61384d335b450b98ae"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OleDataInspector: TooManyMethods \u2014 744 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/ole_drag_inspector/windows/Program.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"167db33444ef58e7378cb351183d2863b5ee11ce1cffbabb14f96a68f341d7e7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OneDriveCloudSyncBackend: 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/core/cloud_sync/backend/onedrive_cloud_sync_backend.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9636731cf5c8bcef3f7b349537aa24c3f0ea0242a950dedf0bff99bf7ddf1290"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InpaintDraftFileRepository: 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/data/services/inpaint_draft_file_repository.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db46a9f440b020f713d1462d2742858efbf0829a712c7ca2a13f0ad4bb93756"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CloudSyncApplicationService: 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/presentation/providers/cloud_sync/cloud_sync_application_service.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"703c67ef4e72bc6f098dc847d2cffdfa30191ba3a12f5f203bafc5afa6aa3e9a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MobileGenerationController: 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/presentation/screens/generation/mobile_generation_controller.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d13a9f2211bf8646cf52077dcfbfd6be7f49d384ae8438d3dae2ac81e56b0b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LocalGalleryScreenController: 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/presentation/screens/local_gallery/local_gallery_screen_controller.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55e252ce5038d1c095f543e9042ac0ad55a08f48f80f093b99222b61128f4bb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DroppedFileReader: 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/presentation/utils/dropped_file_reader.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09cf742f77f31bf7e1d866b7d7462c82fdb0a542156c54cd43ff61c11e1b5c8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorFrameController: 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/presentation/widgets/image_editor/frame/editor_frame_controller.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"624509d7413fc16f94c8f8535dfea2dccd734f4945a8ed48b45a041d650bf223"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CloneStampTool: 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/presentation/widgets/image_editor/tools/clone_stamp_tool.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f21a016de8464a40ea8dd773c3612c81a4fbeb486ec01d747839ed3fd0c58eb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AgentChatComposerState._queuedMessages: MethodTooLong \u2014 _queuedMessages 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/presentation/agent_chat/widgets/agent_chat_composer.dart"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ededd643a7dd63f929aff000a5366ac8703115d30a0c4bf9e2bb75c9f426b69"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImageWorkflowLauncher._openEditor: MethodTooLong \u2014 _openEditor 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/presentation/services/image_workflow_launcher.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eab8f4430677e3a241bc8a434fb042366d037a35421a985f9b7f24bfbf139e0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BulkActionBar.build: MethodTooLong \u2014 build 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/presentation/widgets/bulk_action_bar.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e167bca32d5c4d9f991416c54ed436d21fe4afcd7f9e99adeb5b06075d14a7f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FixedTagsDialogHeader.build: MethodTooLong \u2014 build 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/presentation/widgets/prompt/fixed_tags_dialog_chrome.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"730ebb93d02119e0cd939c77c7abedc7f1c34362ac848fb08e5d08d0ed0965d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: online_gallery_toolbar/online_gallery_toolbar_source_controls.dart: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: OnlineGalleryToolbarSourceControls (27-633). The bar is 500 significant lines; this is 49 over it, 1.10\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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_source_controls.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3ea7a35b9793cf5c486a83a849adb59b6e9d878e67aea0a6b2524f16cb5de9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OnlineGalleryNotifier: ClassTooLong \u2014 439 significant lines (blank, comment-only and punctuation-only lines excluded), 77 methods. The bar is 400 significant lines; this is 39 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/presentation/providers/online_gallery_provider.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1056d3083a83690f2fca62d000fda2e2e1f1b014499b9aca8ca8cf5f371b2f18"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NaiSyntaxController: ClassTooLong \u2014 439 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 39 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/presentation/widgets/prompt/nai_syntax_controller.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e183a7cc2397c2c0899d847258f06ce2ca094ba8b19c272e3aa2647050491b1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ImageMetadataContainerCodec: ClassTooLong \u2014 439 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 39 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/data/services/metadata/image_metadata_container_codec.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2904ea8537aa98523b56d0bc0d948606d395ab5f7700ce97516c9a9bc0e681c3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UpdateInstallerService: ClassTooLong \u2014 439 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 39 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/core/services/update_installer_service.dart"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"3944da8d6c9ad4bda0922bc62bfae1628313e9f094d493e939d438099a263554"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WebDavCloudSyncBackend: ClassTooLong \u2014 437 significant lines (blank, comment-only and punctuation-only lines excluded), 38 methods. The bar is 400 significant lines; this is 37 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/core/cloud_sync/backend/webdav_cloud_sync_backend.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcc4be7732a1dd48510cc34d2c221260185c7ac8a4c713f69b8f0f3175866f5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _VibeDetailViewerState: ClassTooLong \u2014 437 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods. The bar is 400 significant lines; this is 37 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/presentation/screens/vibe_library/widgets/vibe_detail_viewer.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"00efe0da5cb75fb42296b8cf91a0333947b1991b4d05292a9734c92537bd770b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GalleryStreamScanner: ClassTooLong \u2014 436 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 36 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/data/services/gallery/gallery_stream_scanner.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2dff00a916a2c2e7a91817f68a1b1b8a6708203d318a1ab1dd1942a1d951ee8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VibeImportController: ClassTooLong \u2014 436 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 36 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/presentation/screens/vibe_library/vibe_import_controller.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"deeca3468548b3c2b579c79eeaa3f08bdd3fe757fff647a4ee51e609220022a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: common/pagination_bar.dart: FileTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: _PaginationBarState (59-794). The bar is 500 significant lines; this is 45 over it, 1.09\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/presentation/widgets/common/pagination_bar.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8196b1ade6a041f3a9f93249b83615dd0319b14189a0cebe143fdf66a546841d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InpaintMaskUtils.prepareNovelAiInpaintMaskArtifacts: MethodTooLong \u2014 prepareNovelAiInpaintMaskArtifacts 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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b51017922ea9d16cb827fd0b4c963ef0063b2960099d798937891633c10175"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NaiGenerationTransport.buildGenerationMultipart: MethodTooLong \u2014 buildGenerationMultipart 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/data/datasources/remote/nai_generation_transport.dart"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"06664b0a8b52a8baf908aae29e46a8eb4718a5423f90bcaa225eff79ad867da5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GenerationQueueTaskService.queueTask: MethodTooLong \u2014 queueTask 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/presentation/agent_chat/services/generation_queue_task_service.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f5166ed7966cdd05f06fce5e404a93ae17c60220a51a983fc83e18040cfbfe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _PromptAssistantOverlayState._showMenu: MethodTooLong \u2014 _showMenu 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/presentation/prompt_assistant/widgets/prompt_assistant_overlay.dart"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf665ca54648bb127daa8de760292303d3900cadd03e3216a5d39fa5ae7c34a4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _VibeBundleImportDialogState._buildVibeGridCard: MethodTooLong \u2014 _buildVibeGridCard 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/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7a69abd6ca7310d8064782a9dc65b110914c115fd8ab752b52fa67a60780dd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _LayerTileState._showContextMenu: MethodTooLong \u2014 _showContextMenu 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/presentation/widgets/image_editor/widgets/panels/layer_panel.dart"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bed95f35b89c2e7087b5b6cd75feccb7d8ee91ffe089acde6d56723b0a5ae1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: random_manager/add_tag_group_dialog.dart: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded), about 64% of them inside a single declaration: _AddTagGroupDialogState (84-570). The bar is 500 significant lines; this is 44 over it, 1.09\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/presentation/widgets/prompt/random_manager/add_tag_group_dialog.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0589244f603414b30427023986f09791432f91ce6671385ed5a7f40d1f06b845"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _ReversePromptPanelState: ClassTooLong \u2014 432 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 32 over it, 1.08\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/presentation/screens/generation/widgets/reverse_prompt_panel.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9cf57558916e147553e53b0fb7a8511d90a76f7cc48cedbb056c80056fe4e3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HiveStorageHelper._migrateFromOldLocation: MethodTooLong \u2014 _migrateFromOldLocation runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/hive_storage_helper.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"514e9741fb36ee09b1865310ceafa9107d06fd1b70d8c00838dd1161f4296004"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DlssWorker.run: MethodTooLong \u2014 run runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/dlss/dlss_worker.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e3ef2b5cb4d8600bd57491f23462563f87a47a28d81d74f55a67939a73edc7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _StackedAreaChartState._buildChartData: MethodTooLong \u2014 _buildChartData runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/statistics/widgets/charts/stacked_area_chart.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3791c97a171f87bbfc49345c3908fa6c138bffee807edf001f720928687b5de0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _RowEditorPanelState.build: MethodTooLong \u2014 build runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/character/inline_character_row.dart"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a121b3de7c732d631a338417e7335c104795ae39d2d765b5921a497c67062d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _DiscordShareDialogState._buildShareForm: MethodTooLong \u2014 _buildShareForm runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/discord_share/discord_share_dialog.dart"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea3569136987c9bdca6837758abc7eef26b60c46b72db1aed2417c3496b70be"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkspaceDesktopMenuBar.build: MethodTooLong \u2014 build runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/image_editor/workspace/workspace_desktop_layout.dart"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"db238be9341c33bb6748113aacff6f5194b22e9c033b5179f855c2242a9eb2a0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GalleryDetailInfoPanel._buildCodexOverview: MethodTooLong \u2014 _buildCodexOverview runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/online_gallery/gallery_detail_info_panel.dart"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"b927c61344cf5af0f89764af5209f77299b71fad1084f4e09f27cd67880779ca"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CloudSyncOperationStorage: ClassTooLong \u2014 431 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods. The bar is 400 significant lines; this is 31 over it, 1.08\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/data/cloud_sync/cloud_sync_operation_storage.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"524267e3e80fa625b1f220e6bb4d893e87c9cc8e4100770e552427d898703ccb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: online_gallery/blacklist_settings_panel.dart: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded), about 64% of them inside a single declaration: _OnlineGalleryBlacklistSettingsPanelState (36-510). The bar is 500 significant lines; this is 38 over it, 1.08\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/presentation/widgets/online_gallery/blacklist_settings_panel.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29682ab564191ccd743e044172dd1e28baaaad0209d08e4a1ac0314b54b2ab11"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/onedrive_api_client.dart: FileTooLong \u2014 537 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: OneDriveApiClient (44-704). The bar is 500 significant lines; this is 37 over it, 1.07\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/core/cloud_sync/backend/onedrive_api_client.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ed967762ce34354c8360d0877d75e40b735e74c6cafd01934909e8542436b2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EditorState: ClassTooLong \u2014 429 significant lines (blank, comment-only and punctuation-only lines excluded), 97 methods. The bar is 400 significant lines; this is 29 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/presentation/widgets/image_editor/core/editor_state.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e43eac653e71d85b93de96f2cec460c9913ffcccfab800d06a340402773aa2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ImageGenerationCoordinator: ClassTooLong \u2014 429 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 29 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/presentation/providers/generation/image_generation_coordinator.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a4fa68587afbb1bf35d3d0bc7e912addde7788ace0740cb58afd9376398fbc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: autocomplete/completion_orchestrator.dart: FileTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: CompletionOrchestrator (11-683). The bar is 500 significant lines; this is 35 over it, 1.07\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/core/autocomplete/completion_orchestrator.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cf3d73639426a507ac233c945771d47cd0211108612d63871ef6bac2286bff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ShortcutBindingEditorState._buildFullEditor: MethodTooLong \u2014 _buildFullEditor runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/shortcuts/shortcut_binding_editor.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec49f90798edc27b7490e2ad500965be16f2e27ce351a17b812a45b7ea566b63"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InpaintDraftFileRepository: ClassTooLong \u2014 427 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 27 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/data/services/inpaint_draft_file_repository.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"01abf2884f5d2f013133b138361b45a1f17f0559ff79bbde54db6144f1e37268"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GalleryItem: 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/data/models/online_gallery/gallery_item.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c17d8de19790184b56669b774dce003eafec4043ce5a4abbda1125946e160bf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GalleryCategoryRepository: 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/data/repositories/gallery_category_repository.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"264c76b4e61202e2c2db782d8d31c7dd157fe502394e85c29086817e8dc124f8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ManualInpaintToolbox: 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/presentation/agent_chat/services/manual_inpaint_toolbox.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6aacaabb69b4b49f29842f41cade41eb2aabe564f3e1e909ee1e495ae71552"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: QueueExecutionNotifier: 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/presentation/providers/queue_execution_provider.dart"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a03d9ca919efe4d4340fc7ddbef8dd2677f22112326cb32c3e3443ec50eec79"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ColorPickerTool: 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/presentation/widgets/image_editor/tools/color_picker_tool.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf5f0bf75d6d3059bbd9c1607779991a42f77c0199c5f347e60da9e1ddf57fa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NaiSyntaxController: 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/presentation/widgets/prompt/nai_syntax_controller.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f188d4f97f03283d0055bdc8e9fb0b18cb259dd206820a7f6a2249943adb6f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: prompt/nai_syntax_controller.dart: FileTooLong \u2014 533 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: NaiSyntaxController (10-649). The bar is 500 significant lines; this is 33 over it, 1.07\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/presentation/widgets/prompt/nai_syntax_controller.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b51cbb4df9c3d8fd5626248497547a9fed2e3d2bfb63a15cdcd8dd5968893b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gallery/gallery_stream_scanner.dart: FileTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: GalleryStreamScanner (106-819). The bar is 500 significant lines; this is 32 over it, 1.06\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/data/services/gallery/gallery_stream_scanner.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7081c09d0e508f823845db9dad3f2c38fff47b95ec9aa9b8167d2705fe708ba1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VibeDetailParamPanel: ClassTooLong \u2014 424 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 24 over it, 1.06\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/presentation/screens/vibe_library/widgets/vibe_detail/vibe_detail_param_panel.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f1b0a44cbaf9a8cbb9524b883775fe3e51c5c181e1f5fc183618102c150a8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: request_builders/nai_image_request_builder.dart: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: NAIImageRequestBuilder (55-741). The bar is 500 significant lines; this is 30 over it, 1.06\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/core/network/request_builders/nai_image_request_builder.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bd037366ddde1bb8e6d71667a425af4539f5ff21a88f41fa495408e3178d03"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompletionOrchestrator.query: MethodTooLong \u2014 query 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/core/autocomplete/completion_orchestrator.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61c0b39da9cab37b3b47c59d1324a0fe3a6d3d8b61082aef17d73335a21a849"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _WeekdayBarChartState._buildBarChart: MethodTooLong \u2014 _buildBarChart 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/presentation/screens/statistics/widgets/charts/weekday_bar_chart.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a668efaa9362a2671a904c7c2db1f031221e3c1fe7d37377016a7d23c942a0a6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CategoryItemState.build: MethodTooLong \u2014 build 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/presentation/screens/tag_library_page/widgets/category_tree_view.dart"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"4150763748ed42dac801044c58fd52367d982ca4bd39ee17fd74bb723989dff5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImageDestinationDialog._buildVibeDetectedCard: MethodTooLong \u2014 _buildVibeDetectedCard 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/presentation/widgets/drop/image_destination_dialog.dart"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"1926175ef04b75a606c01687c6cf3719d70ffb1aaca2cd3db6671bbddb3373d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/gallery_filter_panel.dart: FileTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: _GalleryFilterPanelState (27-710). The bar is 500 significant lines; this is 29 over it, 1.06\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/presentation/widgets/gallery_filter_panel.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55387b2dd1e9e19d8522beaba77e0e775063b20707f9989cd0c58e0daccd7df8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: McpStdioProxy: ClassTooLong \u2014 423 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 400 significant lines; this is 23 over it, 1.06\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/core/mcp/cli/mcp_stdio_proxy.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"63309a7da507e52272096aff755009f9634628cef84a23eb7622a522684e16a7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OnlineGalleryRandomLoaderService: ClassTooLong \u2014 423 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 23 over it, 1.06\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/presentation/providers/online_gallery_random_loader_service.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2884524add14e2a6bccfd5dfd9eda4fd85465156d3e95df7082916f4900c1c5d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _VibeLibraryScreenState: ClassTooLong \u2014 422 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 22 over it, 1.06\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/presentation/screens/vibe_library/vibe_library_screen.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0cf15e2892cf624fb097e107d7c3d21218071538f913b47ae14c7fd5e7b59d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vibe_library/vibe_import_controller.dart: FileTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: VibeImportController (43-616). The bar is 500 significant lines; this is 26 over it, 1.05\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/presentation/screens/vibe_library/vibe_import_controller.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c8ec8ebf115028d35d13024a658a55ed1fe619539203a1046e037cf1ed008f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WindowsUpdateScript.buildPortableScript: MethodTooLong \u2014 buildPortableScript runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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/core/services/windows_update_script.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3270dfa4341c7e2f49b0c42e1f2b342331998a814f8e11f4f2acaf4ab74717e7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InpaintMaskUtils._officialWorkerBlur: MethodTooLong \u2014 _officialWorkerBlur runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"db07333d000cb4afe8eb0e0113c6f2f40ce5d5f7fda9a1bc39661e78bb876a26"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GalleryStreamScanner.startScanning: MethodTooLong \u2014 startScanning runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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/data/services/gallery/gallery_stream_scanner.dart"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda4f5a89d51c7ee943c2b111ce1b70b42e8ecd35e966c818f4f451e22e3a671"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentChatApprovalSurface.build: MethodTooLong \u2014 build runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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/presentation/agent_chat/widgets/agent_chat_shared_widgets.dart"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"3281f74149d9aaf542ddf80f3f75ff4e0fddeabfaa4fdc312f006708b2ee0f96"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AuthRecoveryBanner.build: MethodTooLong \u2014 build runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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/presentation/router/global_status_banners.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b212bba8bc5a6a6316f49418b869d5aa54f1076e899479264ad5890a8e6694ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _PreciseRefEntryEditDialogState.build: MethodTooLong \u2014 build runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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/presentation/screens/precise_ref_library/widgets/precise_ref_entry_edit_dialog.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5d530fd8666b40847b6a41c807c7e5c5ebdb04bb7a260b8cd8c43a06c51056"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _VibeLibraryContentViewState._sendEntryToGenerationWithParams: MethodTooLong \u2014 _sendEntryToGenerationWithParams runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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/presentation/screens/vibe_library/widgets/vibe_library_content_view.dart"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"449601406b98dde9b6c964169ece3ce824355904902596028267b1591b2c3661"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _PromptSelectionCardState.build: MethodTooLong \u2014 build runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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/presentation/widgets/drop/image_destination_dialog.dart"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64eca1af6ade23e744433e02628d7dd944698ca70cd47ec15d6720881b0ac73"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/local_onnx_model_service.dart: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: LocalOnnxModelService (52-717). The bar is 500 significant lines; this is 24 over it, 1.05\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/data/services/local_onnx_model_service.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea16ffd823ae35f23ce361656f23ca5d06bcf4eb6167b48d2c9cd96198d2445"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InputHandler: ClassTooLong \u2014 419 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 19 over it, 1.05\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/presentation/widgets/image_editor/core/input_handler.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"677d83ccf85fe994d5f0ab1afacd40c4777b338e7f4a00a6c2e7901e999f11ba"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _VibeCardState: ClassTooLong \u2014 419 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 19 over it, 1.05\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/presentation/screens/generation/widgets/vibe_card.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf8cd92c8ec842937bccbfa91d8c67fbfebb4e5ef4cbbc2af41c021fade643b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OnlineGalleryScreenController: ClassTooLong \u2014 418 significant lines (blank, comment-only and punctuation-only lines excluded), 43 methods. The bar is 400 significant lines; this is 18 over it, 1.05\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/presentation/screens/online_gallery/online_gallery_screen_controller.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff55f7743064d91b269c244fc0edff5b9694b8849ecdfebc432606ddec9891a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OnlineGalleryPaginationService: ClassTooLong \u2014 418 significant lines (blank, comment-only and punctuation-only lines excluded), 8 methods. The bar is 400 significant lines; this is 18 over it, 1.05\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/presentation/providers/online_gallery_pagination_service.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"491e8387cdb10d14efbc75b7cdd8348176607c654cce29a9ba8a3e90393cc032"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: watermark/watermark_settings.dart: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 22 over it, 1.04\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/data/models/watermark/watermark_settings.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1be84f98b77772f0aa4f7459e12c027e5493650775985cd47b02e6c60bcfe8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gallery/scan_state_manager.dart: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 22 over it, 1.04\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/data/services/gallery/scan_state_manager.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df97ba6d8d82b0c127e03af20b95ee558876b7661ef2178d1b144ff9c7a679eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: online_gallery/quick_tag_cloud_parser.dart: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: QuickTagCloudParser (11-673). The bar is 500 significant lines; this is 22 over it, 1.04\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/data/services/online_gallery/quick_tag_cloud_parser.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d737c9e11601181ce664a3e1e9def2284e7c8e4b0de4b8d7c929b8594b118b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: character/character_position_canvas.dart: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 22 over it, 1.04\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/presentation/widgets/character/character_position_canvas.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3689ac231e1e917650cbf18e03d6c5e9768145e82676e3cf993c467d2cd34a8b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _ComfyUIWorkflowDialogState: ClassTooLong \u2014 417 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 17 over it, 1.04\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/presentation/screens/generation/widgets/comfyui_workflow_dialog.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"3793cf5e54850b90ede4d496f43c0ba47bbb313139d645449d2ff574a04c6cda"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GalleryCategoryNotifier: ClassTooLong \u2014 416 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 16 over it, 1.04\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/presentation/providers/gallery_category_provider.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0112bdb46a0e627e3d8c2066531ffa8deecdf0e50f076378c89f38a2598a9bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/agent_chat_model_picker.dart: FileTooLong \u2014 520 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 20 over it, 1.04\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/presentation/agent_chat/widgets/agent_chat_model_picker.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9a0d36a9db6da6bb6d8d2c3ca3b1b562e38eb845aa9c8a9ad64ed94738fbc6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StatisticsCacheService._deserializeStatistics: MethodTooLong \u2014 _deserializeStatistics runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\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/data/services/statistics_cache_service.dart"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b669c55cd5828213d768aa1988babbc7aca14ff9f7c7753aa4177185f12432"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GenerationExecutionService.generate: MethodTooLong \u2014 generate runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\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/presentation/agent_chat/services/generation_execution_service.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb52d7f0b2aa454d90917d6be2d4365cf24c1dfc7962f53b5ae2df1126d87e3e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _NavRailAccountButtonState._showAccountMenu: MethodTooLong \u2014 _showAccountMenu runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\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/presentation/widgets/navigation/nav_rail_account_button.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63bd8d3221262e5fb2d553ca5af19ca2205eee172a99a656fc6d588780fbb6e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AiTagGenerationInfoSection.build: MethodTooLong \u2014 build runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\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/presentation/widgets/online_gallery/ai_tag_generation_info_section.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1a791fbd9ceeecf8fdadaaf698742cf03bf5cd43d5528a5656f76b37a3f2fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gallery/gallery_content_view.dart: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 19 over it, 1.04\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/presentation/widgets/gallery/gallery_content_view.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75389e6585545264fb8193d38b6d330166ae767b7d90a61295881c955ad7eb43"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ImageSaveUtils: ClassTooLong \u2014 415 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 15 over it, 1.04\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/core/utils/image_save_utils.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a5d1c4371e122f1dba42f600951a6162c5473b88fc785d3bf9aa82eee8aebe"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DanbooruTagGroupService: ClassTooLong \u2014 415 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 15 over it, 1.04\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/data/datasources/remote/danbooru_tag_group_service.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b9afa311805671b44ae4cd8517d5e6dc3187ede4a1c025d5af006e9bf991ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: repositories/gallery_category_repository.dart: FileTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: GalleryCategoryRepository (16-757). The bar is 500 significant lines; this is 17 over it, 1.03\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/repositories/gallery_category_repository.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7152d3cd29a559aef62382389ac262f30f2c26b2a4c7426ae5ca1fd6d0c8b651"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gallery/gallery_category_tree_view.dart: FileTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 17 over it, 1.03\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/presentation/widgets/gallery/gallery_category_tree_view.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b43a1435617696b41ff4e9f4bd83f3e0d1917561e69e6ceabea22bd43ff74a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Session: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/harness/session/session.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d2f831b023ed11de4572fadaf490267948ddbbbe9b7ab4bd69a3a06c7d0ea1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PlatformCapabilities: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/platform/platform_capabilities.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3ff0a4fdaaef6eb0234c3d4ca93afd57cc2fdddf130d8cb48075e4da4befba"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DanbooruApiService: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/datasources/remote/danbooru_api_service.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3179d6a96638b657399dd0f3a6f92dfd12b5dada62c6529a61bae066cdaf064a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NaiImageMetadata: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/models/gallery/nai_image_metadata.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1226aff7da6cddc6c9eef90aa90423aa30a7139bcbac45ab2fd40c289a61a5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ImageMetadataContainerCodec: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/metadata/image_metadata_container_codec.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf16053e0b14b2b3c00305e8de1353565087e01c53fdf4d40ad51b9fadfebf8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _ImageDetailViewerState: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/image_detail/image_detail_viewer.dart"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c3f8e57714e482f7ad29e139658601c1bb590a91631f8966bb8327dafe85da"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EditorTool: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/image_editor/tools/tool_base.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8676549ad299f365cffc1fe065c9bc01f84d0368c39c2010a5cab70a717d46a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/vibe_library_provider.dart: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded), about 79% of them inside a single declaration: VibeLibraryNotifier (143-670). The bar is 500 significant lines; this is 15 over it, 1.03\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/vibe_library_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"852104da06fedd8b98554b7c9a1fa4a85e967208e3c43ed455afc4473f6a92b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/prompt_section.dart: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 15 over it, 1.03\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/presentation/widgets/common/image_detail/components/prompt_section.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"064f25cbc614575cbc6c10bd9b611a516e78c681532a95f7a6007a80aff70af9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VibeFileParser._parsePngIsolate: MethodTooLong \u2014 _parsePngIsolate 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/core/utils/vibe_file_parser.dart"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b55296f8683522311363008b571403971c43497ae21d01513993368a918823f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GalleryCategoryNotifier._moveCategoryToSlot: MethodTooLong \u2014 _moveCategoryToSlot 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/presentation/providers/gallery_category_provider.dart"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"295ea9cb914f555efc5c503a565255abe74c85c0e1e424cf17f0806a9386297e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OnlineGalleryToolbarDialogs.showSourceFilters: MethodTooLong \u2014 showSourceFilters 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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_dialogs.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05d388b23d3f730bf39aa05a5ffd7253579611e3dd488d974cf520413d79456"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SkillManagementPanelState.build: MethodTooLong \u2014 build 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/presentation/screens/settings/sections/agent/skill_management_panel.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7053e1cd76a9613334dd93f89f8cccafa22d1ad3c14fae453407b27ba978c286"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _PromptCopyDialogState._buildExportOptions: MethodTooLong \u2014 _buildExportOptions 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/presentation/widgets/common/image_detail/components/prompt_copy_dialog.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6a3c50ca8a272dfcd752bc0397c4955921dedc2eec792128228334e524deb0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _MosaicEditorScreenState: ClassTooLong \u2014 411 significant lines (blank, comment-only and punctuation-only lines excluded), 34 methods. The bar is 400 significant lines; this is 11 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/mosaic/mosaic_editor_screen.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e371c5782f123ff444a2f922e537896d79f116b52eeff0704c1adf2eaa777137"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: repositories/online_gallery_local_favorites_repository.dart: FileTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 13 over it, 1.03\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/data/repositories/online_gallery_local_favorites_repository.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eeb3b175977d5055a21e752b8a3931382e030948622e862b531452b2805c84b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: prompt/tag_editor_session.dart: FileTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: TagEditorSession (34-661). The bar is 500 significant lines; this is 13 over it, 1.03\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/tag_editor_session.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1269aaa5fbf9aa48f19e5b6aa09c69248d9b200eea681dfea9298ea5058349a8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _TaskListItemState: ClassTooLong \u2014 410 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 10 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/queue/task_list_item.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d528162f85ad7dd00e2bcd6a5ff32d5999e2664182db8fc4f133023ea3d3f8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metadata/ai_tag_generation_parser.dart: FileTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: AiTagGenerationParser (12-629). The bar is 500 significant lines; this is 12 over it, 1.02\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/data/services/metadata/ai_tag_generation_parser.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cf63c10a2a182d05e026716fe316fd0abcf3360380eec14ca70f2ce30c1bb9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GenerationToolDefinitions: ClassTooLong \u2014 409 significant lines (blank, comment-only and punctuation-only lines excluded), 2 methods. The bar is 400 significant lines; this is 9 over it, 1.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/presentation/agent_chat/services/generation_tool_definitions.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e929457e9d900fcce6dd22634e5f0cb70a41ac7cbe8b4f5b49bac841d43cd0b5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CloudRecordMerger.merge: MethodTooLong \u2014 merge runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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/core/cloud_sync/record_merge.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b9392f19a612e4fc93f9819db03ed8ddcb6ac8dd93fdfd181fa428a11cc09c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqliteGalleryAlbumRepository._moveAlbumToSlot: MethodTooLong \u2014 _moveAlbumToSlot runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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/core/database/datasources/gallery_album_repository.dart"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c03a371df05052329f959f9d37f291a53c56a42639a5bdce9fbeba482e8808b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _PreciseRefLibraryScreenState._buildToolbar: MethodTooLong \u2014 _buildToolbar runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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/presentation/screens/precise_ref_library/precise_ref_library_screen.dart"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"e583fa4739fc928575e0bbfaa51987014905ee8136808c49432d60cbb506d3b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _EntryCardState.build: MethodTooLong \u2014 build runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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/presentation/screens/tag_library_page/widgets/entry_card.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba5867ff8edc9e4a5614e9c33796ff1409513de598a0f5d924f6bd27414ec7b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _VibeLibraryContentViewState._sendEntryToGeneration: MethodTooLong \u2014 _sendEntryToGeneration runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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/presentation/screens/vibe_library/widgets/vibe_library_content_view.dart"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"625587a9dc3a8fe9585db8b2c2a58c3dbbfd65fe22103156d0560279baba38eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: queue/queue_management_page.dart: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: _QueueManagementPageState (31-708). The bar is 500 significant lines; this is 9 over it, 1.02\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/presentation/widgets/queue/queue_management_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5790914400ec1d46c485ce1e8088df9ec97796dd28051a7c9a5520474724a949"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OnlineGalleryCommandService: ClassTooLong \u2014 407 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods. The bar is 400 significant lines; this is 7 over it, 1.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/presentation/providers/online_gallery_command_service.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7e1c71b57602fe261ae74aa5550981fe949d5a039c8a350bc5a63fb674c1a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: panels/dependency_config_panel.dart: FileTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 8 over it, 1.02\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/presentation/widgets/prompt/diy/panels/dependency_config_panel.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83bd1275d869798e81512c0f28121eb188bd63ff83f7dba5f5f57370a044d86"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VibeLibraryNotifier: ClassTooLong \u2014 406 significant lines (blank, comment-only and punctuation-only lines excluded), 54 methods. The bar is 400 significant lines; this is 6 over it, 1.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/presentation/providers/vibe_library_provider.dart"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"423f1eecdcb128a87209ebd019b96b7c3e3c4357826d2cd2ebf36caede811e7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/online_gallery_provider.dart: FileTooLong \u2014 507 significant lines (blank, comment-only and punctuation-only lines excluded), about 87% of them inside a single declaration: OnlineGalleryNotifier (74-652). The bar is 500 significant lines; this is 7 over it, 1.01\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/presentation/providers/online_gallery_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ae36be4aab62ded684382f663c2cef1d9d467e730086f025681465972e73a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: character/inline_character_row.dart: FileTooLong \u2014 507 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 7 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/presentation/widgets/character/inline_character_row.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1318026e1b6a570cc9cd5382a764ef9c39793527797be427dafa8cee8a51a4f1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentToolPermissionController.beforeToolCall: MethodTooLong \u2014 beforeToolCall runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\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/presentation/agent_chat/services/agent_tool_permission_controller.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b9bed426f4109e942631bdb7199ee246b3ab07c04d39a0cb60137fc8314cd3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentChatThreadModel.fromMessages: MethodTooLong \u2014 fromMessages runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\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/presentation/agent_chat/widgets/agent_chat_turn.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc0094eba7c8a823ad9bbbb0fed122828a40ced56053003cfdfa3858852e763"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImageGenerationService._execute: MethodTooLong \u2014 _execute runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\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/presentation/providers/generation/image_generation_service.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"88eb6a159475a4dca31d4b1125f7c69fbea90605e92958fe257cbea6ef53bbc5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MobileShell.build: MethodTooLong \u2014 build runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\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/presentation/router/mobile_shell.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c796262d587f923ed52983dd7f569c7e1084392048abe973d7c171e270df12"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AgentSystemPromptEditorState.build: MethodTooLong \u2014 build runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\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/presentation/screens/settings/sections/agent/system_prompt_editor.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cdcffe6b455e792a712e6fefbae163a53ec6333ad7e0ced92cf6253dc042eb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CardResourceDragFactory.create: MethodTooLong \u2014 create runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\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/presentation/utils/card_resource_drag_factory.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf3b5308e46faabc812034c83931131beee4184cc0fd1869cb976517d9c7b09"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _TagLibraryEntryPreviewOverlayState.build: MethodTooLong \u2014 build runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\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/presentation/widgets/tag_library/tag_library_entry_hover_preview.dart"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"537ee207c498e96b67f0032d4d1841518944f7ac3667aa5a7d59c04abbe61c71"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: remote/danbooru_api_service.dart: FileTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: DanbooruApiService (22-716). The bar is 500 significant lines; this is 4 over it, 1.01\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/data/datasources/remote/danbooru_api_service.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3aae8013d4b1369148d305ca744133f3a8bae154e307e69248dc06d239867a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: watermark/watermark_editor_controls.dart: FileTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded), about 74% of them inside a single declaration: WatermarkEditorControls (12-511). The bar is 500 significant lines; this is 4 over it, 1.01\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/presentation/screens/watermark/watermark_editor_controls.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"261ba078fccb928d1eca748f330d86472a8a957b05254ffbec9f7fdf8bbd56b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: drop/prompt_library_entry_dialog.dart: FileTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded), about 71% of them inside a single declaration: _PromptLibraryEntryDialogState (119-599). The bar is 500 significant lines; this is 4 over it, 1.01\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/presentation/widgets/drop/prompt_library_entry_dialog.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f9d4febb343988f8596f249ed60eef4d88d3455aa4a359932972c8b5ce8fd2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AgentChatPanelCoordinator: ClassTooLong \u2014 403 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 3 over it, 1.01\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/presentation/agent_chat/widgets/agent_chat_panel_coordinator.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa13a3d7b225be27842a2e8315418534032a10fad000f4abfedfb287aeeb7a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cloud_sync/coordinator.dart: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: SyncCoordinator (17-614). The bar is 500 significant lines; this is 3 over it, 1.01\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/core/cloud_sync/coordinator.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e62b8d08f41dc4a9e72bc1a879a7b50a61031e18e4c567478e7196253d043f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: oauth/loopback_oauth_client.dart: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded), about 66% of them inside a single declaration: LoopbackCloudDriveOAuthClient (197-627). The bar is 500 significant lines; this is 2 over it, 1.00\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/core/cloud_sync/oauth/loopback_oauth_client.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6175f9fcb34d56efb34dc7dbd78d4aacdb29bcd1bd23d9a4c36ec9a2fa2b88d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/nai_inpaint_parity_browser.cjs: FileTooLong \u2014 501 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 75% of them inside a single declaration: main (161-643). The bar is 500 significant lines; this is 1 over it, 1.00\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":"tool/diagnostics/nai_inpaint_parity_browser.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae52af57e627f4f5500065368f6a930e73a8a6e3b4635e3c15be9ca292df8b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/image_save_utils.dart: FileTooLong \u2014 501 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: ImageSaveUtils (36-635). The bar is 500 significant lines; this is 1 over it, 1.00\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/core/utils/image_save_utils.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9310475f3d55911cc143f4c2833b771e69dfddee34118dc1a840b89a56537a40"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: panels/time_condition_panel.dart: FileTooLong \u2014 501 significant lines (blank, comment-only and punctuation-only lines excluded), about 74% of them inside a single declaration: _TimeConditionPanelState (33-552). The bar is 500 significant lines; this is 1 over it, 1.00\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/presentation/widgets/prompt/diy/panels/time_condition_panel.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3c2a1747ac42f2333f681a377adc46ee65b6741745650876635c09246d4e20"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 33 shared lines): lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart:359-499 | lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart:65-251 | lib/presentation/widgets/gallery/gallery_album_tree_view.dart:550-731 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:423-624 \u2014 These 4 members are variants of one another: a block of 33 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/presentation/screens/tag_library_page/widgets/category_tree_view.dart"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef9d9ccf5620a89119d86c6fbd0a277290182926177d1f238c9bd8dff82f9fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (64 shared lines): lib/presentation/widgets/auth/third_party_api_login_card.dart:41-204 | lib/presentation/widgets/auth/token_login_card.dart:37-242 \u2014 These two members are variants of one another: 64 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/auth/third_party_api_login_card.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"adaa751fa055b757d4760b0c28dca12029a191f8e9e81251f06a45909539c55e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (27 shared lines): lib/data/services/official_random_prompt_generator.dart:154-254 | lib/data/services/official_random_prompt_generator.dart:386-500 \u2014 These two members are variants of one another: 27 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/official_random_prompt_generator.dart"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e0aa9862e6a599e7db46cb8f54bbf3caa6f81469366f47930f180a0eb87155"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): lib/presentation/router/app_router_config.dart:271-342 | lib/presentation/screens/auth/login_screen.dart:76-153 | lib/presentation/screens/image_comparison_screen.dart:274-356 | lib/presentation/screens/slideshow_screen.dart:376-446 | lib/presentation/screens/splash/splash_screen.dart:66-134 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/router/app_router_config.dart"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6757fd048ce1a7d7ec4d46a463ccd84e413eba1b74776b413083c6d5213af64"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): lib/presentation/screens/statistics/widgets/animated/animated_bar_chart.dart:38-49 | lib/presentation/screens/statistics/widgets/animated/animated_number.dart:39-50 | lib/presentation/screens/statistics/widgets/animated/animated_pie_chart.dart:38-49 | lib/presentation/screens/statistics/widgets/charts/heatmap_chart.dart:75-86 | lib/presentation/screens/statistics/widgets/charts/polar_activity_chart.dart:45-56 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/statistics/widgets/animated/animated_bar_chart.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1a46577b6b59452388e01758c2e5a2b6eb0fc49d4174c2d8703be8c1e651da"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/core/database/datasources/gallery_favorite_tag_repository.dart:143-186 | lib/core/database/datasources/gallery_favorite_tag_repository.dart:280-329 | lib/core/database/datasources/gallery_image_repository.dart:218-266 | lib/core/database/datasources/gallery_metadata_repository.dart:291-343 \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/core/database/datasources/gallery_favorite_tag_repository.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffeaa75b70d5a362ae5a53a9ff2a098830a0b81910a531011b6779bddecf4ad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/core/database/datasources/gallery_favorite_tag_repository.dart:407-412 | lib/core/database/datasources/gallery_image_repository.dart:780-785 | lib/core/database/datasources/gallery_metadata_repository.dart:345-350 | lib/data/services/bulk_image_state_service.dart:320-325 \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/core/database/datasources/gallery_favorite_tag_repository.dart"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99d84f92d143039d4b7dda54e39265306740b4df3af3276be056151e241afc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/core/database/datasources/gallery_query.dart:72-132 | lib/core/database/datasources/gallery_query.dart:134-189 | lib/core/database/datasources/gallery_query.dart:191-276 | lib/core/database/datasources/gallery_query.dart:278-428 \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/core/database/datasources/gallery_query.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41d3f4ef7b62f1cbea0b8433022db39f48b675ffd9ec3960db730acdd788dcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/core/utils/novelai_vibe_codec.dart:288-317 | lib/core/watermark/watermark_logo_service.dart:151-181 | lib/data/services/precise_ref_portable_importer.dart:13-55 | lib/presentation/prompt_assistant/services/prompt_assistant_service.dart:687-715 \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/core/utils/novelai_vibe_codec.dart"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1eb3a66c036bb65aa0a2e9dca2dc3c27c76653ffc788e3f2e91445fb8e08930"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/core/utils/pica_lanczos_resizer.dart:314-356 | lib/core/utils/pica_lanczos_resizer.dart:358-404 | lib/core/utils/pica_lanczos_resizer.dart:406-452 | lib/core/utils/pica_lanczos_resizer.dart:454-507 \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/core/utils/pica_lanczos_resizer.dart"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5059c79eaec574cd0e7fb3e5faef6aefab1e9b8d4bc188eda454a23059dde5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:253-274 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:874-895 | lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:185-201 | lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:439-455 \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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a326ab41ebacc1d02313e3b737f663f43968e75a49d74a81886b79fb08ebcd65"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/presentation/agent_chat/services/generation_execution_service.dart:291-297 | lib/presentation/providers/gallery_category_provider.dart:466-472 | lib/presentation/providers/online_gallery_blacklist_provider.dart:881-887 | lib/presentation/widgets/online_gallery/quick_tag_cloud_toolbar.dart:503-509 \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/presentation/agent_chat/services/generation_execution_service.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d70590c09fcf537d38cee1d26f50bb7b8fbfbc5f98013d5fb2540f5be8aeb50"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart:63-243 | lib/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart:71-263 | lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart:97-286 | lib/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart:70-287 \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/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8181da43fe5c05fdf07fa3d873436cb08f062252257c0379671e6a22c20574"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/presentation/screens/settings/sections/agent/agent_profile_actions.dart:63-194 | lib/presentation/screens/tag_library_page/widgets/entry_add_dialog.dart:289-453 | lib/presentation/widgets/character/add_to_library_dialog.dart:349-401 | lib/presentation/widgets/metadata/metadata_import_dialog.dart:112-220 \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/presentation/screens/settings/sections/agent/agent_profile_actions.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd51ae292f40624f8f36ce5c69754e64ed374e6a92af77abf7e1b84304eed278"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/presentation/widgets/common/add_to_library_dialog.dart:261-430 | lib/presentation/widgets/image_editor/effects/effects_preview_dialog.dart:149-256 | lib/presentation/widgets/prompt/diy/panels/dependency_config_panel.dart:602-696 | lib/presentation/widgets/prompt/fixed_tag_edit_dialog.dart:660-696 \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/presentation/widgets/common/add_to_library_dialog.dart"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edf9b4ce169edcbe721b97634e60a061afe7807d039523df8330cb423f4ca08"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/presentation/widgets/image_editor/tools/blur_tool.dart:161-203 | lib/presentation/widgets/image_editor/tools/clone_stamp_tool.dart:311-355 | lib/presentation/widgets/image_editor/tools/fill_tool.dart:121-158 | lib/presentation/widgets/image_editor/tools/magic_wand_tool.dart:81-177 \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/presentation/widgets/image_editor/tools/blur_tool.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"894eebebdf7b5b119ab88232c5412666a2d4c36c75571367adf5c94a5b32eb17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (154 corresponding lines): lib/presentation/widgets/danbooru_login_dialog.dart:59-224 | lib/presentation/widgets/gelbooru_credentials_dialog.dart:115-268 \u2014 These two members are one piece of code written twice and then edited apart: 154 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/presentation/widgets/danbooru_login_dialog.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c300810af367be23bd29ab2e3d9c4276a52acf027146ac48c13e1bbd74198069"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (122 corresponding lines): lib/presentation/screens/statistics/widgets/charts/parameter_distribution_bar.dart:69-190 | lib/presentation/screens/statistics/widgets/charts/weekday_bar_chart.dart:84-229 \u2014 These two members are one piece of code written twice and then edited apart: 122 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/presentation/screens/statistics/widgets/charts/parameter_distribution_bar.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14bf70198f5084818f01700e37f0c775bae00b92da8cd1f3ebc44aa9899b37b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (78 corresponding lines): lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart:171-248 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:191-284 \u2014 These two members are one piece of code written twice and then edited apart: 78 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/presentation/screens/tag_library_page/widgets/category_tree_view.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e10083213ff33fab294e230d47842d55d046609e0d2ac2c73dc109866b5bb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (92 corresponding lines): lib/presentation/screens/generation/widgets/prompt_input_tooltips.dart:38-146 | lib/presentation/screens/generation/widgets/prompt_input_tooltips.dart:217-308 \u2014 These two members are one piece of code written twice and then edited apart: 92 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/presentation/screens/generation/widgets/prompt_input_tooltips.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3880b96baa0803a4e7bc5d0238e844fd1319e29c6fdaf4a54265e53112ca5da1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (77 corresponding lines): lib/presentation/screens/generation/desktop_layout.dart:145-221 | lib/presentation/screens/generation/web_style_layout.dart:127-203 \u2014 These two members are one piece of code written twice and then edited apart: 77 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/presentation/screens/generation/desktop_layout.dart"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5543aeb12777be7b58e87aa2007e916121fbe64058180b00fa36402901b4470c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (68 corresponding lines): lib/presentation/widgets/character/add_character_buttons.dart:145-212 | lib/presentation/widgets/character/add_character_buttons.dart:237-306 \u2014 These two members are one piece of code written twice and then edited apart: 68 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/presentation/widgets/character/add_character_buttons.dart"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"17aa9e5c6c6fd21f251ee631a1f7a7e938b52bbc62d3b315c829c81b76266193"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (84 corresponding lines): lib/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart:606-689 | lib/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart:691-781 \u2014 These two members are one piece of code written twice and then edited apart: 84 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/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"8998b5afb182e72ca78b4a25490c58a56ca2cc57a36f8c4b1602f4f6c0ba258b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (79 corresponding lines): lib/data/services/image_metadata_service.dart:198-276 | lib/data/services/image_metadata_service.dart:306-394 \u2014 These two members are one piece of code written twice and then edited apart: 79 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/image_metadata_service.dart"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb275c63b3e7f533b135978febc4781189d33573511c7a4e50ac014e3b9ccd22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (66 corresponding lines): lib/presentation/providers/comfyui/comfyui_provider.dart:353-429 | lib/presentation/providers/comfyui/comfyui_provider.dart:431-496 \u2014 These two members are one piece of code written twice and then edited apart: 66 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/presentation/providers/comfyui/comfyui_provider.dart"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d74b044d9cae6aa2e7ee1b8a12251d50d77d85dbb4de239597edeea36931d47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): lib/presentation/screens/generation/widgets/comfyui_workflow_dialog.dart:173-231 | lib/presentation/screens/settings/widgets/workflow_import_wizard.dart:135-191 \u2014 These two members are one piece of code written twice and then edited apart: 57 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/presentation/screens/generation/widgets/comfyui_workflow_dialog.dart"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c36b188f6f9b798b0b1d1a62cc440f086f6182891181255891ecbe820ebe671"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): lib/presentation/widgets/prompt/quality_tags_selector.dart:54-109 | lib/presentation/widgets/prompt/uc_preset_selector.dart:46-117 \u2014 These two members are one piece of code written twice and then edited apart: 56 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/presentation/widgets/prompt/quality_tags_selector.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55ee6d6e3382b6573debe02eb5fbd33a0672adabed6d1a8c2c64fb3303233dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (66 corresponding lines): lib/presentation/widgets/gallery/gallery_album_tree_view.dart:263-328 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:296-370 \u2014 These two members are one piece of code written twice and then edited apart: 66 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/presentation/widgets/gallery/gallery_album_tree_view.dart"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76f2e880395d863053cce43765b8929688544a1624a71629bfb7251967fc5ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): lib/presentation/screens/generation/widgets/comfyui_workflow_dialog.dart:424-470 | lib/presentation/screens/generation/widgets/comfyui_workflow_dialog.dart:472-520 \u2014 These two members are one piece of code written twice and then edited apart: 47 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/presentation/screens/generation/widgets/comfyui_workflow_dialog.dart"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eed1cf105938c67494d3d06260ec7d2dad6aa2a9acdd877b8d08a26e5d29675"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): lib/core/utils/inpaint_outpaint_utils.dart:403-465 | lib/core/utils/inpaint_outpaint_utils.dart:704-774 \u2014 These two members are one piece of code written twice and then edited apart: 63 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/core/utils/inpaint_outpaint_utils.dart"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e497c184561530512c4de46687ce7b013de2d8c0fb898e409b52f2311e58748"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_search.dart:230-308 | lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_search.dart:407-477 \u2014 These two members are one piece of code written twice and then edited apart: 71 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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_search.dart"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1f58f6551b8d57b093f381bf6d756a8b6cbef7cb7a5a39cd80bf094bc0be0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): lib/core/database/datasources/gallery_image_repository.dart:373-434 | lib/core/database/datasources/gallery_image_repository.dart:436-496 \u2014 These two members are one piece of code written twice and then edited apart: 61 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/core/database/datasources/gallery_image_repository.dart"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f0d5423e72a6654df29bd400f9242bedebace67f6db606078ff74e45f975ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 48\u002B corresponding lines): lib/presentation/widgets/prompt/diy/panels/conditional_branch_panel.dart:111-172 | lib/presentation/widgets/prompt/diy/panels/post_process_rule_panel.dart:82-141 | lib/presentation/widgets/prompt/diy/panels/visibility_rule_panel.dart:73-120 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 48 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/presentation/widgets/prompt/diy/panels/conditional_branch_panel.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"58506b5c736863fccc833395365f79364f3f28ae390ec8fa251d153cb4342fa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): lib/presentation/widgets/prompt/quality_tags_selector.dart:171-248 | lib/presentation/widgets/prompt/uc_preset_selector.dart:232-291 \u2014 These two members are one piece of code written twice and then edited apart: 60 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/presentation/widgets/prompt/quality_tags_selector.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8055cfed5c5c35009afa1da386bd46af0d2a69c13f998e51a42f11594a6c0d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): lib/presentation/screens/settings/sections/appearance_settings_section.dart:240-312 | lib/presentation/screens/settings/sections/appearance_settings_section.dart:314-385 \u2014 These two members are one piece of code written twice and then edited apart: 72 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/presentation/screens/settings/sections/appearance_settings_section.dart"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b84899e77c0239af22cf78a5725047bace17a8743df7031dde6bb05e8c39d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): lib/presentation/agent_chat/services/precise_reference_toolbox.dart:90-133 | lib/presentation/agent_chat/services/precise_reference_toolbox.dart:135-189 \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/presentation/agent_chat/services/precise_reference_toolbox.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49bdb4e80560f2d10146b3abd264370eb053ca8b8c63001fc131cb5cae4c1ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): lib/presentation/screens/settings/sections/storage_settings_section.dart:458-527 | lib/presentation/screens/settings/sections/storage_settings_section.dart:602-654 \u2014 These two members are one piece of code written twice and then edited apart: 53 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/presentation/screens/settings/sections/storage_settings_section.dart"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1a6eaa763c81abcdd24643333be4a474a686b352bc72eff81230b1c8da774a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): lib/presentation/screens/generation/widgets/precise_reference_panel.dart:309-361 | lib/presentation/screens/generation/widgets/vibe_transfer_content.dart:382-434 \u2014 These two members are one piece of code written twice and then edited apart: 53 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/presentation/screens/generation/widgets/precise_reference_panel.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6cb0ae3c7ddc7ea8c46b301d339787f7475ef20f533a016e89fbdb6352024f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): lib/presentation/widgets/prompt/random_manager/danbooru_preview_content.dart:26-83 | lib/presentation/widgets/prompt/random_manager/danbooru_preview_content.dart:103-161 \u2014 These two members are one piece of code written twice and then edited apart: 58 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/presentation/widgets/prompt/random_manager/danbooru_preview_content.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23bee5d0fba5a17812fceb0fd939f381c174a84ab0f0f6e1bafee2bc66a5221"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): lib/core/agent/harness/session/jsonl/session_jsonl_codec.dart:312-331 | lib/core/agent/harness/session/jsonl/session_jsonl_storage.dart:735-756 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/harness/session/jsonl/session_jsonl_codec.dart"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac086a5ceed6b4b8395ecfa74b47b9ff9d0ef3758329c867f0c6fb515604b917"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 56\u002B corresponding lines): lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:443-510 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:512-568 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:570-625 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 56 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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18be57441a97c1e0f1cf808f446f70998b105f1beeee150c199c7daf0c9122b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): lib/presentation/screens/generation/widgets/precise_reference_panel.dart:822-876 | lib/presentation/screens/generation/widgets/vibe_card.dart:597-666 \u2014 These two members are one piece of code written twice and then edited apart: 55 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/presentation/screens/generation/widgets/precise_reference_panel.dart"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aef54a909d7ed039cdde6ad2aad8b47428a4c301fad9fb9ca597a824a081045"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): lib/presentation/widgets/drop/global_drop_overlay.dart:11-70 | lib/presentation/widgets/drop/global_drop_overlay.dart:76-130 \u2014 These two members are one piece of code written twice and then edited apart: 55 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/presentation/widgets/drop/global_drop_overlay.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b820b554d6c87b510dcbddc78aa6334440848b7bd86580a50114a89edf18205"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): lib/presentation/widgets/common/horizontal_resize_handle.dart:38-80 | lib/presentation/widgets/common/vertical_resize_handle.dart:36-88 \u2014 These two members are one piece of code written twice and then edited apart: 43 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/presentation/widgets/common/horizontal_resize_handle.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d84249f47db25ff876b15810c8965ed33f10720708c81bec1eda6a9eaa5651"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): lib/core/services/file_export_service.dart:296-320 | lib/core/services/file_export_service.dart:322-349 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/services/file_export_service.dart"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac08eb077a0c37ccff2285d6bd9e02611b64e6915c40b099b5ffdbde4dc4df3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): lib/presentation/widgets/library_export/library_export_panel.dart:153-213 | lib/presentation/widgets/library_export/library_export_panel.dart:245-295 \u2014 These two members are one piece of code written twice and then edited apart: 51 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/presentation/widgets/library_export/library_export_panel.dart"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b539c9f674e0b2d198fa19bf16f986bf28771b3499159c03dc3e36f7ab08214"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): lib/presentation/agent_chat/services/precise_reference_toolbox.dart:32-71 | lib/presentation/agent_chat/services/vibe_library_toolbox.dart:31-65 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/precise_reference_toolbox.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df34da133b1fa0eb9baa0c701598933662975d8fcc2ec8686f98244026b9dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): lib/presentation/agent_chat/widgets/agent_chat_tool_image_card.dart:71-114 | lib/presentation/agent_chat/widgets/agent_chat_tool_result_file_image.dart:235-290 \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/presentation/agent_chat/widgets/agent_chat_tool_image_card.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5b398e7f468b6487a1fc3c857987486d429cc633453f2cbebe3f592549c63e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): lib/data/services/vibe_import_service.dart:206-259 | lib/data/services/vibe_import_service.dart:261-305 \u2014 These two members are one piece of code written twice and then edited apart: 45 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/data/services/vibe_import_service.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"346bda43526addc047787ee966fe725c5d6adee07d008f8c5473f09c2ab5c4c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): lib/presentation/screens/prompt_config/widgets/preset_transfer_chooser.dart:64-118 | lib/presentation/screens/tag_library_page/widgets/tag_library_drop_menu.dart:155-207 \u2014 These two members are one piece of code written twice and then edited apart: 53 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/presentation/screens/prompt_config/widgets/preset_transfer_chooser.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4000726cab6a20a647882d6bb1324c1be5c38fa7564fc7a52a17d484c0237463"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): lib/presentation/widgets/character/character_prompt_button.dart:334-369 | lib/presentation/widgets/character/character_prompt_button.dart:383-417 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/character/character_prompt_button.dart"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"781c8864e6a833d6d4a348e1b0bc5cd1ee0d3c10141e7f486498572dfb28b530"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): lib/core/utils/inpaint_mask/inpaint_mask_operations.dart:1638-1672 | lib/core/utils/inpaint_mask/inpaint_mask_operations.dart:1674-1706 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"27622da2207677bd49b43271a64663248683f17623803aa82bd3313f5ce60665"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): lib/core/autocomplete/tag_catalog_repository.dart:160-202 | lib/core/autocomplete/tag_catalog_repository.dart:204-238 | lib/core/autocomplete/tag_catalog_repository.dart:240-266 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 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/core/autocomplete/tag_catalog_repository.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b0b90fd31f4a9d238f9989771f0340c4b2bf1fbcc96b82aadf5e5862f9ec33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): lib/presentation/screens/auth/login_screen.dart:686-737 | lib/presentation/screens/auth/login_screen.dart:739-780 \u2014 These two members are one piece of code written twice and then edited apart: 42 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/presentation/screens/auth/login_screen.dart"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"1858a55e72b6af541ece7a8ac2561fb4b93bceba61cce03659e0e101e56ba6a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): lib/data/services/tag_library_import_planner.dart:75-111 | lib/data/services/tag_library_import_planner.dart:113-148 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/tag_library_import_planner.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"37311e0dabaec40265d66070e3d65a79591625053db58b80e416b211848be2cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): lib/core/database/datasources/gallery_records.dart:108-144 | lib/domain/entities/gallery_image_entity.dart:127-164 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/datasources/gallery_records.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"800b54466a2750455ddd9910025297ef0385e224401a618c1e800882263c6f26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:330-374 | lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:376-418 \u2014 These two members are one piece of code written twice and then edited apart: 43 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/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"500d473ae23c2bad5fa2ee568086fe65f9ee87d30c290cb6e727f1ef21e295fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): lib/data/services/vibe_library_migration_service.dart:244-275 | lib/data/services/vibe_library_migration_service.dart:320-349 \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/data/services/vibe_library_migration_service.dart"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"40168700a6aa4bf8b319b24f867b16ac7a9e441c0c17a574544a779e6caa4aab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): lib/presentation/providers/online_gallery_command_service.dart:132-171 | lib/presentation/providers/online_gallery_command_service.dart:173-209 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/online_gallery_command_service.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"135c91ec8d44f28bd2b6df60f13c8b95d763fd802bec44c9971434c8fd8bcee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): lib/core/autocomplete/completion_orchestrator.dart:287-325 | lib/core/autocomplete/completion_orchestrator.dart:327-368 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/autocomplete/completion_orchestrator.dart"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"207e2da6553a4f22baf79e09e8f02c2072b9f88352ff0d07f421322d01fd31d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): lib/presentation/providers/tag_library_page_provider.dart:626-655 | lib/presentation/providers/vibe_library_category_provider.dart:338-367 \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/presentation/providers/tag_library_page_provider.dart"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e7c573e7795084be4ff252477f9add3884ee5681b154cbbfd2bbdf1f4fc4db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 40\u002B corresponding lines): lib/presentation/widgets/image_editor/widgets/toolbar/desktop_toolbar.dart:374-413 | lib/presentation/widgets/image_editor/widgets/toolbar/desktop_toolbar.dart:455-495 | lib/presentation/widgets/image_editor/widgets/toolbar/mobile_toolbar.dart:198-238 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 40 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/presentation/widgets/image_editor/widgets/toolbar/desktop_toolbar.dart"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cc5b0af8d0c915d13f993cd9c650b7c0dcee10a1381054835462006ad74281"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): lib/presentation/widgets/autocomplete/completion_overlay_footer.dart:231-269 | lib/presentation/widgets/autocomplete/completion_overlay_footer.dart:271-308 \u2014 These two members are one piece of code written twice and then edited apart: 38 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/presentation/widgets/autocomplete/completion_overlay_footer.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b9d28f4886767be1599481eeb2567d6613bf40dcbeb495e09a3c33acacc33f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): lib/presentation/providers/vibe_library_provider.dart:592-615 | lib/presentation/providers/vibe_library_provider.dart:617-644 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/vibe_library_provider.dart"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e6d60829298c648c3a6e20aeca333307e4263a22f3892a3b20480a78fb33b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): lib/data/services/efficient_vit_sam_service.dart:199-231 | lib/data/services/efficient_vit_sam_service.dart:233-277 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/efficient_vit_sam_service.dart"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba5613864365a13e6665b872744dee6869bb1ceefd228c23828d5501b84b91f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): lib/presentation/mcp/providers/mcp_server_notifier.dart:143-176 | lib/presentation/providers/director_tools_notifier.dart:96-131 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/mcp/providers/mcp_server_notifier.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08f0da434c741ac075f62c54b168f8bef418d7502ffb021ae3cffac4236dd4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): lib/core/utils/inpaint_outpaint_utils.dart:1014-1041 | lib/core/utils/inpaint_outpaint_utils.dart:1092-1125 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/inpaint_outpaint_utils.dart"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1bbad480e8e5796a512f90f115a248fab3d996dae557301febb985c90a36e68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): lib/data/models/mosaic/mosaic_settings.dart:106-139 | lib/data/models/watermark/watermark_settings.dart:343-377 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/models/mosaic/mosaic_settings.dart"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"527eadb420b5fabb0d4f0be95bad0ddea1f6f4b2552738b98b6f30f219b4e31c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): lib/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_bundle_sections.dart:239-279 | lib/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_bundle_sections.dart:301-335 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_bundle_sections.dart"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4cba4fde760c36f619a5ec3fa61636f3870324fabd8d5e246d80f9a296c8cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:249-288 | lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:290-328 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"28550f171950e334018de71493c0d257ee609bae795c27817891e14dc46d5290"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): lib/presentation/screens/auth/login_screen.dart:991-1044 | lib/presentation/screens/vibe_library/widgets/vibe_image_encode_dialog.dart:561-602 \u2014 These two members are one piece of code written twice and then edited apart: 42 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/presentation/screens/auth/login_screen.dart"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb32090a7e3a33557cc938a072d3326ab695557549340df0fa65936c59068f29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): lib/core/agent/harness/env/dart_io_execution_env.dart:232-261 | lib/core/agent/harness/env/dart_io_execution_env.dart:263-297 \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/core/agent/harness/env/dart_io_execution_env.dart"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"86426e28ed6f4c7e8db8ecc4bed3d9d58c836d9bcf62a1c3d382755948a1a179"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): lib/presentation/screens/prompt_config/widgets/prompt_config_unavailable_states.dart:75-103 | lib/presentation/widgets/prompt/random_manager/preview_generator_panel.dart:571-605 \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/presentation/screens/prompt_config/widgets/prompt_config_unavailable_states.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee30779c37ed834b15d5e2ce57e3cd7a44825ed3876479ea7acb496373fee5b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): lib/core/cloud_sync/oauth/mobile_oauth_clients.dart:246-282 | lib/core/cloud_sync/oauth/mobile_oauth_clients.dart:434-475 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/oauth/mobile_oauth_clients.dart"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"4450cd31ff976f87597aa2a2de3a01b79714af3c313b64cab38ac1ba2693c9f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): lib/presentation/screens/precise_ref_library/precise_ref_library_screen.dart:1194-1224 | lib/presentation/screens/vibe_library/vibe_library_workspace.dart:457-489 \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/presentation/screens/precise_ref_library/precise_ref_library_screen.dart"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbeff3a1a3684e4bd49b9be676c68032dc8a7ee66764dc8f6b79e60a16f4561"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): lib/core/cloud_sync/oauth/mobile_oauth_clients.dart:200-236 | lib/core/cloud_sync/oauth/mobile_oauth_clients.dart:379-418 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/oauth/mobile_oauth_clients.dart"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"22bb60d368be0affd5bdce38ecd08deaeb761882cb693a50a0cc00174a197d6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): lib/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart:201-237 | lib/presentation/screens/vibe_library/widgets/vibe_image_encode_dialog.dart:196-238 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd9fc2f602d90114e61bf20cc5ccfa62452d0bf7d8b4b8061f61e0a09fedeeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): lib/core/agent/harness/session/jsonl/session_jsonl_codec.dart:202-227 | lib/core/agent/harness/session/jsonl/session_jsonl_codec.dart:276-310 \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/core/agent/harness/session/jsonl/session_jsonl_codec.dart"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab19a8501016ae3446de4bb4c0e01f908ef3e4fc8b41316307b5d0fb78f9bb4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/data/services/efficient_vit_sam_service.dart:317-335 | lib/data/services/local_onnx_tagger_service.dart:347-370 \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/data/services/efficient_vit_sam_service.dart"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"7831dbac323ec651ef5ac997e5bbc480473b64e526327507fbeade91d165707a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): lib/core/utils/file_explorer_utils.dart:69-92 | lib/core/utils/file_explorer_utils.dart:94-123 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/file_explorer_utils.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1c9f2786b9e3cc1e519f98793b96a7113672016cc1646d953dc668d04ff272"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): lib/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart:446-475 | lib/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart:450-479 \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/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0d6156ea51ac6afe97486bd64a96c500efc51c92b30098c288780ca2692f70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): lib/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_option_card.dart:286-314 | lib/presentation/screens/vibe_library/widgets/vibe_export_dialog.dart:307-338 \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/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_option_card.dart"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc693c7f12ea2dbf4dc47a5d6adecf0029e3f20887f7567d768ae0666f85af5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): lib/presentation/widgets/online_gallery/gallery_detail_info_panel.dart:707-748 | lib/presentation/widgets/online_gallery/gallery_detail_overview_card.dart:230-270 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/online_gallery/gallery_detail_info_panel.dart"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b6be37d47d38edc5058d1d4111340b50f8dac720921872a0f7498d0d613832"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): lib/presentation/screens/generation/mobile_generation_gestures.dart:292-325 | lib/presentation/widgets/common/library_card_badges.dart:18-52 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/mobile_generation_gestures.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a133f31e61672f7f78d76a609aa2bb9920db55ba0628180d4a0260f81b59a43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): lib/presentation/agent_chat/services/fixed_tags_toolbox.dart:226-253 | lib/presentation/agent_chat/services/queue_toolbox.dart:131-164 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/fixed_tags_toolbox.dart"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9dfa92a7e2e3c5bcbf52cd6c4eb0daadba565110d401d9a10622e873255902d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): lib/presentation/widgets/gallery/gallery_album_tree_view.dart:76-97 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:87-108 \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/presentation/widgets/gallery/gallery_album_tree_view.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"930ea1e5494a1ddc35e65be033b7ec685f1cf7f22fc79f6da8715750b1d85c51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): lib/presentation/screens/precise_ref_library/precise_ref_library_screen.dart:734-763 | lib/presentation/screens/precise_ref_library/widgets/precise_ref_selector_dialog.dart:344-369 \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/presentation/screens/precise_ref_library/precise_ref_library_screen.dart"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ecf5a62b5f36a62ac0403daede934f716bdb452d7d59d1a04eb1ecbaf1cdd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): lib/presentation/screens/vibe_library/widgets/vibe_detail_viewer.dart:126-162 | lib/presentation/screens/watermark/watermark_editor_controls.dart:529-563 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/vibe_library/widgets/vibe_detail_viewer.dart"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"386c4f631cee61bf85dbfd2cf6d3a1fed6949f74964e4f916941d11d1c91f891"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): lib/presentation/screens/statistics/widgets/cards/chart_card.dart:22-57 | lib/presentation/widgets/prompt/diy/panels/time_condition_panel.dart:672-704 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/statistics/widgets/cards/chart_card.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd51d94b75816396d3344c2fb88df1a086fa7ef25bd2c5a83f677990154b0f34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): lib/presentation/widgets/grouped_grid_view.dart:173-206 | lib/presentation/widgets/shortcuts/shortcut_tooltip.dart:108-144 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/grouped_grid_view.dart"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1adccb305fb0f820e3160d876758999c18d8a9839441a515b36ea29b1c99d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): lib/presentation/widgets/prompt/random_manager/add_tag_group_dialog.dart:385-418 | lib/presentation/widgets/prompt/random_manager/add_tag_group_dialog.dart:420-451 \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/presentation/widgets/prompt/random_manager/add_tag_group_dialog.dart"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"d042a6685450a1c135cf362310790aa4df0f8469c07afa9065e47c39f7d2b29c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): lib/core/database/datasources/gallery_records.dart:264-294 | lib/data/services/gallery/local_gallery_repository.dart:244-269 \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/core/database/datasources/gallery_records.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1b2932a1e273fc1240c57584df72f17999ca8179d097545b21fc62d36c3590"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): lib/presentation/prompt_assistant/providers/prompt_assistant_history_provider.dart:83-110 | lib/presentation/prompt_assistant/providers/prompt_assistant_history_provider.dart:112-144 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/providers/prompt_assistant_history_provider.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a98b8e48e63ec9ea5925383d2fb4e5d96a3b35c2839015b5369e6cab56668e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): lib/presentation/widgets/image_editor/widgets/toolbar/desktop_toolbar.dart:139-166 | lib/presentation/widgets/image_editor/widgets/toolbar/mobile_toolbar.dart:123-149 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/image_editor/widgets/toolbar/desktop_toolbar.dart"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8369c41460dc9cd736c264e4f3b0fd48cd7dbd32e97a764c0d29903a185260"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): lib/presentation/screens/auth/login_screen.dart:586-615 | lib/presentation/screens/auth/login_screen.dart:617-639 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/auth/login_screen.dart"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"756e99540f9c1675665b240e447cf9d7970ed8137254fd5ef7d6b19cc5a003fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): lib/core/autocomplete/autocomplete_cache_database.dart:91-116 | lib/core/autocomplete/tag_catalog_repository.dart:134-153 | lib/core/autocomplete/zh_dictionary_service.dart:249-275 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/autocomplete/autocomplete_cache_database.dart"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"faeb41a3e63b94b391b417f46303963e493c9f80c51676e0b4529de11890eb27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): lib/data/datasources/remote/danbooru_api_service.dart:265-292 | lib/data/datasources/remote/danbooru_api_service.dart:431-460 | lib/data/datasources/remote/danbooru_api_service.dart:464-493 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 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/data/datasources/remote/danbooru_api_service.dart"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"426818f5cf78bd21b4964d6815a21e38bfb715a7dcf72fa08c3b66a024400e53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): lib/core/database/datasources/gallery_favorite_tag_repository.dart:188-224 | lib/core/database/datasources/gallery_favorite_tag_repository.dart:226-260 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/datasources/gallery_favorite_tag_repository.dart"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7517301d631f6e79162da635ff2d82393b94beee175ee3a9d9de3a3af85049"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): lib/presentation/screens/precise_ref_library/widgets/precise_ref_card.dart:135-164 | lib/presentation/screens/vibe_library/widgets/vibe_card.dart:234-262 \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/presentation/screens/precise_ref_library/widgets/precise_ref_card.dart"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfaf632151af877006244e57cb409021086de539a3c99546b77f1ff0488a7ed0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): lib/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart:59-96 | lib/presentation/screens/vibe_library/widgets/vibe_image_encode_dialog.dart:621-652 \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/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc80d1ea1b117cd051431f56a3f2d378b12fd89e6c5db4863e160f4e058d7d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): lib/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart:497-527 | lib/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart:529-563 \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/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"577dacc21a4c8d1f25b3681ad47a2277f9d52f3db65ecc0f0b7412e026d608dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): lib/presentation/widgets/online_gallery/online_gallery_card_status_overlays.dart:188-217 | lib/presentation/widgets/online_gallery/online_gallery_card_status_overlays.dart:225-250 \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/presentation/widgets/online_gallery/online_gallery_card_status_overlays.dart"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"450170a09e3b21504c8b07d7e8371d1916e054f0710780e2356945acf42d7981"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 25\u002B corresponding lines): lib/presentation/screens/cloud_sync/cloud_sync_ffdkj_prompt.dart:34-62 | lib/presentation/widgets/online_gallery/output_filter_settings_panel.dart:96-120 | lib/presentation/widgets/prompt/random_manager/preset_selector_bar.dart:314-347 | lib/presentation/widgets/prompt/random_manager/preset_selector_bar.dart:349-379 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 25 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/presentation/screens/cloud_sync/cloud_sync_ffdkj_prompt.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce224e7640c0d2258c01c7e536223ab423e81c38b27643002d26a43f4e8ffe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): lib/presentation/screens/statistics/widgets/dashboard/anlas_cost_card.dart:491-527 | lib/presentation/screens/statistics/widgets/dashboard/other_stats_card.dart:63-93 \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/presentation/screens/statistics/widgets/dashboard/anlas_cost_card.dart"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f2a407158621de9fb90038332f6a6a64f92308d4c263bea444bbca515a627e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): lib/presentation/widgets/prompt/diy/diy_empty_state.dart:18-57 | lib/presentation/widgets/prompt/random_manager/tag_group_diy_tab.dart:96-126 \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/presentation/widgets/prompt/diy/diy_empty_state.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"53882a741eb5f3feffd0acfdc50f844f411230ef2511645b9719965ec05f8dc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): lib/core/agent/harness/env/dart_io_execution_env.dart:170-192 | lib/core/agent/harness/env/dart_io_execution_env.dart:194-216 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/harness/env/dart_io_execution_env.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"60aefa6b4284a452ac1ea25c7b0542776c12781af1e926685d44dfd5d0a41f93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): lib/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart:239-270 | lib/presentation/screens/vibe_library/widgets/vibe_image_encode_dialog.dart:240-267 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4487a3ca8dd6f2c602eb85ac178da3fd98481be7e224b43ee666616d50149be4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): lib/presentation/widgets/character/inline_character_card.dart:146-173 | lib/presentation/widgets/character/inline_character_row.dart:339-360 \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/presentation/widgets/character/inline_character_card.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"144b48181ad7e6f8464cc3bdc772d830935554ac44498549acdba9d26bbebb71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/presentation/screens/tag_library_page/widgets/entry_add_dialog.dart:455-475 | lib/presentation/widgets/prompt/fixed_tag_edit_dialog.dart:286-306 \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/presentation/screens/tag_library_page/widgets/entry_add_dialog.dart"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad2ffde0e7d8a5281d5daa9369ffd9296b2936e27db8ad95daa30259d7846d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): lib/presentation/screens/tag_library_page/widgets/entry_card.dart:524-550 | lib/presentation/widgets/common/image_card_surface.dart:494-523 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/tag_library_page/widgets/entry_card.dart"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89dd1fbbb46ae250756f7eec8da07aa73720b9cefe2036665d2be50a45d7768"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): lib/core/utils/vibe_performance_diagnostics.dart:28-53 | lib/core/utils/vibe_performance_diagnostics.dart:55-80 \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/core/utils/vibe_performance_diagnostics.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b4ddab40339ff2c2b8be6dd53e4192393e525f862fed03723d90bc61f66c43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): lib/core/autocomplete/cooccurrence_data_pack_protocol.dart:57-83 | lib/presentation/providers/queue_execution_provider.dart:77-108 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/autocomplete/cooccurrence_data_pack_protocol.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43afe2dbd40afed289650865b63792238f9a02ea8d902a8ce8a08ec2849f1b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): lib/core/database/datasources/gallery_image_repository.dart:268-301 | lib/core/database/datasources/gallery_metadata_repository.dart:247-289 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/datasources/gallery_image_repository.dart"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"84843dc3fcc0a015e39591b00929f7127cee05185b90382c2ac280ff8c423ad7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): lib/data/services/online_gallery/quick_tag_cloud_remote_catalog_service.dart:761-783 | lib/data/services/online_gallery/quick_tag_cloud_remote_catalog_service.dart:785-808 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/online_gallery/quick_tag_cloud_remote_catalog_service.dart"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8863c62113c84e267ebd1a649ee661aeab055225075e28661b4d69912f0f55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): lib/presentation/widgets/prompt/diy/panels/post_process_rule_panel.dart:383-412 | lib/presentation/widgets/prompt/diy/panels/visibility_rule_panel.dart:297-320 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/diy/panels/post_process_rule_panel.dart"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"a958c75420518bcaa3fd00d14943cf76133defcfd79d7a4d35de4af7371ac2b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): lib/presentation/widgets/prompt/fixed_tags_button.dart:400-432 | lib/presentation/widgets/prompt/fixed_tags_button.dart:519-548 \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/presentation/widgets/prompt/fixed_tags_button.dart"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"def46d0d5cc5e648c2ad9b0da10c46c61090c20172ad968ce47a947353bf78b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): lib/presentation/widgets/autocomplete/autocomplete_wrapper.dart:59-88 | lib/presentation/widgets/autocomplete/autocomplete_wrapper.dart:90-120 \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/presentation/widgets/autocomplete/autocomplete_wrapper.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"27912f0f95230c38e273f56fa5de941ded8845c959e84920031c1e6ba5df3512"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): lib/presentation/widgets/prompt/diy/diy_rule_list_card.dart:165-193 | lib/presentation/widgets/prompt/diy/panels/time_condition_panel.dart:633-666 \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/presentation/widgets/prompt/diy/diy_rule_list_card.dart"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"5150393cb46fe11ec746078bf6afdea788fbd94d8d46f31becf61bdf14a45c4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/core/utils/hard_edge_mask_exporter.dart:181-201 | lib/core/utils/inpaint_outpaint_utils.dart:1127-1147 \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/core/utils/hard_edge_mask_exporter.dart"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f7018256bded9ebce87b411abc8060b97f6ece6ef1a62d91ed7677d0f94dc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): lib/data/models/mosaic/mosaic_settings.dart:57-85 | lib/data/models/watermark/watermark_settings.dart:297-322 \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/data/models/mosaic/mosaic_settings.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd48fef687fc075c5232f07c2d37c51a76b61643619ea263bb0b9d9b3d58a781"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): lib/presentation/widgets/model3d_editor/model3d_editor_screen.dart:195-214 | lib/presentation/widgets/model3d_editor/model3d_editor_screen.dart:368-387 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/model3d_editor/model3d_editor_screen.dart"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb3a6a2fa7cadbfe476ec013259a07ff0e0c7fb7a74f4201fb896bc50975198"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): lib/presentation/screens/auth/login_screen.dart:1105-1130 | lib/presentation/screens/auth/login_screen.dart:1183-1205 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/auth/login_screen.dart"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fb4aca0922bd02fbdf0ecaaf9d514ef1b4c2adf8baac1d0d1660603f867c50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): lib/presentation/widgets/common/save_vibe_dialog.dart:377-411 | lib/presentation/widgets/prompt/diy/dialogs/preset_import_dialog.dart:365-401 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/save_vibe_dialog.dart"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e346c4bf67223a4c77a7c4f8b3020212ba76ebee4d3a9c00d0facf735f76757"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/presentation/widgets/image_editor/widgets/toolbar/desktop_toolbar.dart:182-200 | lib/presentation/widgets/image_editor/widgets/toolbar/mobile_toolbar.dart:159-176 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/image_editor/widgets/toolbar/desktop_toolbar.dart"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdde319f12d100154d8ae37dd605aeab66cc0eb3935828b7092d93b6a961cbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): lib/presentation/widgets/auth/network_troubleshooting_dialog.dart:12-36 | lib/presentation/widgets/common/image_detail/components/prompt_copy_dialog.dart:23-52 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/auth/network_troubleshooting_dialog.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a493264fcdd3965ce2c2a132caa1169eac2ce60f88af2ee637e8b857b3d3ea0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): lib/data/datasources/remote/danbooru_api_service.dart:390-419 | lib/data/datasources/remote/danbooru_api_service.dart:555-578 | lib/data/datasources/remote/danbooru_api_service.dart:596-621 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 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/data/datasources/remote/danbooru_api_service.dart"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2011de2b1db969318a34480b78074ef10ad84bdf411ace5fc18bdb52becd02c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): lib/presentation/providers/generation/generation_settings_notifiers.dart:148-174 | lib/presentation/providers/generation/generation_settings_notifiers.dart:242-268 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/generation/generation_settings_notifiers.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"04dcba99ab7264a5b7e01d3fc1eabb6d803e316b13d52da2e7f6bf39f8b23b7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): lib/presentation/widgets/image_editor/widgets/panels/canvas_size_dialog.dart:294-316 | lib/presentation/widgets/image_editor/widgets/panels/canvas_size_dialog.dart:318-340 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/image_editor/widgets/panels/canvas_size_dialog.dart"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"f683455507a71bf4a8757b3b06ea2be9031e06570f2d0f8134a8430d5fb591c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): lib/core/cloud_sync/data_source.dart:42-63 | lib/core/cloud_sync/snapshot_uploader.dart:313-335 \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/core/cloud_sync/data_source.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"361511209873f43dffd5694b706df8c46f672e1e313650f143986fdc03843aa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): lib/core/autocomplete/autocomplete_settings.dart:36-67 | lib/core/cloud_sync/content_selection.dart:49-79 | lib/presentation/providers/share_image_settings_provider.dart:51-82 \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/core/autocomplete/autocomplete_settings.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8a841d8d1cd7dd0c47a9725b2002c13c03aa53c0b193ab356441580ae22c78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): lib/data/cloud_sync/fixed_tag_usage_cloud_sync_adapter.dart:125-152 | lib/data/cloud_sync/fixed_tag_usage_cloud_sync_adapter.dart:154-179 \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/data/cloud_sync/fixed_tag_usage_cloud_sync_adapter.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b973114a2660db7275dd37056ede99ba7e1e41a0266bc23f4b4b6714d34f5305"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/presentation/screens/generation/widgets/comfyui_workflow_dialog.dart:339-362 | lib/presentation/screens/generation/widgets/img2img_panel_coordinator.dart:35-52 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/widgets/comfyui_workflow_dialog.dart"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1aa85e29947b133cfe63b7303f18fdebe1e8d49be44de87e65b805919ef43d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): lib/presentation/widgets/auth/account_avatar.dart:48-77 | lib/presentation/widgets/auth/account_avatar.dart:158-181 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/auth/account_avatar.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6183739152b8b570ba87c8a99202531b6cfd2ad6bd2d1009c99fb2706f23278"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/presentation/widgets/image_editor/widgets/panels/layer_panel.dart:153-173 | lib/presentation/widgets/image_editor/widgets/panels/layer_panel.dart:175-197 \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/presentation/widgets/image_editor/widgets/panels/layer_panel.dart"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f56d6739b420c3d3fab120808a88c9d7781db267215fa48e3967845f4b8ebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/core/agent/harness/session/jsonl/session_jsonl_storage.dart:347-367 | lib/core/agent/harness/session/session_memory.dart:60-78 \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/core/agent/harness/session/jsonl/session_jsonl_storage.dart"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d29c571a067f9c3d92e692e2c4857fba7e4ebab3edaa4a48e5d8970db60c367"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/core/database/datasources/gallery_album_repository.dart:366-380 | lib/core/database/datasources/gallery_album_repository.dart:382-397 \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/core/database/datasources/gallery_album_repository.dart"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"6968747693edeb5aea511c300ec7b8c4d8b146dc450b83464a1d7a70dfd136e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): lib/presentation/agent_chat/services/generation_preparation_service.dart:98-122 | lib/presentation/agent_chat/services/generation_preparation_service.dart:737-761 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/generation_preparation_service.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bd6a4fe922d0e877509d3da53d5f7aef63a93c11eca895b38c2375828b7438"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): lib/presentation/screens/settings/widgets/workflow_import_wizard.dart:27-52 | lib/presentation/widgets/online_gallery/gallery_generation_transfer_dialog.dart:21-48 | lib/presentation/widgets/prompt/new_preset_dialog.dart:30-56 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 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/presentation/screens/settings/widgets/workflow_import_wizard.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"0590c54160efa8874bd420d7c5a04e93c19a15b5e1d87581022d276bcdcbde29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 22\u002B corresponding lines): lib/presentation/screens/tag_library_page/widgets/export_dialog.dart:25-55 | lib/presentation/screens/tag_library_page/widgets/import_dialog.dart:26-51 | lib/presentation/screens/tag_library_page/widgets/send_to_home_dialog.dart:41-68 | lib/presentation/screens/vibe_library/widgets/vibe_export_dialog.dart:91-121 | lib/presentation/widgets/drop/prompt_library_entry_dialog.dart:80-110 | lib/presentation/widgets/shortcuts/shortcut_help_dialog.dart:22-43 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/tag_library_page/widgets/export_dialog.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"72159272da326a443ec12d7bead40d14df9a564789d1a14495d66e5e30de042d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart:250-268 | lib/core/cloud_sync/backend/onedrive_cloud_sync_backend.dart:198-216 \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/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"19835550dcfef1f56ae5f01ece7b330f8d7492c7fe41cdbebedea7b507bc07c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/presentation/widgets/auth/credentials_login_form.dart:275-295 | lib/presentation/widgets/auth/token_login_card.dart:306-326 \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/presentation/widgets/auth/credentials_login_form.dart"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"796a1215c244192504203c64a722b39c4542ff46999252b78df750d233dfd6e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): lib/presentation/widgets/common/app_toast.dart:378-397 | lib/presentation/widgets/common/app_toast.dart:559-585 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/app_toast.dart"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0aad7b28b5a4480de94177a18024791468935073ea3a2021e7d2ec36bc874b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): lib/presentation/widgets/prompt/diy/panels/dependency_config_panel.dart:151-175 | lib/presentation/widgets/prompt/diy/panels/dependency_config_panel.dart:465-491 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/diy/panels/dependency_config_panel.dart"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a887c7b0b094aa70dedbda5d16e77a6f26cb7455940aa927fddf207aed11ed11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/data/services/inpaint_draft_file_repository.dart:447-468 | lib/data/services/inpaint_draft_file_repository.dart:470-487 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/inpaint_draft_file_repository.dart"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2fcd733ecd5754f8b3cc440fc600a7af9ff67f2bb81b42bd69ad71f0d6beb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/presentation/prompt_assistant/services/prompt_assistant_service.dart:351-363 | lib/presentation/prompt_assistant/services/prompt_assistant_service.dart:365-377 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/services/prompt_assistant_service.dart"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0eed0a37780984a45c29821c0a6cb2ba2f322e4a4d139f00e7caf70df22bb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 21\u002B corresponding lines): lib/presentation/services/library_sidebar_move_service.dart:21-41 | lib/presentation/services/library_sidebar_move_service.dart:43-63 | lib/presentation/services/library_sidebar_move_service.dart:65-92 | lib/presentation/services/library_sidebar_move_service.dart:94-119 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/services/library_sidebar_move_service.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"470239e54740f5c2bce079ab45546797f5bf18228e01e94e700277bb2390d3c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/presentation/widgets/discord_share/discord_share_dialog.dart:912-937 | lib/presentation/widgets/drop/prompt_library_entry_dialog.dart:668-685 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/discord_share/discord_share_dialog.dart"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f68abe63a4f3a5052c11d92a13c28ecf0844827ad0c5a3a1af6c368b21d7b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/presentation/providers/fixed_tags_provider.dart:232-249 | lib/presentation/providers/fixed_tags_provider.dart:251-272 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/fixed_tags_provider.dart"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed338a015c6e26da1ea5d5792ab49344f1344904e24fe388e19d3fe451bfc81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): lib/presentation/screens/generation/widgets/comfyui_workflow_dialog.dart:608-630 | lib/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_option_card.dart:246-270 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/widgets/comfyui_workflow_dialog.dart"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"709781b8b8b5b31e827e91c3ee82bb938bc2c08424d8dea4cc2b0ed2e8175c40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): lib/presentation/widgets/prompt/diy/panels/dependency_config_panel.dart:290-316 | lib/presentation/widgets/prompt/diy/panels/dependency_config_panel.dart:361-387 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/diy/panels/dependency_config_panel.dart"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdda1456cb24b04ea39103e228aa6aa2c5a0ac78be47351087cd19d33f8d87eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/data/models/mosaic/mosaic_settings.dart:197-219 | lib/data/services/dlss/dlss_options.dart:46-66 \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/data/models/mosaic/mosaic_settings.dart"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"193922859f86240518a5d5c184236468ebcfd564233da06ea0723ffb0b428056"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): lib/presentation/widgets/common/image_detail/file_image_detail_data.dart:51-78 | lib/presentation/widgets/common/image_detail/image_detail_data.dart:99-135 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/image_detail/file_image_detail_data.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a19c0fe16962c8697810f91ba6b80f826f1af1f09687c6d17c38473afb5e5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/presentation/screens/settings/sections/storage_settings_section.dart:38-58 | lib/presentation/screens/settings/sections/storage_settings_section.dart:424-447 \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/presentation/screens/settings/sections/storage_settings_section.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2787216563a3c2fc894bc3beef2ede68e96f81b8a899c5f6883bce8c3752f6ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): lib/core/cloud_sync/backend/webdav_capability_probe.dart:310-329 | lib/core/cloud_sync/backend/webdav_cloud_sync_backend.dart:523-544 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/backend/webdav_capability_probe.dart"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1546110d79294777d0cc21abe67ceab215bcabd3df53c3877ec21ea33c9d9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): lib/presentation/screens/statistics/widgets/dashboard/anlas_cost_card.dart:341-368 | lib/presentation/widgets/common/hover_preview_card.dart:176-198 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/statistics/widgets/dashboard/anlas_cost_card.dart"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"5203713a794bc4e63971d4c2aa875416f46f2b08cd5cf48f73379cbf95550eb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): lib/core/storage/queue_state_storage.dart:66-88 | lib/presentation/providers/generation/batch_generation_notifier.dart:118-145 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/storage/queue_state_storage.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"4047b05b3f8faa6aab8e9b8f7bd1a80d26ff724a9988d1d043b451010b47e6e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/presentation/screens/precise_ref_library/widgets/precise_ref_card.dart:98-124 | lib/presentation/screens/precise_ref_library/widgets/precise_ref_selector_dialog.dart:400-415 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/precise_ref_library/widgets/precise_ref_card.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"17efb061b65e87f4ec7279d9b3e0d1ea35fe3069c4e7bc2f706d3da8a4f931dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/data/services/official_random_prompt_generator.dart:365-373 | lib/data/services/official_random_prompt_generator.dart:917-930 \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/data/services/official_random_prompt_generator.dart"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cf592b268fa1a2bb58128eb8483e12dfd9668b14e3921ab97c0ef0480e0f1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/data/services/precise_ref_library_archive_service.dart:293-307 | lib/data/services/tag_library_io_service.dart:457-472 \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/data/services/precise_ref_library_archive_service.dart"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a79df427ad4590b75d10bc0e0c7dcf823b136402433836463410d7bf04e45af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/presentation/widgets/navigation/nav_rail_items.dart:114-135 | lib/presentation/widgets/navigation/nav_rail_items.dart:169-186 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/navigation/nav_rail_items.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ee61f352b5a983323fe7303b670063bba992a6a604b27a40602bc566550812"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/data/services/inpaint_draft_file_repository.dart:491-505 | lib/data/services/inpaint_draft_file_store.dart:55-71 \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/data/services/inpaint_draft_file_repository.dart"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"471cfb6fae47e59c68406f4be5fb3c0003001df82f530120768faeec841d0854"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/presentation/providers/online_gallery_command_service.dart:395-412 | lib/presentation/providers/online_gallery_command_service.dart:414-434 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/online_gallery_command_service.dart"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"927797c842a18fd8a3936d684f08c8eaf12f5eaa7f96f12f3fb35ecbd984410b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/presentation/providers/vibe_library_provider.dart:417-433 | lib/presentation/providers/vibe_library_provider.dart:435-452 \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/presentation/providers/vibe_library_provider.dart"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c67601ac02ebacdc2fd83166f1dd604bdc43a55b3605377088883eb4ac053ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): lib/core/utils/inpaint_mask/inpaint_mask_operations.dart:1337-1352 | lib/core/utils/inpaint_mask/inpaint_mask_operations.dart:1354-1368 | lib/core/utils/inpaint_mask/inpaint_mask_operations.dart:1606-1626 \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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4334bc5f166a09ee7261e9c5b6c852c58d0cf4ea99b2b8de0cf0fce52f766e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): lib/data/cloud_sync/strict_hive_cloud_sync_adapter.dart:161-184 | lib/data/cloud_sync/strict_hive_cloud_sync_adapter.dart:186-207 \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/data/cloud_sync/strict_hive_cloud_sync_adapter.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfda45e1b64841734469dc438a1c447c1b8ea550050c4d17ba5fd48b34a36ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/data/services/gallery/gallery_stream_scanner.dart:70-90 | lib/presentation/providers/gallery_scan_progress_provider.dart:44-64 \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/data/services/gallery/gallery_stream_scanner.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2de74b6339e8c26baefe0cd00b5f54f8ddab554fa9b0d84a04ef5cd154f9fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): lib/presentation/agent_chat/services/generation_image_workflow_toolbox.dart:10-41 | lib/presentation/agent_chat/services/generation_resource_toolbox.dart:105-132 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/generation_image_workflow_toolbox.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0cec4eb60b81d05d21fc0724429cbfec94de55bdf493731819ce184ecd4719"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): lib/core/agent/harness/session/session_memory.dart:147-166 | lib/core/agent/harness/session/session_memory.dart:185-209 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/harness/session/session_memory.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4b47ce7e92ea0e7359dd7600cded17353ce45f905677f1c58ded6ba0d37031"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/core/comfyui/comfyui_models.dart:44-64 | lib/presentation/providers/comfyui/comfyui_provider.dart:827-850 \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/core/comfyui/comfyui_models.dart"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f966e185880738b5b0c220cf2bd7e17543b3d4b5dc5faa2d5a579721c1c5235"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): lib/core/utils/inpaint_outpaint_utils.dart:467-491 | lib/core/utils/inpaint_outpaint_utils.dart:865-889 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/inpaint_outpaint_utils.dart"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3895f8a9fbb15d4916cebaa1ed520c9dab7618a482530e8673858440e3dc4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/data/services/gallery/gallery_scan_coordinator.dart:48-64 | lib/data/services/gallery/local_gallery_service_impl.dart:60-81 \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/data/services/gallery/gallery_scan_coordinator.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"97abef10827ef67cd91421874b6a1346d72a3c72e24103f4b0b71a31ecc1e385"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): lib/presentation/widgets/image_editor/frame/frame_tool_panel.dart:72-95 | lib/presentation/widgets/image_editor/tools/closed_region_fill_tool.dart:56-80 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/image_editor/frame/frame_tool_panel.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36f4a7ea4f14a6464451d670512da18af8dfae4ffdbff00564f40652332b17a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): lib/core/services/pixel_snap/internal/pixel_snap_executor.dart:111-130 | lib/core/services/pixel_snap/internal/pixel_snap_executor.dart:132-151 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/services/pixel_snap/internal/pixel_snap_executor.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6348b7d78512d48ad8258d878f86b8ba19205b0b535c23f36fc15ffe38e52486"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): krita_plugin/preflight.py:124-138 | krita_plugin/preflight.py:142-159 \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":"krita_plugin/preflight.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db51c530bc6c92a54720d16cb89b32b5d01451636e0116814062d42178d1a36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/presentation/screens/local_gallery/local_gallery_screen_controller.dart:299-314 | lib/presentation/screens/local_gallery/local_gallery_screen_controller.dart:432-448 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/local_gallery/local_gallery_screen_controller.dart"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6cd4e769e2e858b7c57a0b97b0d5f7a74adf90bd2ab5fdd5dfc0ba5f9ec9f8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/presentation/agent_chat/widgets/agent_chat_panel_coordinator.dart:478-495 | lib/presentation/agent_chat/widgets/agent_chat_panel_coordinator.dart:497-512 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/widgets/agent_chat_panel_coordinator.dart"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"5802540d03c0d28925c55ec55a1823145d9b67528b0b01076ef13c8ec52e0156"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): lib/presentation/screens/tag_library_page/widgets/export_dialog.dart:70-95 | lib/presentation/screens/tag_library_page/widgets/import_dialog.dart:671-694 | lib/presentation/screens/vibe_library/widgets/vibe_export_dialog.dart:145-172 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 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/presentation/screens/tag_library_page/widgets/export_dialog.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c534a65c413b21204083dd5166ddb05e7d08d28300209265a9a73f76d817d12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): lib/core/cloud_sync/backend/github_cloud_sync_backend.dart:112-133 | lib/core/cloud_sync/backend/webdav_cloud_sync_backend.dart:133-155 \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/core/cloud_sync/backend/github_cloud_sync_backend.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5206a7a404af4ba2b70e326ed2952270d59e507978240e64d7575679f855d39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): lib/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart:783-809 | lib/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart:811-838 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9367d06e6020fbde20dfdedd2ceec58d5f6a32305c868b91a1468c8fb1b9f6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/presentation/providers/online_gallery_blacklist_provider.dart:169-184 | lib/presentation/providers/online_gallery_blacklist_provider.dart:186-200 \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/presentation/providers/online_gallery_blacklist_provider.dart"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"78aa614ff78819a62db0406e630559c2490356fdb27d7ee0080d0dcd9d44a9db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/presentation/screens/generation/widgets/image_preview.dart:872-890 | lib/presentation/screens/generation/widgets/image_preview.dart:938-961 \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/presentation/screens/generation/widgets/image_preview.dart"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"697ee0f08ae19e1734c6546b972bf0dd6e66bc936779eec8f0efe77cfd49c655"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/presentation/widgets/common/image_card_actions.dart:326-343 | lib/presentation/widgets/common/image_card_actions.dart:353-370 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/image_card_actions.dart"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa56e4f35677f2227319c5f6e87c684e0b91bad6ba7ca19eba2c46035e648dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): lib/presentation/widgets/prompt/global_settings_dialog.dart:105-121 | lib/presentation/widgets/prompt/global_settings_dialog.dart:123-139 | lib/presentation/widgets/prompt/global_settings_dialog.dart:153-166 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/global_settings_dialog.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c4212c7e10a6e6654c56f64ee836b85cd24425ce3cbc7f7312a735d2346452"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): lib/presentation/themes/modules/color/palettes/material_you_palette.dart:42-61 | lib/presentation/themes/modules/color/palettes/system_palette.dart:27-44 | lib/presentation/themes/modules/color/palettes/system_palette.dart:46-62 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/themes/modules/color/palettes/material_you_palette.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fc04c3dd63c8a39fee93b5ec5d32d28a6db6eb08647353724af33382c3f221"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/presentation/widgets/common/themed_input.dart:265-289 | lib/presentation/widgets/prompt/tag_mode_prompt_field.dart:105-121 \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/presentation/widgets/common/themed_input.dart"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4d913126b3fcaef45d9b157928338bc145f1d9ea7dc73b912764bf010cafc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): android/app/src/main/kotlin/com/aaalice/nai_launcher/AndroidFileExportChannel.kt:59-85 | android/app/src/main/kotlin/com/aaalice/nai_launcher/AndroidFileExportChannel.kt:160-188 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/com/aaalice/nai_launcher/AndroidFileExportChannel.kt"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd35a3dafa0d9fab881edf631e1b2ae1ecda5290ad4c3f479b3a8ffffd4b483b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): lib/presentation/screens/cloud_sync/cloud_sync_widgets.dart:138-160 | lib/presentation/screens/settings/sections/mcp_server/mcp_server_connection_card.dart:418-443 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/cloud_sync/cloud_sync_widgets.dart"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5b28a69c9f0a63227ce1cfd7ccf32c4dc64c9a26833ce6dc2b9ece43bda215"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/presentation/screens/settings/sections/privacy_settings_section.dart:62-76 | lib/presentation/screens/settings/sections/privacy_settings_section.dart:78-92 \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/presentation/screens/settings/sections/privacy_settings_section.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"05044f7b1d9c5740b052a975196231dc7e77a60b54dbe3449470082a092abbb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/presentation/screens/tag_library_page/widgets/export_dialog.dart:235-260 | lib/presentation/widgets/common/image_detail/components/prompt_copy_dialog.dart:145-162 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/tag_library_page/widgets/export_dialog.dart"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"c029b5d6d073e054b324aa51b8ca3ae10250256a3589645a299c17d8678cd328"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/presentation/widgets/queue/queue_management_page.dart:664-685 | lib/presentation/widgets/queue/queue_management_page.dart:687-707 \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/presentation/widgets/queue/queue_management_page.dart"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"94863545575d8b460d50091fa69022a0d18efe8877ec39533e5c58033fca19fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/data/repositories/gallery_category_repository.dart:733-756 | lib/data/repositories/gallery_folder_repository.dart:64-81 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/repositories/gallery_category_repository.dart"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e9ce0ba32a749554fdf624f1ceb24597a72ac5a042c29acac206add20103b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/data/services/online_gallery/artist_chain_parser.dart:327-341 | lib/data/services/online_gallery/artist_chain_parser.dart:343-356 \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/data/services/online_gallery/artist_chain_parser.dart"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a928fe44cb3fe18361aeaf186cd6ea1ea373b7df5087957235e63d99f56a3b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): lib/presentation/prompt_assistant/widgets/prompt_assistant_custom_dialog.dart:33-53 | lib/presentation/screens/precise_ref_library/widgets/precise_ref_selector_dialog.dart:38-61 | lib/presentation/widgets/prompt/diy/dialogs/preset_import_dialog.dart:44-66 | lib/presentation/widgets/prompt/regex_rules_dialog.dart:432-450 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/widgets/prompt_assistant_custom_dialog.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8082c26adb911a7a0a9dbdfa46ad52da76c8614212af13d60e3b032635d36ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/presentation/screens/generation/widgets/prompt_tooltip_components.dart:27-47 | lib/presentation/screens/generation/widgets/prompt_tooltip_components.dart:55-75 \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/presentation/screens/generation/widgets/prompt_tooltip_components.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de2f010ed0d9f32f2f6065e457b09897e0e50d848a780b9a9ab8108237f7b2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/presentation/widgets/drop/dropped_image_inspector.dart:118-136 | lib/presentation/widgets/drop/dropped_image_inspector.dart:138-157 \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/presentation/widgets/drop/dropped_image_inspector.dart"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd21a626cbbce8a2261230285aa900f54e1d1f40fda450accd16cc1278a318b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/data/repositories/gallery_category_repository.dart:313-326 | lib/data/repositories/gallery_category_repository.dart:443-459 \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/data/repositories/gallery_category_repository.dart"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"5023058224c4760d25f246121cfa71d9e44fda3d135f28f35306aeefde2f30bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/presentation/screens/online_gallery/online_gallery_masonry_layout.dart:109-122 | lib/presentation/screens/online_gallery/online_gallery_masonry_layout.dart:124-137 \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/presentation/screens/online_gallery/online_gallery_masonry_layout.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"400a09256c503c808211417753c31af2cb88eba5caaece70887ddd37316b8b2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart:94-110 | lib/core/cloud_sync/backend/onedrive_cloud_sync_backend.dart:78-96 \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/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59ebf0571f5cc85e2246a719ebe040e25dc288e1b2e486fa3374cfc6e389616"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): lib/presentation/screens/precise_ref_library/precise_ref_library_screen.dart:273-296 | lib/presentation/screens/vibe_library/widgets/vibe_detail/vibe_preview_drop_zone.dart:107-128 \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/presentation/screens/precise_ref_library/precise_ref_library_screen.dart"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d007652f69d19603c60deab279da374d3fc82b2de277356c17ec3dc88cd503d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): lib/data/datasources/remote/nai_image_generation_api_service.dart:87-111 | lib/data/datasources/remote/nai_image_generation_api_service.dart:134-153 | lib/data/datasources/remote/nai_image_generation_api_service.dart:155-174 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/datasources/remote/nai_image_generation_api_service.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"22340ba8d233af21544bca2a9ab1c100a8ebdff83a2d9c0a760fb2eab98430a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): lib/presentation/widgets/common/image_detail/components/prompt_copy_dialog.dart:54-72 | lib/presentation/widgets/image_editor/effects/effects_preview_dialog.dart:42-64 | lib/presentation/widgets/image_editor/widgets/panels/color_panel.dart:96-117 | lib/presentation/widgets/image_editor/widgets/panels/shift_edges_dialog.dart:40-60 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/image_detail/components/prompt_copy_dialog.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7da608756a735439c54676ee025291447be470b9056558d3242e1248ef25b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/core/utils/inpaint_mask/inpaint_mask_operations.dart:1309-1323 | lib/core/utils/inpaint_mask/inpaint_mask_operations.dart:1325-1335 \u2014 These two members are one piece of code written twice and then edited apart: 11 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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0fcc4681f65b313becd4b62831cd58ff43bc15692047dbd66b7e70e502b50f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart:15-31 | lib/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart:15-30 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d892a0857d6498ad0f11cce2e0e5e7b3724271ed3ea1f6a988d8d7ddc89d64ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): lib/presentation/screens/generation/widgets/history_panel/history_panel_header.dart:165-181 | lib/presentation/widgets/gallery/gallery_library_toolbar.dart:135-151 | lib/presentation/widgets/queue/task_list_item.dart:1034-1050 | lib/presentation/widgets/shortcuts/shortcut_tooltip.dart:363-382 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/widgets/history_panel/history_panel_header.dart"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6e5f44bdedf58743b752e8fa77b65afff4491db5fbf87e27d8ce4b67202b79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): lib/presentation/widgets/character/character_tooltip_content.dart:80-98 | lib/presentation/widgets/prompt/diy/diy_badges.dart:40-56 | lib/presentation/widgets/prompt/random_manager/danbooru_preview_content.dart:179-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 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/character/character_tooltip_content.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f843538bddc78132c7aa31b98aa42620af83aad92aa05a6321b956b45dbf6e35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/data/services/inpaint_draft_file_repository.dart:408-424 | lib/data/services/inpaint_draft_file_repository.dart:426-445 \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/data/services/inpaint_draft_file_repository.dart"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac5050542cca065e40ae016db03766afc2c7e1680a290897b31b986b965b7fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): lib/presentation/agent_chat/services/agent_tool_permission_controller.dart:244-263 | lib/presentation/mcp/services/mcp_tool_call_pipeline.dart:185-204 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/agent_tool_permission_controller.dart"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40cac88a76c13a00aee2b7d7a7f48086832475e2981e3cf99345501847e64eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/presentation/screens/local_gallery/local_gallery_action_coordinator.dart:671-686 | lib/presentation/screens/local_gallery/local_gallery_action_coordinator.dart:822-839 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/local_gallery/local_gallery_action_coordinator.dart"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7be6780c6cbc3af3e2c5a8cca53ec7965e4980ec0ced5f4998a1e397514f82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/presentation/widgets/common/update_check_dialog.dart:851-864 | lib/presentation/widgets/common/update_check_dialog.dart:866-879 \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/presentation/widgets/common/update_check_dialog.dart"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c62ee9b7444fa27f27f8847d6f4d145dc57a9ca7a33256c57c51f58ab953deb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/presentation/widgets/shortcuts/shortcut_tooltip.dart:170-193 | lib/presentation/widgets/shortcuts/shortcut_tooltip.dart:344-361 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/shortcuts/shortcut_tooltip.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1749edf4b2efff5ff77af7ca6c5a021cb1eb6d314d2bd642e61e560b2b38cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): lib/core/agent/harness/session/session_state.dart:250-265 | lib/core/agent/harness/session/session_state.dart:300-316 | lib/core/agent/harness/session/session_state.dart:327-342 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/harness/session/session_state.dart"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fe21a15ff6632b79cb6a1791b95b7e804ae6927225b7dad5c54ff4c21d25b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/data/cloud_sync/agent_cloud_sync_adapters.dart:425-444 | lib/data/cloud_sync/verified_blob_store.dart:25-40 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/cloud_sync/agent_cloud_sync_adapters.dart"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9a5c237b03875109d79e134407457831f8b98cae24f97a036c7a8ae638f7b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/presentation/screens/settings/widgets/workflow_import_wizard.dart:464-482 | lib/presentation/screens/settings/widgets/workflow_import_wizard.dart:537-553 \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/presentation/screens/settings/widgets/workflow_import_wizard.dart"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7656d8c06276c370d852f6e5c4f90c9579dffa5dca1fbded7c0a09d652ddd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/presentation/screens/tag_library_page/widgets/entry_list_item.dart:509-527 | lib/presentation/widgets/image_editor/widgets/panels/layer_panel.dart:775-792 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/tag_library_page/widgets/entry_list_item.dart"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"0beb7460109bcbe4147278bff4abd16d12add858013e75f8f238f1fa92e51067"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/data/services/vibe_library_hive_repository.dart:51-69 | lib/data/services/vibe_library_hive_repository.dart:91-109 \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/data/services/vibe_library_hive_repository.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8820c87954c5d31b3e401f19bde32e5042707a04e7f17ae850b70ca56506d2e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/presentation/screens/generation/widgets/img2img_source_section.dart:366-388 | lib/presentation/widgets/common/image_detail/image_detail_viewer.dart:875-889 \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/presentation/screens/generation/widgets/img2img_source_section.dart"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b1b54eee15aa652f6697842607f1ce539101a64fe73d6ce5e3bc0366da4ac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/presentation/screens/generation/widgets/prompt_input_toolbar.dart:362-382 | lib/presentation/screens/generation/widgets/prompt_input_toolbar.dart:384-400 \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/presentation/screens/generation/widgets/prompt_input_toolbar.dart"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a9483897a91e0a07e53f3bb3d49999d248012a93c72770e6b6e424b7501fc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/presentation/screens/local_gallery/local_gallery_screen_controller.dart:320-333 | lib/presentation/widgets/prompt/fixed_tags_dialog_coordinator.dart:136-149 \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/presentation/screens/local_gallery/local_gallery_screen_controller.dart"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f192c1d2ff5171eab6a2934dcf69942a31a3078b49aeeda2c659ac4fa66e1b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): tool/cloud_sync/cloud_sync_production_benchmark.dart:350-365 | tool/cloud_sync/cloud_sync_production_benchmark.dart:373-384 \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":"tool/cloud_sync/cloud_sync_production_benchmark.dart"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6ca1f540453e7e20a8b8f712a039c499a9ae5dc5f4a77467c1361dc1e1abac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/presentation/providers/online_gallery_local_favorites_provider.dart:74-91 | lib/presentation/providers/online_gallery_local_favorites_provider.dart:93-110 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/online_gallery_local_favorites_provider.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b80407a94aacd9795ccb91fb25f9ac6bb8b5a22a016897e31077cbeace878cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/presentation/widgets/common/image_detail/image_detail_viewer.dart:770-786 | lib/presentation/widgets/common/image_detail/image_detail_viewer.dart:788-804 \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/presentation/widgets/common/image_detail/image_detail_viewer.dart"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6ce48d64bba44f41b7fafea44a03f0bea9ae047e27516a35a5a3f36b195b82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/presentation/widgets/common/weight_adjust_toolbar.dart:356-368 | lib/presentation/widgets/prompt/tag_editor_view.dart:400-412 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/weight_adjust_toolbar.dart"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab748695a56a8ffbf04d263a2cf4aa40c6b8d66e1cdf9de352cc4353e74d3d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/presentation/widgets/online_gallery/gallery_detail_tag_section.dart:110-128 | lib/presentation/widgets/online_gallery/gallery_detail_tag_section.dart:142-160 \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/presentation/widgets/online_gallery/gallery_detail_tag_section.dart"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8c681f90efd4ee553d183b5f88d87ff90ea5921f53a08f553a16c9a1aad545"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/core/krita/krita_outbound_image.dart:67-78 | lib/presentation/screens/vibe_library/widgets/vibe_export_dialog.dart:651-662 \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/core/krita/krita_outbound_image.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae9666b85cd3b40831f302f700045c316dc373e1bb92f38168b3686e9d96a77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/core/storage/secure_storage_service.dart:426-442 | lib/core/storage/secure_storage_service.dart:473-486 \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/core/storage/secure_storage_service.dart"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ad1447ba8083837c8a311e4c1ca6c7e1316afb3be9442a7d21878f88d9543d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): lib/data/datasources/remote/danbooru_api_service.dart:80-97 | lib/data/datasources/remote/danbooru_api_service.dart:113-131 | lib/data/datasources/remote/danbooru_api_service.dart:495-509 \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/data/datasources/remote/danbooru_api_service.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a48b97ca0956a072d0bdc2784be4a1dc7f2ddfa97d941610a6d1db7eab57106"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/data/services/metadata/ai_tag_generation_parser.dart:217-224 | lib/presentation/screens/statistics/widgets/dashboard/aspect_ratio_card.dart:60-71 \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/data/services/metadata/ai_tag_generation_parser.dart"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb72b1f4a2d2120ec5b42e8822578a7b2eff2dd915fcec4ebc72e0119907a63b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/data/services/vibe_file_repository.dart:557-570 | lib/data/services/vibe_file_repository.dart:572-585 \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/data/services/vibe_file_repository.dart"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"b181f9133b9bf43fdb1f33d8a6920b18b7c1a80a69b78b2cd8e55f500bca55dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/data/services/vibe_library_entry_reader.dart:213-220 | lib/data/services/vibe_library_entry_reader.dart:222-228 \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/data/services/vibe_library_entry_reader.dart"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07af24779a6d2a95e8143e08c7c554af9444706f0f6ed9757bbc220e382ac9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): lib/presentation/mcp/widgets/mcp_approval_banner.dart:20-39 | lib/presentation/widgets/common/update_notice_banner.dart:13-32 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/mcp/widgets/mcp_approval_banner.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e41fb098a9f18187e5e940c5543d975b6be4d25ac47a30ae6d79601a4fff0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/core/agent/harness/session/jsonl/session_jsonl_storage.dart:305-318 | lib/core/agent/harness/session/jsonl/session_jsonl_storage.dart:320-333 \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/core/agent/harness/session/jsonl/session_jsonl_storage.dart"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee21dcf569e06d5e27de240d6c08ac507cf1d098dd42c24e9e06b8cdc2dd64e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart:784-796 | lib/core/cloud_sync/backend/onedrive_api_client.dart:691-703 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0f750770236f7aee0fe3a9296d831f02eccd37ec36558b0db861ab994e29d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/core/utils/character_prompt_block_parser.dart:218-230 | lib/data/services/online_gallery/artist_chain_parser.dart:230-247 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/character_prompt_block_parser.dart"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03ab0d2da9aa79c15db47d00aa41e210059ee44398dc5b132419dff59c28f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/data/models/prompt/diy_category_references.dart:67-82 | lib/data/services/random_preset_rules.dart:147-163 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/models/prompt/diy_category_references.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f355bea428f362a51d656e6054a1290639417cf7598564bd41ba6e483e4b41b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/presentation/screens/generation/widgets/prompt_tooltip_components.dart:506-521 | lib/presentation/widgets/prompt/diy/diy_badges.dart:17-33 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/widgets/prompt_tooltip_components.dart"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"33759dc9f11371b891d4b738db4c580b765b019b97d945815e4a692ab9f4676e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/data/models/watermark/watermark_settings.dart:615-631 | lib/data/models/watermark/watermark_settings.dart:633-648 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/models/watermark/watermark_settings.dart"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdea84b8f7b3af7a347d7c80807e1b0cee41e47006dd75b64d18c894fa006f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/data/services/discord_share_service.dart:538-547 | lib/data/services/metadata/ai_tag_generation_parser.dart:467-476 \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/data/services/discord_share_service.dart"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a9dbfc2c82935fc9c9f20a694661c80301a4c6f89fcdf41161f75b8668862b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): lib/presentation/prompt_assistant/providers/prompt_assistant_config_provider.dart:116-126 | lib/presentation/prompt_assistant/providers/prompt_assistant_config_provider.dart:197-212 | lib/presentation/prompt_assistant/providers/prompt_assistant_config_provider.dart:330-340 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/providers/prompt_assistant_config_provider.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0cf400ced8802c112e105062bbb9afd17a0ebe51d2a6395f6578f028df02fe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/presentation/providers/online_gallery_favorites_loader_service.dart:478-491 | lib/presentation/providers/online_gallery_pagination_service.dart:486-500 \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/presentation/providers/online_gallery_favorites_loader_service.dart"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a80a43d1d31a148f711afce34a163e55e4bdebdc0a8127c72a1f37c3771629"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/presentation/providers/precise_ref_library_provider.dart:325-339 | lib/presentation/providers/precise_ref_library_provider.dart:341-355 \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/presentation/providers/precise_ref_library_provider.dart"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34d98f1a1aa274734a67a480fe3ef80e1fb84952c2261e3d035b2eee330d30b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 17\u002B corresponding lines): lib/presentation/themes/modules/color/palettes/apple_light_palette.dart:20-36 | lib/presentation/themes/modules/color/palettes/brutalist_palette.dart:20-36 | lib/presentation/themes/modules/color/palettes/minimal_glass_palette.dart:23-40 | lib/presentation/themes/modules/color/palettes/neo_dark_palette.dart:23-39 | lib/presentation/themes/modules/color/palettes/pro_ai_palette.dart:23-39 | lib/presentation/themes/modules/color/palettes/retro_palette.dart:22-38 | lib/presentation/themes/modules/color/palettes/retro_wave_palette.dart:25-41 | lib/presentation/themes/modules/color/palettes/social_palette.dart:23-39 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/themes/modules/color/palettes/apple_light_palette.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcaa44f2abe78b352398289dc73f805ce6d2ab62c7e5026281f08d30f2e92ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/presentation/widgets/common/app_toast.dart:399-414 | lib/presentation/widgets/common/app_toast.dart:587-607 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/app_toast.dart"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"394113a0ab357a503b2147cfc4134f517519638e98be85b531a94ea14ba9d797"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/data/datasources/remote/danbooru_api_service.dart:332-349 | lib/data/datasources/remote/danbooru_api_service.dart:351-367 \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/data/datasources/remote/danbooru_api_service.dart"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16ace03d81737510ac83549bfde0b9e16b61538e5de0a5bbed24d67e6eb081e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/data/services/vibe_generation_state_repository.dart:59-78 | lib/data/services/vibe_generation_state_repository.dart:80-97 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/vibe_generation_state_repository.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85218786ac9d714df93c3019e37c304a0a16b7c3f6763d868ba0bb789559e75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/presentation/screens/generation/widgets/prompt_input_coordinator.dart:134-147 | lib/presentation/utils/metadata_import_coordinator.dart:215-228 \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/presentation/screens/generation/widgets/prompt_input_coordinator.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fff16539c6f6bbe495b3234820b6b30ff50bf5ee99ebd6ec9ba6403399a8fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): lib/core/utils/inpaint_outpaint_utils.dart:680-702 | lib/core/utils/inpaint_outpaint_utils.dart:841-863 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/inpaint_outpaint_utils.dart"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3044f41b8cb7f2f2a54088fe35c0a34ba51a55d8cbee3a15261944f5a996a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/main.dart:127-140 | lib/main.dart:149-166 \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/main.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"719c453ae319eaac74959391022af28e17fb4d573b9b3fdda569ce1913873152"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/presentation/prompt_assistant/widgets/prompt_assistant_overlay.dart:226-240 | lib/presentation/screens/generation/widgets/reverse_prompt_panel.dart:477-497 \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/presentation/prompt_assistant/widgets/prompt_assistant_overlay.dart"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"9518fb9f4c745dbe3c244e863089e8228526ef9d17e000926201d704acdb91ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): lib/presentation/themes/modules/color/palettes/editorial_palette.dart:36-50 | lib/presentation/themes/modules/color/palettes/fluid_palette.dart:38-52 | lib/presentation/themes/modules/color/palettes/zen_palette.dart:45-60 \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/presentation/themes/modules/color/palettes/editorial_palette.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"27893b36ad52711e65b4bfed587b7f9fb201542d442d65cac831fb3ab9f1f82d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): lib/presentation/themes/modules/color/palettes/flat_palette.dart:21-37 | lib/presentation/themes/modules/color/palettes/flat_palette.dart:39-53 | lib/presentation/themes/modules/color/palettes/material_you_palette.dart:21-40 | lib/presentation/themes/modules/color/palettes/zen_palette.dart:29-43 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/themes/modules/color/palettes/flat_palette.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb04bf794084e1f4214e666fb2d4774599fef24542d857a23ff87d09fa35146"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): lib/presentation/prompt_assistant/providers/prompt_assistant_history_provider.dart:146-164 | lib/presentation/prompt_assistant/providers/prompt_assistant_history_provider.dart:166-182 | lib/presentation/prompt_assistant/providers/prompt_assistant_history_provider.dart:206-214 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/providers/prompt_assistant_history_provider.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"449a73da38bb99b6392fbce50a47425476dcf551c4f34930df5da29109ad49a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): lib/presentation/widgets/prompt/random_manager/algorithm_config_card.dart:439-456 | lib/presentation/widgets/prompt/random_manager/category_card_list.dart:217-235 | lib/presentation/widgets/prompt/random_manager/preview_generator_panel.dart:614-633 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/random_manager/algorithm_config_card.dart"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde1e6bc97aeccfad21cd07894d1d7562bffdb188ea73acc61670ae4f590bd44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/data/cloud_sync/app_cloud_sync_adapters.dart:536-553 | lib/data/cloud_sync/ffdkj_install_intent_adapter.dart:34-52 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/cloud_sync/app_cloud_sync_adapters.dart"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b598f6bc424ae5136ebdb068eb1b7061ba4e912b42dfaeaafd3099bf6670803"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/data/models/online_gallery/gallery_prompt_projection.dart:167-178 | lib/presentation/providers/local_gallery_provider.dart:1320-1334 \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/data/models/online_gallery/gallery_prompt_projection.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"89821053c4b18c35f79383260d81ed6ca2a400ef3743740b2a546b459fd09012"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/data/services/inpaint_draft_file_repository.dart:177-187 | lib/data/services/inpaint_draft_file_repository.dart:194-202 \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/data/services/inpaint_draft_file_repository.dart"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"133af0de4fe74e31c6863e077a5fad7ecd7f3c771c14a69f7e2cb27e294429f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/presentation/widgets/common/app_toast.dart:430-440 | lib/presentation/widgets/common/app_toast.dart:660-670 \u2014 These two members are one piece of code written twice and then edited apart: 11 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/presentation/widgets/common/app_toast.dart"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e711d204f4dec0fd6da2fbecaf8feddd153e0b75dac5a5a7ccb48a69f236f50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/core/cloud_sync/oauth/mobile_oauth_clients.dart:148-162 | lib/core/cloud_sync/oauth/mobile_oauth_clients.dart:308-320 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/oauth/mobile_oauth_clients.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"725c77529ba36f91ccf21567f9f4b7a17de57fd924e6d9931c1b338d404ba294"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 15\u002B corresponding lines): lib/core/storage/secure_storage_service.dart:292-306 | lib/core/storage/secure_storage_service.dart:358-372 | lib/core/storage/secure_storage_service.dart:398-412 | lib/core/storage/secure_storage_service.dart:444-459 | lib/core/storage/secure_storage_service.dart:488-504 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/storage/secure_storage_service.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e13e8b6d28816113c70cda141510fd60fa1490ac2c84e8b07ea9462a379e43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:276-286 | lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:203-212 \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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb9b4274d2394dd4a597c9f1a1a16de3e204bfa38cd1dd550064ea91a90f3b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:300-314 | lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:420-437 \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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c74bd8a73dc4e53989432ea22c761a78ab98bba3112b5586e8bda620960032d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): lib/presentation/agent_chat/services/precise_reference_toolbox.dart:73-88 | lib/presentation/agent_chat/services/tag_library_toolbox.dart:115-130 | lib/presentation/agent_chat/services/vibe_library_toolbox.dart:67-79 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/precise_reference_toolbox.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd988cf25df209b0eb45d61888f8adab6cfb99fa3f31de5926db1b9c4855e7ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/presentation/providers/reverse_prompt_provider.dart:34-47 | lib/presentation/providers/reverse_prompt_provider.dart:244-256 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/reverse_prompt_provider.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b824b2b6f54cbcb263b2661fcd0cfae75ac624783db9f584c5581187b30adc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): lib/presentation/providers/vibe_library_provider.dart:337-354 | lib/presentation/providers/vibe_library_provider.dart:528-546 | lib/presentation/providers/vibe_library_provider.dart:548-558 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/vibe_library_provider.dart"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"9988a1ab2e46993d2780bf059b2a091dc1dbb8907a4760f955414bb08d4c0566"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/presentation/screens/tag_library_page/widgets/entry_selector_dialog.dart:86-95 | lib/presentation/widgets/prompt/fixed_tag_library_picker_dialog.dart:53-62 \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/presentation/screens/tag_library_page/widgets/entry_selector_dialog.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d956be0e42b39926b695f75b215ffac2bb78e6b9aec07f5b604029b4250b83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/data/services/vibe_file_repository.dart:516-531 | lib/data/services/vibe_portable_file_store.dart:58-70 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/vibe_file_repository.dart"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"12eb011d093274ca28c2319f66cd394b47c8e73666cdb5dbcbb5ff11101ea86e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/presentation/prompt_assistant/providers/prompt_assistant_state_provider.dart:18-34 | lib/presentation/providers/warmup_provider.dart:78-94 \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/presentation/prompt_assistant/providers/prompt_assistant_state_provider.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c0dafcb05b6f658e526fdddd19f87fb0b99f7e0b98424ed563b81a39f6faf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/presentation/widgets/prompt/global_settings_dialog.dart:93-103 | lib/presentation/widgets/prompt/global_settings_dialog.dart:141-151 \u2014 These two members are one piece of code written twice and then edited apart: 11 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/presentation/widgets/prompt/global_settings_dialog.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50e8e3184f7551b110896b74f4f64a6c0ef81d40b860c6e521f83e470c49b0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/core/cloud_sync/coordinator.dart:597-607 | lib/data/cloud_sync/app_cloud_sync_data_source.dart:551-562 \u2014 These two members are one piece of code written twice and then edited apart: 11 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/core/cloud_sync/coordinator.dart"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"94eedf8437d03c809976b1fefe7e53d59f32aa430b5f0a46f1624f364c8c2f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/core/network/web_access/safe_web_reader.dart:159-172 | lib/core/network/web_access/searxng_search_client.dart:121-137 \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/core/network/web_access/safe_web_reader.dart"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57af599e373d0df3f8bae0adea27971df72d7fa2e9e2d76185ce88d0ccee943"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 14\u002B corresponding lines): lib/presentation/agent_chat/services/fixed_tags_toolbox.dart:199-212 | lib/presentation/agent_chat/services/precise_reference_toolbox.dart:248-262 | lib/presentation/agent_chat/services/queue_toolbox.dart:166-180 | lib/presentation/agent_chat/services/queue_toolbox.dart:301-318 | lib/presentation/agent_chat/services/tag_library_toolbox.dart:367-385 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/fixed_tags_toolbox.dart"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"82139556b96d43e81aea1347a4a12fed4a76926882ad61650beb917829206846"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/presentation/agent_chat/services/generation_character_orchestration.dart:199-220 | lib/presentation/agent_chat/services/prompt_toolbox.dart:771-786 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/generation_character_orchestration.dart"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"975ebcc855d2b2dca75b426acb00246f5d5977471b4036cef17748983d9d3416"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/presentation/screens/watermark/watermark_editor_screen.dart:174-189 | lib/presentation/screens/watermark/watermark_editor_screen.dart:191-205 \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/presentation/screens/watermark/watermark_editor_screen.dart"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae5947189125089834eda0307b1f5f8d627e0ff35edb091de760773d429f3d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/presentation/widgets/image_editor/frame/frame_tool_panel.dart:183-205 | lib/presentation/widgets/library_export/library_export_controls.dart:14-31 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/image_editor/frame/frame_tool_panel.dart"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f21a51a6bf5efa0c953fed15b72338b334af2ebf6ec30fc411a835b9302e98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/core/cloud_sync/models.dart:192-203 | lib/core/cloud_sync/models.dart:259-270 \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/core/cloud_sync/models.dart"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"602a321210c21b9ad3374234d78f819b61ac228f573c6b8574005ea2be665698"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/core/utils/exif_container.dart:129-135 | lib/data/services/metadata/exif_metadata_extractor.dart:226-232 \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/core/utils/exif_container.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f66ea1267a858d6da63ded4f894c0983bbf280f7353325169da38adf8620e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/presentation/screens/generation/widgets/generation_param_sections.dart:425-440 | lib/presentation/screens/generation/widgets/size_selector.dart:64-83 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/widgets/generation_param_sections.dart"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"648711fb3546bfbee211d12f527eb74d90f06b9e31d3156f8df1987df16b8532"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/presentation/screens/generation/widgets/sidebar_link_painter.dart:102-113 | lib/presentation/widgets/prompt/fixed_tags_link_layer.dart:397-409 \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/presentation/screens/generation/widgets/sidebar_link_painter.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94a1cac6beec05d73bbb361b37732a1ca0285f40200dff4f8ef9c44e8f48aae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/presentation/screens/precise_ref_library/widgets/precise_ref_entry_edit_dialog.dart:45-62 | lib/presentation/widgets/prompt/global_settings_dialog.dart:27-40 \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/presentation/screens/precise_ref_library/widgets/precise_ref_entry_edit_dialog.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9092d9ae4a5439165e485ae453aa5bbbf27c9b311697a7340b5f078785886fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/presentation/screens/vibe_library/widgets/vibe_detail_viewer.dart:374-387 | lib/presentation/screens/vibe_library/widgets/vibe_detail_viewer.dart:389-402 \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/presentation/screens/vibe_library/widgets/vibe_detail_viewer.dart"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"391cef91c1637583652a689c38bfabffce600e0b07c07900a7a6092cbbeb64d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/presentation/widgets/common/app_toast.dart:618-628 | lib/presentation/widgets/common/app_toast.dart:630-640 \u2014 These two members are one piece of code written twice and then edited apart: 11 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/presentation/widgets/common/app_toast.dart"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a489892295fb0ccc6d6b19de155ff818abdce55537a32c03384697429d78d91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/presentation/widgets/prompt/nai_syntax_controller.dart:454-465 | lib/presentation/widgets/prompt/nai_syntax_controller.dart:572-583 \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/presentation/widgets/prompt/nai_syntax_controller.dart"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc3eab20ce1ed233f7a40739a0f7fab5c1ea90c60308dbf27c5de9159eb4058"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): krita_plugin/nai_launcher_bridge/ui.py:695-708 | krita_plugin/nai_launcher_bridge/ui.py:711-726 \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":"krita_plugin/nai_launcher_bridge/ui.py"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c48baec6319996a36043d35913a668ba05b59246d2907373ab8d4b4c99476d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/core/cloud_sync/backend/webdav_cloud_sync_backend.dart:214-231 | lib/core/cloud_sync/backend/webdav_cloud_sync_backend.dart:233-249 \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/core/cloud_sync/backend/webdav_cloud_sync_backend.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cbd96c721ba172d6ed0b5a6d9bff858477048d1a2ffb3351dfd8983a8be2f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/core/database/datasources/gallery_album_repository.dart:296-309 | lib/data/services/gallery/gallery_album_import_coordinator.dart:196-209 \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/core/database/datasources/gallery_album_repository.dart"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57d398e2e2d9fe0dbea3ca301554eba3a6ff2a7a59af16bf9161cf97f592b94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/presentation/widgets/common/card_action_buttons.dart:214-224 | lib/presentation/widgets/common/card_action_buttons.dart:254-265 \u2014 These two members are one piece of code written twice and then edited apart: 11 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/presentation/widgets/common/card_action_buttons.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cc4b6aeab941a0d8668aa5683719a82a2c0acecfb8cf6b5b45f15c22995555"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/presentation/widgets/common/model_family_icon.dart:161-181 | lib/presentation/widgets/common/provider_icon.dart:161-176 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/model_family_icon.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"5137f7f3883314f51b24f4fd8f179a671a71519998ed0a88d9c7a62c43a1ce29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/core/utils/inpaint_mask/inpaint_mask_operations.dart:179-196 | lib/core/utils/inpaint_mask/inpaint_mask_operations.dart:198-215 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee269db94ee8b31af18ab232a7819c5699d8b52dbe4d7e5d0413533dd46eda8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): lib/presentation/providers/generation/image_workflow_controller.dart:271-289 | lib/presentation/providers/generation/image_workflow_controller.dart:446-463 | lib/presentation/providers/generation/image_workflow_controller.dart:470-488 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/generation/image_workflow_controller.dart"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a544ad8ceb1b0e70a90b00a966c27a33880e5a50dd179ab84d13dee35e15bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/presentation/screens/director_tools/director_tools_screen.dart:138-151 | lib/presentation/screens/director_tools/director_tools_screen.dart:153-162 \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/presentation/screens/director_tools/director_tools_screen.dart"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a791d9bbd061bf8cdf9171ff989ddd9b8cc2e6dc809121dc6981ada956a1d8a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/presentation/widgets/prompt/random_manager/danbooru_preview_content.dart:15-24 | lib/presentation/widgets/prompt/random_manager/danbooru_preview_content.dart:92-101 \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/presentation/widgets/prompt/random_manager/danbooru_preview_content.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36b38b511b4a19af2694b1334fe821aca484b3f9fa0723d8e8236e8bb030aef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/core/agent/harness/env/dart_io_execution_env.dart:218-230 | lib/core/agent/harness/env/dart_io_execution_env.dart:335-347 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/harness/env/dart_io_execution_env.dart"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"5576cfb6e28be87e7280d69ffaf8f7071935d08e50c997509a2c02fca7280f2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/core/cloud_sync/coordinator.dart:503-515 | lib/core/cloud_sync/coordinator.dart:540-552 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/coordinator.dart"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7849b32b2a439bbc61931d728b37fd3cf96ccf9607ed51663b19134a8fdb3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/core/database/providers/data_source_cache_provider.dart:35-51 | lib/core/services/danbooru_tags_protocol.dart:28-40 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/providers/data_source_cache_provider.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f655be2dc74f3ec6dbbc7b14e81c4fe0ee849336c657ba0b2134d2f208d7e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/data/models/gallery/nai_prompt_export_codec.dart:216-224 | lib/data/models/gallery/nai_prompt_export_codec.dart:226-234 \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/data/models/gallery/nai_prompt_export_codec.dart"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f2f320941de97ea34f533b5a657307735afc3ef0c8e850039002631f946ad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/presentation/screens/settings/sections/agent_settings_section.dart:451-464 | lib/presentation/screens/settings/sections/mcp_server/mcp_server_permission_card.dart:90-104 \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/presentation/screens/settings/sections/agent_settings_section.dart"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"94eb2c78555466d2f4ad18af531048361ed8de8c04df8905a0ce52ee0fa9351c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/data/services/vibe_import_service.dart:467-478 | lib/presentation/screens/vibe_library/vibe_import_controller.dart:589-596 \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/data/services/vibe_import_service.dart"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1ddb80f71e5d154e2d532feca0346c53977029cb6f42f540ebe72a09d8705b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/presentation/screens/precise_ref_library/precise_ref_library_screen.dart:255-269 | lib/presentation/screens/vibe_library/vibe_library_screen.dart:568-582 \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/presentation/screens/precise_ref_library/precise_ref_library_screen.dart"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4eebac30413eb82856bf5887678674f300957cc050d7330406ff4431d7fd33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/presentation/screens/tag_library_page/widgets/entry_list_item.dart:195-211 | lib/presentation/widgets/common/image_detail/components/vibe_section.dart:368-382 \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/presentation/screens/tag_library_page/widgets/entry_list_item.dart"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d8ed2408b19426fd1d23f3f679cd57e34499063b1b9867da83579960928763"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): lib/core/constants/api_constants.dart:1134-1140 | lib/presentation/widgets/online_gallery/gallery_detail_controller.dart:179-188 | lib/presentation/widgets/online_gallery/gallery_detail_dialog.dart:122-128 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 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/core/constants/api_constants.dart"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa1118ae3703d628aae880fb32b2268e6ae6e7e36ee71ebf009ebb10771606b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/core/mosaic/mosaic_render_service.dart:423-438 | lib/core/watermark/watermark_render_service.dart:293-308 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/mosaic/mosaic_render_service.dart"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c84af5f1371890baecf88133b7aca64fd1ad25a0cf6c23e3ff6cb6f024cd025"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/data/cloud_sync/tag_library_thumbnail_compressor.dart:87-97 | lib/presentation/utils/reverse_prompt_image_normalizer.dart:131-136 \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/data/cloud_sync/tag_library_thumbnail_compressor.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a454514a079913919d07a38026630568f807fcfbc951662d3b9571d8baec7d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/presentation/widgets/common/image_picker_card/image_picker_card.dart:571-583 | lib/presentation/widgets/common/image_picker_card/image_picker_card.dart:585-597 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/image_picker_card/image_picker_card.dart"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8ca944385643b79eb8952a255edd6e3f5355c38b5ba4ab8c5c6efea2db64a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/core/agent/harness/env/dart_io_execution_env.dart:121-131 | lib/core/agent/harness/env/dart_io_execution_env.dart:158-168 \u2014 These two members are one piece of code written twice and then edited apart: 11 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/core/agent/harness/env/dart_io_execution_env.dart"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3115c500e89be9ae6b103e1c826c50015518cdced372cd2b6c9ab9f01c5f79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/core/cloud_sync/backend/webdav_collection_ensurer.dart:138-147 | lib/core/cloud_sync/backend/webdav_operation_inventory.dart:233-238 \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/core/cloud_sync/backend/webdav_collection_ensurer.dart"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fc88bcc56ea322b59cdd271a85f9464e765421ac7a16007beca5ec8492f439"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): lib/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart:378-395 | lib/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart:403-416 | lib/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart:423-437 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9728812190b23e97aa6140c9f4bfc5286d41a980d3a83f728ceaa95f8418768"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/presentation/widgets/image_editor/workspace/workspace_desktop_layout.dart:362-375 | lib/presentation/widgets/image_editor/workspace/workspace_mobile_layout.dart:186-201 \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/presentation/widgets/image_editor/workspace/workspace_desktop_layout.dart"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b214537967172b96f38940032988fc04f076de4fc6248b7f92bea906577a57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/core/database/datasources/cooccurrence_data_source.dart:177-191 | lib/core/database/datasources/translation_data_source.dart:173-183 \u2014 These two members are one piece of code written twice and then edited apart: 11 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/core/database/datasources/cooccurrence_data_source.dart"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e4938cafcce228872b76b940351ac1b2e6537890dd9036140285ab27006bc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/core/utils/hive_storage_helper.dart:395-405 | lib/data/services/gallery/local_gallery_query.dart:230-238 \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/core/utils/hive_storage_helper.dart"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d064ddfc9b345dabceb224cdf01f901d2c383085167799354b68a489158d83e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/data/cloud_sync/app_cloud_sync_data_source.dart:475-486 | lib/data/cloud_sync/app_cloud_sync_data_source.dart:564-572 \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/data/cloud_sync/app_cloud_sync_data_source.dart"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7890abe5afda2c028a0b5f3a7fc2f38f1994f1e8970fa498862c46af714589"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/data/cloud_sync/cloud_sync_operation_storage.dart:569-575 | lib/data/datasources/remote/online_gallery/quick_tag_cloud_query_engine.dart:187-194 \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/data/cloud_sync/cloud_sync_operation_storage.dart"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"e810d7642cf0c657accbc517adc5a8548b10abb4e56eb62275230d0d779ef91f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/data/models/mosaic/mosaic_settings.dart:328-337 | lib/data/models/watermark/watermark_settings.dart:650-664 \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/data/models/mosaic/mosaic_settings.dart"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69cb4973a5d71e947ff91e34b0c26cf49eca7e8ae2b7b52449be059d4b39d45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/presentation/screens/mosaic/mosaic_editor_screen.dart:282-296 | lib/presentation/screens/mosaic/mosaic_editor_screen.dart:298-309 \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/presentation/screens/mosaic/mosaic_editor_screen.dart"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c180af6ae2cfca987f3e203bc2c474daba8b4fe38d339f21a3ba677f6769aef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/presentation/widgets/auth/third_party_api_login_card.dart:206-220 | lib/presentation/widgets/auth/third_party_api_login_card.dart:222-236 \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/presentation/widgets/auth/third_party_api_login_card.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb005f546cbe28fd7c5d45d9912919194592abd843263f57ed3947829a0b1be6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/presentation/screens/prompt_config/widgets/prompt_config_expanded_workspace.dart:21-38 | lib/presentation/widgets/prompt/fixed_tag_edit_dialog.dart:205-220 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/prompt_config/widgets/prompt_config_expanded_workspace.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb6692ab4ef3c29e485a538909c41b03f545f0f29dc31d807c90bf0d9826484"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/presentation/screens/statistics/statistics_state.dart:125-141 | lib/presentation/screens/statistics/statistics_state.dart:223-239 \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/presentation/screens/statistics/statistics_state.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bfe570b1efebb46f32fc9a4692b53944eb7a6af86d0c14241d5367126b3624"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart:298-306 | lib/presentation/widgets/gallery/gallery_album_tree_view.dart:167-175 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:286-294 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2b7664abea94ad9521aba5b0d1454852dff88d009c30075f75fd290b12e8c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/presentation/widgets/common/image_detail/components/prompt_copy_dialog.dart:423-436 | lib/presentation/widgets/common/image_detail/components/prompt_copy_dialog.dart:438-451 \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/presentation/widgets/common/image_detail/components/prompt_copy_dialog.dart"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fc59593601b76bcefcc5fc474704e36bcffd26d6507529b497098fc2483a5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/core/database/datasources/cooccurrence_data_source.dart:232-248 | lib/core/database/datasources/cooccurrence_data_source.dart:250-263 \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/core/database/datasources/cooccurrence_data_source.dart"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"211d906f818ae6f262ec2b8dfcc85258aeb2d32294e9ec6ccfe11aedfec56522"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/data/services/metadata/image_metadata_parser_service.dart:113-124 | lib/data/services/metadata/image_metadata_parser_service.dart:252-263 \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/data/services/metadata/image_metadata_parser_service.dart"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9bb3ad94256084136e55f83938cd5e980152561a23cfb1713903f54f97aae8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/data/services/random_prompt_generator.dart:1249-1255 | lib/presentation/providers/comfyui/comfyui_provider.dart:754-760 \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/data/services/random_prompt_generator.dart"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4359bb811e95391fad0f516aac59713a26a32b0745df9db85bd05ed1029617"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): lib/presentation/agent_chat/services/queue_toolbox.dart:448-455 | lib/presentation/providers/generation/vibe_reference_service.dart:139-146 | lib/presentation/providers/local_gallery_provider.dart:1344-1353 \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/presentation/agent_chat/services/queue_toolbox.dart"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"21798d94fd80d27e6072977017846a451f99a0070e23d9eb4b562ce4a22322ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/presentation/screens/local_gallery/local_gallery_action_coordinator.dart:194-200 | lib/presentation/screens/local_gallery/local_gallery_action_coordinator.dart:202-208 \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/presentation/screens/local_gallery/local_gallery_action_coordinator.dart"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a76cae1664fb748665f950e79c30d2d231e93613eb54ccbe778b32b54aaeb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/presentation/widgets/common/image_detail/components/detail_metadata_panel.dart:753-767 | lib/presentation/widgets/common/image_detail/components/detail_metadata_panel.dart:954-960 \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/presentation/widgets/common/image_detail/components/detail_metadata_panel.dart"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23e6001bfe9ee2349763cdd7e3f1e324b4ca1c4e751d546baab07aa9f652208"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): tool/cloud_sync/cloud_sync_production_benchmark.dart:331-338 | tool/cloud_sync/cloud_sync_production_benchmark.dart:340-348 \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":"tool/cloud_sync/cloud_sync_production_benchmark.dart"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"106f66d1940e629bade7a5ebace24649785d7895eca0d2290cc0ac899d73f174"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/core/cloud_sync/journal.dart:191-203 | lib/presentation/agent_chat/services/agent_chat_session_controller.dart:665-675 \u2014 These two members are one piece of code written twice and then edited apart: 11 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/core/cloud_sync/journal.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41c651d1104f79317b81450f2359942b5ded186c7e6dc8edfc6dfb3a62f3a52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): lib/core/services/agent_question_notification_service.dart:64-70 | lib/core/services/android_foreground_task_service.dart:48-54 | lib/data/repositories/online_gallery_local_favorites_repository.dart:365-372 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 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/core/services/agent_question_notification_service.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"935db6442d821f1cdaa17303d282138e628e1eef55355665aeeaed2a599e5bf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/data/datasources/remote/online_gallery/quick_tag_cloud_gallery_repository.dart:73-83 | lib/data/services/online_gallery/quick_tag_cloud_remote_catalog_service.dart:195-205 \u2014 These two members are one piece of code written twice and then edited apart: 11 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/data/datasources/remote/online_gallery/quick_tag_cloud_gallery_repository.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f4212f6b9ef8609a16b6e8d4b5d6b429c3dcdb314759ca6d4e10202f7d702f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): lib/presentation/agent_chat/services/fixed_tags_toolbox.dart:214-224 | lib/presentation/agent_chat/services/tag_library_toolbox.dart:387-397 | lib/presentation/agent_chat/services/tag_library_toolbox.dart:491-509 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/fixed_tags_toolbox.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d4b6b7f1123d7de46f6cd39f099e472440d87a8728d1398f88098482ed868a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/presentation/providers/cloud_sync/cloud_sync_application_service.dart:369-381 | lib/presentation/providers/cloud_sync/cloud_sync_application_service.dart:383-398 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/cloud_sync/cloud_sync_application_service.dart"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1ef9417a8f88c155bdc24ea513a5c3dc6d62e8f587ce2ddac041eded559b57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): lib/presentation/providers/local_gallery_provider.dart:793-806 | lib/presentation/providers/local_gallery_provider.dart:808-821 | lib/presentation/providers/local_gallery_provider.dart:860-873 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/local_gallery_provider.dart"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e91f9d3b847cbdf2aea60a96c296094028a39660dcaf6fbb677ed6dbb354c6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/presentation/providers/quality_preset_provider.dart:33-48 | lib/presentation/providers/uc_preset_provider.dart:27-39 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/quality_preset_provider.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"260d01bf8aefdb583b6aa8c79295c77bb29930a11ef273b26fc00f2802fec6b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/core/cloud_sync/snapshot_transfer.dart:27-38 | lib/core/cloud_sync/snapshot_transfer.dart:40-50 \u2014 These two members are one piece of code written twice and then edited apart: 11 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/core/cloud_sync/snapshot_transfer.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7788f3fc7aac1b95402f106145eca904d45ac109b7ec7c82702b112d2bc1b986"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/core/mcp/mcp_tool_adapter.dart:68-79 | lib/data/models/metadata/metadata_import_selection_codec.dart:150-158 \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/core/mcp/mcp_tool_adapter.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2e2f2acbdfcd4a6875e073a49a677b62a96606557c5a88b30d8b96334e71d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): lib/presentation/agent_chat/services/queue_toolbox.dart:289-299 | lib/presentation/agent_chat/services/queue_toolbox.dart:344-355 | lib/presentation/agent_chat/services/queue_toolbox.dart:357-369 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/queue_toolbox.dart"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8c14bf01d869fb82b130dbfec288fdf2362f8e2ab153036128cd6b727754cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/presentation/screens/auth/login_screen.dart:969-983 | lib/presentation/widgets/common/shimmer_skeleton.dart:44-57 \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/presentation/screens/auth/login_screen.dart"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e38cbd8d4f06d60ceae838a3365d133d3040e430c12149cbde4b6e21cd9b5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/core/utils/vibe_encoding_utils.dart:241-253 | lib/core/utils/vibe_image_embedder.dart:875-884 \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/core/utils/vibe_encoding_utils.dart"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca72f5b4727bf63e8e004b8c5a2c0ed1b6250f6a678ae508c5a043db89b395f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): lib/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart:590-604 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:316-326 | lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:233-247 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bfcdaf347833bc338adcb5247282e1cdb49aa08609e78973d3152aa7e26143"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/data/models/gallery/nai_image_metadata_raw_decoder.dart:872-879 | lib/data/models/gallery/nai_image_metadata_raw_decoder.dart:881-888 \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/data/models/gallery/nai_image_metadata_raw_decoder.dart"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b82c9a7e0cceee853465b4f8677fb6f1a46b8aa8fad74add72fcac85d4e0a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): lib/data/services/vibe_library_import_repository_impl.dart:99-114 | lib/data/services/vibe_library_storage_service.dart:183-195 | lib/presentation/providers/vibe_library_provider.dart:401-415 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/vibe_library_import_repository_impl.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3e6f82b584b5d1a4ed24d8511be722c11136e012256887cddcc1fcebea54c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/presentation/providers/composition_guide_provider.dart:42-49 | lib/presentation/providers/composition_guide_provider.dart:51-58 \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/presentation/providers/composition_guide_provider.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbfc345c097e1764ff2387848db78cbbc2876a14eb30b394855296e1b6c3ad0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/presentation/widgets/prompt/random_manager/add_tag_group_dialog.dart:123-130 | lib/presentation/widgets/prompt/random_manager/add_tag_group_dialog.dart:132-138 \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/presentation/widgets/prompt/random_manager/add_tag_group_dialog.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b85fd15e343b1346eeba4b19b4ddd1573a3a1e56e24a1c6e1faf1aa539277d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/presentation/agent_chat/widgets/agent_chat_tool_image_card.dart:18-31 | lib/presentation/agent_chat/widgets/agent_chat_tool_image_card.dart:39-49 \u2014 These two members are one piece of code written twice and then edited apart: 11 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/presentation/agent_chat/widgets/agent_chat_tool_image_card.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4712efc06f8fcf10b12ff133191d334753158217fc556fa3b08bb3199b8a69c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/presentation/providers/online_gallery_provider.dart:135-149 | lib/presentation/providers/online_gallery_provider.dart:333-344 \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/presentation/providers/online_gallery_provider.dart"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"39781e0126ec17db6307538ca142fd6105a7ef01150eccd110623c8c9ff1f43b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/presentation/screens/settings/sections/appearance_settings_section.dart:180-190 | lib/presentation/screens/settings/sections/appearance_settings_section.dart:400-410 \u2014 These two members are one piece of code written twice and then edited apart: 11 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/presentation/screens/settings/sections/appearance_settings_section.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fe6e93ac10a3946b8925360bac06f306a84985fd4171e87ad8737591e93b59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/presentation/widgets/image_editor/core/history_manager.dart:204-216 | lib/presentation/widgets/image_editor/core/layer_actions.dart:48-56 \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/presentation/widgets/image_editor/core/history_manager.dart"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f8d6af4fc5221778f3d129de7799a9aa98289e83719570660292c0a621dafc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/data/services/precise_ref_library_storage_service.dart:391-398 | lib/data/services/precise_ref_library_storage_service.dart:400-407 \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/data/services/precise_ref_library_storage_service.dart"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f895ccb1377d6baeb1b959dbd236978c8cd8bb8118424f60b0066fd35da8ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/presentation/agent_chat/services/image_resource_action_service.dart:365-378 | lib/presentation/mcp/services/mcp_image_response_service.dart:455-468 \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/presentation/agent_chat/services/image_resource_action_service.dart"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f8b276ed59e3f5b5b1f4edd0f0cf78166849e6fb8ca8ec89db51acb9ab9235"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart:543-550 | lib/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart:398-405 \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/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f69ac72749739932f0037986f63b468ccae4e03b69fa71e452cb42ab2b80e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/presentation/screens/generation/mobile_generation_controller.dart:182-187 | lib/presentation/screens/generation/mobile_generation_gestures.dart:41-50 \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/presentation/screens/generation/mobile_generation_controller.dart"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef261e5df0f2365995e769fbc028707c2c0e6aa552f8b0ce529e91da49fc6db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/core/cloud_sync/coordinator.dart:489-501 | lib/core/cloud_sync/coordinator.dart:524-538 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/coordinator.dart"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"8836fb27783caa6d9ca6b6eaae097929a40050ec25c7461868f3721522ecfaad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/presentation/prompt_assistant/services/prompt_assistant_api_client.dart:135-141 | lib/presentation/prompt_assistant/services/prompt_assistant_service.dart:493-499 \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/presentation/prompt_assistant/services/prompt_assistant_api_client.dart"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"94da74aa038038338678d39397e0b795e4006478d3d3ce84e712f9b92dea6072"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/presentation/providers/vibe_library_provider.dart:371-385 | lib/data/services/vibe_library_storage_service.dart:170-182 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/vibe_library_provider.dart"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb0d65267567e1f7dec1dae14d6c0cb7f75cee23923d9b6beab88c06e641367"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/presentation/widgets/image_editor/services/magic_wand_service.dart:11-25 | lib/presentation/widgets/image_editor/image_editor_processing_service.dart:55-67 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/image_editor/services/magic_wand_service.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd73ebc6cd020d160c07d74d01c55a25fb32c6de3d55c7e8d3d73db2fa4bb4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/core/autocomplete/cooccurrence_pack_repository.dart:298-304 | lib/data/repositories/gallery_category_repository.dart:137-143 \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/core/autocomplete/cooccurrence_pack_repository.dart"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea670824dc4c634b1ce8aab87990d7350504771aa5a7dcf773880fd3eabff6dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/data/services/vibe_library_entry_reader.dart:237-247 | lib/data/services/vibe_library_storage_categories.dart:129-140 \u2014 These two members are one piece of code written twice and then edited apart: 11 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/data/services/vibe_library_entry_reader.dart"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"89603c3c3e82e387a12e28cda3365f6a4e0a521b94f9a0935b81780a97897d2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar.dart:639-652 | lib/presentation/widgets/danbooru_post_card.dart:925-938 \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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar.dart"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd9c8d5b7db94a8bb72ae36f35848b04cca5480304aa73346016d6de32f9d09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/presentation/agent_chat/services/manual_inpaint_toolbox.dart:793-807 | lib/presentation/screens/derivatives/derivative_copy_saver.dart:141-153 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/manual_inpaint_toolbox.dart"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea7c9935df0e33ba01e9d205af70322934581500e754acb3520a95e3ec2f3dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): lib/core/utils/efficient_vit_sam_image_processor.dart:179-193 | lib/core/utils/inpaint_mask/inpaint_mask_geometry.dart:124-136 | lib/core/utils/inpaint_outpaint_utils.dart:493-507 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/efficient_vit_sam_image_processor.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1f7cd7d3af4088e9c0886fba02222f3f057682cfe9b9b5675a992fc4233550"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/presentation/widgets/gallery/local_image_hover_preview.dart:393-396 | lib/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart:379-382 \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/presentation/widgets/gallery/local_image_hover_preview.dart"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"db17438f317b0f1c0ebf9eef8d7a4a2c1b2036190cb1247b6b52dde8644c8600"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/presentation/screens/statistics/widgets/charts/polar_activity_chart.dart:32-43 | lib/presentation/widgets/common/themed_radio.dart:50-59 \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/presentation/screens/statistics/widgets/charts/polar_activity_chart.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acaf837f816352430a0402b4a633640b6d400b7aebd9526637f8ad911a52d12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/presentation/widgets/image_editor/core/history_manager.dart:372-381 | lib/presentation/widgets/image_editor/core/transform_actions.dart:77-85 \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/presentation/widgets/image_editor/core/history_manager.dart"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"77deea5c69ebc0b4fc3b462965a91158db73c80bc983807c828ca9faa0b7a289"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/presentation/widgets/image_editor/image_editor_screen.dart:201-212 | lib/presentation/widgets/image_editor/image_editor_workspace.dart:131-142 \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/presentation/widgets/image_editor/image_editor_screen.dart"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d107cf5a48bd186b3ba43c44ad6e691f28ab8fa6c82980372b4ebf894065453"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): lib/core/cloud_sync/backend/github_cloud_sync_backend.dart:220-235 | lib/core/cloud_sync/backend/github_cloud_sync_backend.dart:237-252 | lib/core/cloud_sync/backend/onedrive_cloud_sync_backend.dart:265-279 \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/core/cloud_sync/backend/github_cloud_sync_backend.dart"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d4509d0cb9a88e36ce42288621fe7532c0f7a3afbe1580f8a979f78efee19c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): lib/presentation/widgets/common/hover_image_preview.dart:233-243 | lib/presentation/widgets/common/hover_preview_card.dart:108-118 | lib/presentation/widgets/tag_library/tag_library_entry_hover_preview.dart:123-140 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/hover_image_preview.dart"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9d2df0011f0c305247545797bd1a182350eaf5815d868c9eaa49d03ac17144"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/core/agent/harness/harness_types.dart:85-99 | lib/presentation/agent_chat/services/execution_toolbox.dart:31-45 \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/core/agent/harness/harness_types.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c1ecdc1e329507a1fb233f95fd37981f3bba31685a11693c30130692716064"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/core/database/datasources/gallery_query.dart:55-63 | lib/core/constants/api_constants.dart:1162-1168 \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/core/database/datasources/gallery_query.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f1629fa1aca87318769094a5b66a43fcd8826ba324dcbedbf69e8d57d8910e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/core/agent/agent_profile_service.dart:121-123 | lib/core/cloud_sync/backend/webdav_namespace_cleaner.dart:202-204 \u2014 These two members are one piece of code written twice and then edited apart: 3 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/core/agent/agent_profile_service.dart"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc50e76623045775b71c1f206b2f950cab1f3be3885aaa09af844e8775efdb5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/core/agent/resources/agent_chat_resource_reference_codec.dart:214-220 | lib/core/autocomplete/cooccurrence_manifest_codec.dart:146-152 \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/core/agent/resources/agent_chat_resource_reference_codec.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46d508a82aae56fb21b8d1b0950e78c80fd0288e125eebb65953967d52ebac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart:574-578 | lib/data/services/online_gallery/quick_tag_cloud_parser.dart:582-586 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefde772c88905562a78b169fd3a4522b68cad597811e5f84c4f7456e21a2544"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/presentation/widgets/image_editor/image_editor_processing_service.dart:75-85 | lib/presentation/widgets/image_editor/services/outpaint_service.dart:8-18 \u2014 These two members are one piece of code written twice and then edited apart: 11 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/presentation/widgets/image_editor/image_editor_processing_service.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b54bd0bb5254f8da3ca8ce186b3ed958f0fafa9fab741d40de94bc86050d990"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/core/network/web_access/exa_search_client.dart:269-272 | lib/core/network/web_access/searxng_search_client.dart:153-156 \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/core/network/web_access/exa_search_client.dart"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcf1ff71bb4a8847f5dd3bec3c676ecabcdfeab7e23e06c6d6076dbf2f0f019"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/data/models/gallery/nai_prompt_export_codec.dart:189-193 | lib/presentation/services/gallery_prompt_projection_service.dart:227-231 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/models/gallery/nai_prompt_export_codec.dart"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5e9243500afadb8b6e64dba65f6286fed6aa2a24b4be358714bc76e8194291"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/data/services/vibe_library_storage_service.dart:159-169 | lib/presentation/providers/vibe_library_provider.dart:358-370 \u2014 These two members are one piece of code written twice and then edited apart: 11 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/data/services/vibe_library_storage_service.dart"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c213d76c1f0e26ee56e699b963bd873b6aedf61b2d9321a58a55e0ce5d3696"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart:369-376 | lib/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart:395-401 \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/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"8395154bc9f8baed2214df9226483506991d52fd7ae5006b36aa49380b56a3c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/presentation/widgets/character/character_tooltip_content.dart:189-193 | lib/presentation/widgets/character/inline_character_section.dart:104-108 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/character/character_tooltip_content.dart"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03035ccb4b46ebdcef4efdc17d1d976b06cf33bb857a6fa97e396dde7d8dfa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/presentation/widgets/image_editor/layers/layer_patch_baker.dart:199-207 | lib/presentation/widgets/image_editor/tools/blur_tool.dart:125-130 \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/presentation/widgets/image_editor/layers/layer_patch_baker.dart"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c0fa42e752a94f4fff31ee5c17b2cef97f75646833d6e97a4719af62474b9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): lib/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart:397-406 | lib/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart:438-444 | lib/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart:439-448 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 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/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af1e3c88ceb1fd704ff7c432de2f7541a9cacc8f4d0ed7a901c9ef0f33e2b6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/core/autocomplete/autocomplete_cache_database.dart:151-157 | lib/core/database/datasources/translation_data_source.dart:161-167 \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/core/autocomplete/autocomplete_cache_database.dart"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7aeac7e731cf55710a0fb09a8c06cd621881f040578f69047df38ea8d8ac72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/presentation/widgets/common/weight_adjust_toolbar.dart:83-91 | lib/presentation/widgets/prompt/prompt_formatter_wrapper.dart:59-69 \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/presentation/widgets/common/weight_adjust_toolbar.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c45b8c3e15eee8586acaeb1223d2e5157c0413d037becc2558a92195025d6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/presentation/widgets/prompt/components/library_entry_menu_item.dart:137-146 | lib/presentation/widgets/tag_library/tag_library_picker_dialog.dart:457-468 \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/presentation/widgets/prompt/components/library_entry_menu_item.dart"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4054218527573de3bfac4059f4c0296d7758d3cf448a41ff446f1238d2437dc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/presentation/widgets/prompt/diy/panels/post_process_rule_panel.dart:54-61 | lib/presentation/widgets/prompt/diy/panels/visibility_rule_panel.dart:48-58 \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/presentation/widgets/prompt/diy/panels/post_process_rule_panel.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"81270c7db4401840c0b35227b7cb065146cadab1a88dc7132cda2d7db0bff95c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/presentation/screens/settings/sections/mcp_server/mcp_client_config_snippets.dart:49-55 | lib/presentation/screens/settings/sections/mcp_server/mcp_server_connection_card.dart:74-78 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/settings/sections/mcp_server/mcp_client_config_snippets.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4a645f98b5e0280bed25ceaed48d542a1b57eacf4f4589bbcb3273823fd39e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/core/cloud_sync/backend/github_backend_support.dart:14-23 | lib/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart:760-769 \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/core/cloud_sync/backend/github_backend_support.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f119c8f2dc8c68003c8333f9af18f57594eb436e2ed3e4cc788e15e2295ebb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/data/services/vibe_library_entry_writer.dart:143-149 | lib/data/services/vibe_library_storage_service.dart:253-259 \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/data/services/vibe_library_entry_writer.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b994f6d2b57e2e116d8e66cb233105322c6e49ee440e64f96faa627dfe9bf95f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/presentation/screens/mosaic/mosaic_editor_screen.dart:471-478 | lib/presentation/screens/watermark/watermark_editor_screen.dart:570-577 \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/presentation/screens/mosaic/mosaic_editor_screen.dart"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"005ff80724f5be1d5d81794ac9ad5ae89810d1c6dc2585c52f69570e13f2b1d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): lib/presentation/screens/settings/sections/mcp_server/mcp_client_config_snippets.dart:57-62 | lib/presentation/widgets/danbooru_login_dialog.dart:226-231 | lib/presentation/widgets/navigation/nav_rail_items.dart:107-112 | lib/presentation/widgets/prompt/random_manager/add_tag_group_dialog.dart:488-493 \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/presentation/screens/settings/sections/mcp_server/mcp_client_config_snippets.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2040d09eef99b4b780970adb8781ff421d9a6504a2cd7665e5c0d57ac508c184"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/presentation/widgets/image_editor/image_editor_screen.dart:226-237 | lib/presentation/widgets/image_editor/image_editor_workspace.dart:153-163 \u2014 These two members are one piece of code written twice and then edited apart: 11 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/presentation/widgets/image_editor/image_editor_screen.dart"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"103491661e09f2ba2cfb66c266472689511796cf22e29f62dba16e71a8c3ac32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/presentation/widgets/image_editor/image_editor_screen.dart:238-249 | lib/presentation/widgets/image_editor/image_editor_workspace.dart:165-175 \u2014 These two members are one piece of code written twice and then edited apart: 11 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/presentation/widgets/image_editor/image_editor_screen.dart"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"979c4fe2843eb6ec48b6a1e3e27280e4a91a379f10d14815da76df5018fd20df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/presentation/widgets/image_editor/tools/selection/base_selection_tool.dart:115-121 | lib/presentation/widgets/image_editor/tools/selection/lasso_selection_tool.dart:27-37 \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/presentation/widgets/image_editor/tools/selection/base_selection_tool.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4896069b8d38551a90205675c01869e0f24adec2994615f39f8e8ffb1386460"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/core/utils/vibe_image_embedder.dart:869-873 | lib/data/services/metadata/ai_tag_generation_parser.dart:401-405 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/vibe_image_embedder.dart"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"8292bd63ff3a73798e2a05a1e547008e90dd3df0106e65bbda4188df55738dfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/core/agent/agent_tool_presentation.dart:62-65 | lib/presentation/agent_chat/widgets/agent_chat_history.dart:540-543 \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/core/agent/agent_tool_presentation.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ab51fd8ec090b3b2f4b1fcb22f1c1991950d8a8e52afdb96efe39b60526003"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/core/services/update_installer_service.dart:736-742 | lib/core/services/verified_resumable_downloader.dart:481-487 \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/core/services/update_installer_service.dart"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"e270ae1d6ef4636264060e078c0fcbd9038cb830e594976dea8434b307ab71bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/data/models/agent/agent_settings.dart:74-81 | lib/data/models/prompt_assistant/prompt_assistant_models.dart:1032-1040 \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/data/models/agent/agent_settings.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8e621f7fe354e990c1ab686d4fe958680283333e9b17d178ec2a90e68ae13c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): tool/cloud_sync/cloud_sync_benchmark.dart:564-568 | tool/cloud_sync/cloud_sync_production_benchmark.dart:367-371 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/cloud_sync/cloud_sync_benchmark.dart"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"8550c980fbf82f5c6eacf00a69b2c5ee7336a4e1044d58ac2df337d2f646b60f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/presentation/widgets/image_editor/tools/brush_tool.dart:381-387 | lib/presentation/widgets/image_editor/tools/eraser_tool.dart:164-170 \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/presentation/widgets/image_editor/tools/brush_tool.dart"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"630e97bb803f1249d5c2fc7a49fc6895afb35c759134364ea045a5b7cd2d3b9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/data/datasources/remote/online_gallery/gallery_source_adapter.dart:218-223 | lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:56-62 \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/data/datasources/remote/online_gallery/gallery_source_adapter.dart"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c77481813a4e91a46c1c8075aa4d2378af7963464783717ffd40399adfe97d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/presentation/screens/precise_ref_library/widgets/precise_ref_hover_preview.dart:81-85 | lib/presentation/screens/vibe_library/widgets/vibe_hover_preview.dart:100-104 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/precise_ref_library/widgets/precise_ref_hover_preview.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0468762aa840c7fbff0f5937eaac3cd86f8df0ee8487cf15ad0172f8358413"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/presentation/screens/tag_library_page/tag_library_page_screen.dart:824-829 | lib/presentation/widgets/tag_library/tag_library_picker_dialog.dart:252-258 \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/presentation/screens/tag_library_page/tag_library_page_screen.dart"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"4499baa7003da55f2e369e1f1a6810f72e314bc41f52f33be0871dc584075705"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/presentation/widgets/image_editor/tools/move_tool_panel.dart:274-281 | lib/presentation/widgets/image_editor/tools/tool_setting_rows.dart:171-178 \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/presentation/widgets/image_editor/tools/move_tool_panel.dart"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c19d1d38c3ef17a04d84cea1934d9d6d59cef680f95e9e414aa79b66f8cc7bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/core/watermark/watermark_tone.dart:60-62 | lib/data/services/dlss/dlss_float_frame.dart:130-132 \u2014 These two members are one piece of code written twice and then edited apart: 3 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/core/watermark/watermark_tone.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2c52d2d0d0dd6660d221c526a0b9a95b8b86ae7026cae85c18d41e26abc691"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): lib/data/models/tag/danbooru_tag.dart:24-29 | lib/data/models/tag/local_tag.dart:146-151 | lib/data/models/tag/tag_suggestion.dart:26-31 \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/data/models/tag/danbooru_tag.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"340815165ac90eba37cd21783d31c39b0523a4af9bbaf2328126cc015293491a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/presentation/widgets/common/shimmer_skeleton.dart:34-42 | lib/presentation/widgets/queue/task_list_item.dart:1224-1231 \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/presentation/widgets/common/shimmer_skeleton.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a9e59a900d6519f9bb559b79104f3775230adcbe7dfcb91cf9c57aa6d04685"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/core/cloud_sync/backend/github_cloud_sync_backend.dart:446-454 | lib/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart:831-838 \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/core/cloud_sync/backend/github_cloud_sync_backend.dart"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"401397137bed77b0d70977649bf83fc39e20c003f2663f35454f27344c9e4570"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): lib/presentation/screens/settings/widgets/gallery_cache_actions.dart:45-52 | lib/presentation/screens/statistics/widgets/dashboard/animated_refresh_button.dart:26-33 | lib/presentation/widgets/gallery/gallery_scan_progress_panel.dart:496-503 \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/presentation/screens/settings/widgets/gallery_cache_actions.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6cc21e052af2e0e1298db9c5914ab490bd75c989842a3e88a66eaec9e59c29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/core/network/web_access/exa_search_client.dart:432-435 | lib/core/network/web_access/searxng_search_client.dart:158-161 \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/core/network/web_access/exa_search_client.dart"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfeb4d3b5f20b83d8d396ab95118f3f754ef12f4734f8e27399cc4c8ea29237c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/data/services/vibe_file_storage_service.dart:121-124 | lib/data/services/vibe_library_storage_service.dart:115-118 \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/data/services/vibe_file_storage_service.dart"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5f9c5a2e27188407fde8ad9aa7a5210d87de0481c73ceb6bdd263a12556ddd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/presentation/agent_chat/providers/agent_chat_dock_state.dart:39-44 | lib/presentation/agent_chat/services/generation_image_workflow_service.dart:17-23 \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/presentation/agent_chat/providers/agent_chat_dock_state.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b6ccfa79bd6722c586919a5b3601ef3519d8094485db6aac796a30e0d18561"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/presentation/widgets/character/inline_character_editor.dart:466-472 | lib/presentation/widgets/common/pagination_bar.dart:81-87 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/character/inline_character_editor.dart"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"69689d7762530e2370d0a4c008434aac40081790ae0f37b82a7f5ae3e801b980"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/core/autocomplete/cooccurrence_sqlite_repository.dart:242-246 | lib/core/database/datasources/cooccurrence_data_source.dart:197-203 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/autocomplete/cooccurrence_sqlite_repository.dart"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"180f8a60ea60bf26e9a449388c3d3a93fe2407f8bc57a9244bc87e2b6fabd815"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart:166-176 | lib/core/cloud_sync/backend/onedrive_cloud_sync_backend.dart:295-304 \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/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d638faa1d965e8cf3404e862d99d4405927440189cd1c7daa0a1bf2066a56a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lib/core/services/update_installer_service.dart:750-752 | lib/core/services/verified_resumable_downloader.dart:489-490 \u2014 These two members are one piece of code written twice and then edited apart: 2 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/core/services/update_installer_service.dart"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33b5e946ff47340ae63f1f1546b863d530340e2f53f15187c3b4a25a250c5de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): lib/presentation/screens/tag_library_page/widgets/entry_card.dart:451-454 | lib/presentation/screens/tag_library_page/widgets/entry_list_item.dart:497-500 | lib/presentation/widgets/common/image_detail/components/prompt_section.dart:79-82 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/tag_library_page/widgets/entry_card.dart"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49fec1d634896b4d100332edfb0262e2495dc4fe745070e216876fb53b9f3c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): lib/core/autocomplete/tag_catalog_repository.dart:381-384 | lib/core/autocomplete/zh_dictionary_service.dart:486-489 | lib/core/database/datasources/translation_data_source.dart:222-225 | lib/presentation/screens/generation/widgets/img2img_upscale_section.dart:444-448 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/autocomplete/tag_catalog_repository.dart"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a89a3bd1a92b335572672f6cd755687be286ecab0544f54c7b5e90811fa2472"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): lib/core/cloud_sync/backend/github_cloud_sync_backend.dart:441-444 | lib/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart:826-829 | lib/core/cloud_sync/backend/onedrive_cloud_sync_backend.dart:527-530 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/backend/github_cloud_sync_backend.dart"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcbfaf356eae7848edcea9764e9f95d6c75c7fe0aecd63dc907728578fae7d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lib/core/network/web_access/web_access_models.dart:9-10 | lib/data/models/prompt_assistant/prompt_assistant_models.dart:28-32 \u2014 These two members are one piece of code written twice and then edited apart: 2 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/core/network/web_access/web_access_models.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"22997ae0e2706095f4e408de7fb5d4bdb4da0ab9cc194e1c8b546afec96f3777"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/core/watermark/watermark_tone.dart:64-66 | lib/data/services/dlss/dlss_float_frame.dart:133-135 \u2014 These two members are one piece of code written twice and then edited apart: 3 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/core/watermark/watermark_tone.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff74b89821fc1f6d867c22079b8affb66a8b4556c3c609c7ca5ea457e3dd9837"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/presentation/prompt_assistant/providers/prompt_assistant_history_provider.dart:78-81 | lib/presentation/prompt_assistant/providers/prompt_assistant_state_provider.dart:55-58 \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/presentation/prompt_assistant/providers/prompt_assistant_history_provider.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84b159ebbd81cdaeaae5c82ea69c78a0114057caf3019911447a4d7d910f5c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:337-374 | lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:381-418 \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/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:337\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. 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/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cf1991715a80dc32dd9aa56d92aad2e6cac4bea67184a67d9d98f878075364"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): lib/core/database/datasources/gallery_query.dart:584-619 | lib/core/database/datasources/gallery_query.dart:623-658 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/datasources/gallery_query.dart"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"275db898b597ec489a093a433b7ce662403c617bd01a869494c87e8e97c0e85a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): lib/presentation/widgets/character/character_prompt_button.dart:132-166 | lib/presentation/widgets/character/inline_character_row.dart:605-639 \u2014 before extracting anything, compare \u0060lib/presentation/widgets/character/character_prompt_button.dart\u0060 and \u0060lib/presentation/widgets/character/inline_character_row.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 72 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/presentation/widgets/character/inline_character_row.dart:604\u0060 calls \u0060Offset\u0060 and \u0060lib/presentation/widgets/character/character_prompt_button.dart:131\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/presentation/widgets/character/character_prompt_button.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0616aa3b2c78a75297b0ee7c51fb9ffe393eec1af30f5e9c48f0eea48769a57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201333 lines \u00D7 3): lib/core/watermark/watermark_logo_service.dart:152-179 | lib/data/services/precise_ref_portable_importer.dart:14-46 | lib/presentation/prompt_assistant/services/prompt_assistant_service.dart:694-713 \u2014 before extracting anything, compare \u0060lib/core/watermark/watermark_logo_service.dart\u0060 and \u0060lib/data/services/precise_ref_portable_importer.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/data/services/precise_ref_portable_importer.dart:14\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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/core/watermark/watermark_logo_service.dart"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"465a98a3aac80613c85c4d1c178e4386414c5919f776205d025d683eef9e1bf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201332 lines \u00D7 2): lib/core/database/datasources/gallery_album_repository.dart:484-515 | lib/core/database/datasources/gallery_album_repository.dart:576-605 \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/core/database/datasources/gallery_album_repository.dart:484\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/core/database/datasources/gallery_album_repository.dart"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"81375e62ae44dc4ca2fcd68991288fb6946e94665865d49c53da06f3877d4465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): lib/presentation/screens/generation/widgets/comfyui_workflow_dialog.dart:200-231 | lib/presentation/screens/settings/widgets/workflow_import_wizard.dart:160-191 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/generation/widgets/comfyui_workflow_dialog.dart:200\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/presentation/screens/generation/widgets/comfyui_workflow_dialog.dart:198\u0060 calls \u0060LayoutBuilder\u0060 and \u0060lib/presentation/screens/settings/widgets/workflow_import_wizard.dart:159\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/presentation/screens/generation/widgets/comfyui_workflow_dialog.dart"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a327fb2852af7e9f0ecd45c61b1e0bec94109b9fa3bec4f32b518b6d10921da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): lib/presentation/services/image_workflow_launcher.dart:394-424 | lib/presentation/utils/metadata_import_coordinator.dart:46-75 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/services/image_workflow_launcher.dart:394\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/presentation/services/image_workflow_launcher.dart"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"1798c1bf72018f3e1bf1463603cd9570d9ae672f3a01a4e80a8253855ae70a0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): lib/presentation/widgets/prompt/quality_tags_selector.dart:114-144 | lib/presentation/widgets/prompt/uc_preset_selector.dart:188-218 \u2014 before extracting anything, compare \u0060lib/presentation/widgets/prompt/quality_tags_selector.dart\u0060 and \u0060lib/presentation/widgets/prompt/uc_preset_selector.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 76 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/presentation/widgets/prompt/quality_tags_selector.dart:114\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/presentation/widgets/prompt/quality_tags_selector.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43936a4d7ab3a63142dbaaa6e76afdfb237f3c871affd8a8f209eb660bde566"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201330 lines \u00D7 2): lib/core/database/datasources/gallery_image_repository.dart:375-404 | lib/core/database/datasources/gallery_image_repository.dart:438-465 \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/core/database/datasources/gallery_image_repository.dart:375\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. 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/core/database/datasources/gallery_image_repository.dart"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"586c72086739138fdc79b6b3b3438ced64f86fe8e6ebbe9eb19e4d33b6f45258"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): lib/data/cloud_sync/cloud_sync_operation_storage.dart:126-154 | lib/data/cloud_sync/cloud_sync_operation_storage.dart:179-207 \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/data/cloud_sync/cloud_sync_operation_storage.dart"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a46228faa6d78ffb19f2bbe0752ea93b50f40158a2e0ac60d2a199a2a41ab4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): lib/data/services/efficient_vit_sam_service.dart:337-365 | lib/data/services/local_onnx_tagger_service.dart:372-400 \u2014 before extracting anything, compare \u0060lib/data/services/efficient_vit_sam_service.dart\u0060 and \u0060lib/data/services/local_onnx_tagger_service.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 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/data/services/efficient_vit_sam_service.dart"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"add265b5c0d5f250e0b83c97338af3b18ba944386c58568aaa4ba625cefc410c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): lib/presentation/widgets/character/add_character_buttons.dart:149-177 | lib/presentation/widgets/character/add_character_buttons.dart:243-271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/character/add_character_buttons.dart:149\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/presentation/widgets/character/add_character_buttons.dart:241\u0060 calls \u0060of\u0060 and \u0060lib/presentation/widgets/character/add_character_buttons.dart:147\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/presentation/widgets/character/add_character_buttons.dart"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"25da1e51a2e0b02f18cdc100d524f6525252275709557baa3c51731f5ae5414a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): lib/presentation/widgets/character/character_prompt_button.dart:180-207 | lib/presentation/widgets/character/inline_character_row.dart:695-723 \u2014 before extracting anything, compare \u0060lib/presentation/widgets/character/character_prompt_button.dart\u0060 and \u0060lib/presentation/widgets/character/inline_character_row.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 72 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/presentation/widgets/character/character_prompt_button.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c49e3d57fa9475d122ee6df310737605862a3e6cb97e0df9cf05d6b4b7b93c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): lib/presentation/widgets/character/character_prompt_button.dart:341-369 | lib/presentation/widgets/character/character_prompt_button.dart:389-417 \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/presentation/widgets/character/character_prompt_button.dart:341\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/presentation/widgets/character/character_prompt_button.dart"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb278751fd05b6ba22e54a694ab31cdd21115b5f24b2b495921de9846c009c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): lib/core/database/datasources/gallery_metadata_repository.dart:43-69 | lib/core/database/datasources/gallery_metadata_repository.dart:167-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/core/database/datasources/gallery_metadata_repository.dart:198\u0060 calls \u0060_batchUpdateFtsIndex\u0060 and \u0060lib/core/database/datasources/gallery_metadata_repository.dart:70\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/core/database/datasources/gallery_metadata_repository.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2392623a9f6e904d207150a33e02f95c182a1f954bbd26568b9658b67b6ff5ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): lib/data/services/online_gallery/quick_tag_cloud_remote_catalog_service.dart:82-107 | lib/data/services/online_gallery/quick_tag_cloud_remote_catalog_service.dart:334-360 \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/data/services/online_gallery/quick_tag_cloud_remote_catalog_service.dart:334\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/data/services/online_gallery/quick_tag_cloud_remote_catalog_service.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f136f69894216ecebd9806f5553559d8cd5c9807a548744ee76e1a2f1b0f25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): lib/presentation/widgets/prompt/quality_tags_selector.dart:81-106 | lib/presentation/widgets/prompt/uc_preset_selector.dart:90-115 \u2014 before extracting anything, compare \u0060lib/presentation/widgets/prompt/quality_tags_selector.dart\u0060 and \u0060lib/presentation/widgets/prompt/uc_preset_selector.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 76 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/presentation/widgets/prompt/quality_tags_selector.dart:81\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/presentation/widgets/prompt/quality_tags_selector.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae019a54e424ede4f89de25ec0e2315022f28e53982d2f1daf9ffceddd012f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201325 lines \u00D7 3): lib/core/database/datasources/gallery_query.dart:108-132 | lib/core/database/datasources/gallery_query.dart:169-189 | lib/core/database/datasources/gallery_query.dart:254-276 \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/core/database/datasources/gallery_query.dart:108\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/datasources/gallery_query.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b05e11d7affaf00f0b227e558864c40358138e3bdf6af212238ca82a414b190"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 3): lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart:430-454 | lib/presentation/widgets/gallery/gallery_album_tree_view.dart:585-607 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:486-508 \u2014 before extracting anything, compare \u0060lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart\u0060 and \u0060lib/presentation/widgets/gallery/gallery_album_tree_view.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart:430\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/presentation/screens/tag_library_page/widgets/category_tree_view.dart"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5c5e3327c2564e8f20ed095ae87e85f0f25b03444d779e69562c868dfc70d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): lib/core/autocomplete/danbooru_completion_source.dart:52-76 | lib/core/autocomplete/danbooru_completion_source.dart:149-171 \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/core/autocomplete/danbooru_completion_source.dart:52\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/core/autocomplete/danbooru_completion_source.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"045331cd5a7ad31efec33b70fd44e86e922bc5e876ea1a826db11a8c3b3ee5d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): lib/presentation/screens/generation/desktop_layout.dart:195-219 | lib/presentation/screens/generation/web_style_layout.dart:177-200 \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/presentation/screens/generation/desktop_layout.dart:195\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/presentation/screens/generation/desktop_layout.dart"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb822f6cdd1a6275b76b409499fe611579163eab1e5e80dac3a43c16d2ed16b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47\u201348 lines \u00D7 3): lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:451-497 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:521-568 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:578-625 \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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:521\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. 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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"3492ca30d923a24271bb6a8701767b893d71c4931e89c18200406cdd77981eae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): lib/data/services/image_metadata_service.dart:250-273 | lib/data/services/image_metadata_service.dart:368-391 \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/data/services/image_metadata_service.dart:250\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/image_metadata_service.dart"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"9398b6691bd61602db6fbdefacedb53745b61c7b2a78c285861c888fb0cc5cff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): lib/presentation/widgets/auth/third_party_api_login_card.dart:92-113 | lib/presentation/widgets/auth/token_login_card.dart:71-94 \u2014 before extracting anything, compare \u0060lib/presentation/widgets/auth/third_party_api_login_card.dart\u0060 and \u0060lib/presentation/widgets/auth/token_login_card.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 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/presentation/widgets/auth/third_party_api_login_card.dart:92\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/presentation/widgets/auth/third_party_api_login_card.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0bdc6163fc89754c60559647e049746e923f96b5d814b68fdc066839f92018"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): lib/presentation/router/app_router_config.dart:320-342 | lib/presentation/screens/image_comparison_screen.dart:334-356 | lib/presentation/screens/slideshow_screen.dart:424-446 \u2014 before extracting anything, compare \u0060lib/presentation/router/app_router_config.dart\u0060 and \u0060lib/presentation/screens/image_comparison_screen.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/router/app_router_config.dart:320\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/presentation/router/app_router_config.dart"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0f56c9fc0041811d0a29c3c9496bdd280dedd81e6e6d6e5d66e9c0633c1076"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:262-284 | lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:302-324 \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/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"695334613922c5ab7cdfcaf24134b94e08da60e1dc01ee9777e2add142a5fae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): lib/presentation/screens/precise_ref_library/widgets/precise_ref_hover_preview.dart:126-148 | lib/presentation/screens/vibe_library/widgets/vibe_hover_preview.dart:180-200 \u2014 before extracting anything, compare \u0060lib/presentation/screens/precise_ref_library/widgets/precise_ref_hover_preview.dart\u0060 and \u0060lib/presentation/screens/vibe_library/widgets/vibe_hover_preview.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/precise_ref_library/widgets/precise_ref_hover_preview.dart"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af4138c173708e554eabfa6af757ea15ae08f669e5780ec0fdfd8d27dde3b0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): lib/presentation/screens/precise_ref_library/widgets/precise_ref_hover_preview.dart:156-178 | lib/presentation/screens/vibe_library/widgets/vibe_hover_preview.dart:129-151 \u2014 before extracting anything, compare \u0060lib/presentation/screens/precise_ref_library/widgets/precise_ref_hover_preview.dart\u0060 and \u0060lib/presentation/screens/vibe_library/widgets/vibe_hover_preview.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/precise_ref_library/widgets/precise_ref_hover_preview.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ceb7836e9bfde20372898487b5cc3d5fcc11b30819322247836ed0a8993d0f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): lib/presentation/screens/director_tools/widgets/pixel_snap_panel.dart:238-258 | lib/presentation/widgets/auth/credentials_login_form.dart:145-166 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/director_tools/widgets/pixel_snap_panel.dart:238\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/presentation/screens/director_tools/widgets/pixel_snap_panel.dart"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"539c4bc1c6b16cb2e506870229f02a5ea94b7626997f5b3b8197b39ce93148e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart:96-117 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:446-466 \u2014 before extracting anything, compare \u0060lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart\u0060 and \u0060lib/presentation/widgets/gallery/gallery_category_tree_view.dart\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart:96\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/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f44c8a9624b8747091b8f29a141e0b56bb492a3cbce88bb59ea21b296fa4108"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 4): lib/core/utils/pica_lanczos_resizer.dart:317-337 | lib/core/utils/pica_lanczos_resizer.dart:361-381 | lib/core/utils/pica_lanczos_resizer.dart:409-429 | lib/core/utils/pica_lanczos_resizer.dart:457-477 \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/core/utils/pica_lanczos_resizer.dart:317\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/core/utils/pica_lanczos_resizer.dart"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f4ad84a9587ca6ed8a07d3fac887492147edce98ae06c0208f6ef84cd61361"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 3): lib/presentation/router/app_router_config.dart:275-295 | lib/presentation/screens/image_comparison_screen.dart:279-298 | lib/presentation/screens/slideshow_screen.dart:381-400 \u2014 before extracting anything, compare \u0060lib/presentation/router/app_router_config.dart\u0060 and \u0060lib/presentation/screens/image_comparison_screen.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/router/app_router_config.dart:275\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/presentation/router/app_router_config.dart"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4f68fc7a224d4c0eb5a5775765b1a50bd4e1a524111b44053f9db867a495d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): lib/presentation/screens/generation/widgets/reverse_prompt_panel.dart:186-206 | lib/presentation/screens/precise_ref_library/precise_ref_library_screen.dart:668-688 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/generation/widgets/reverse_prompt_panel.dart:186\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/presentation/screens/generation/widgets/reverse_prompt_panel.dart"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2872336f860708dbc9e55d8ceafcfdf8a4aa4e673203bba057e0b99a66b948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): lib/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_bundle_sections.dart:252-272 | lib/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_bundle_sections.dart:309-328 \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/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_bundle_sections.dart:252\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/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_bundle_sections.dart"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c968c04448477eaf458ce7b615c1e0bbf57415a179106a18bb572428ac1b1497"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201320 lines \u00D7 4): lib/core/database/datasources/gallery_query.dart:111-130 | lib/core/database/datasources/gallery_query.dart:172-187 | lib/core/database/datasources/gallery_query.dart:257-274 | lib/core/database/datasources/gallery_query.dart:407-425 \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/core/database/datasources/gallery_query.dart:111\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/datasources/gallery_query.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"3791f91d4e501998a95d0e65fb00b393316552213206e3248bd234b403371b95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4): lib/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart:199-218 | lib/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart:233-252 | lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart:234-253 | lib/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart:256-275 \u2014 before extracting anything, compare \u0060lib/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart\u0060 and \u0060lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart:199\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"03550c96f911f0a1339cc6ad87275dd99d368c81c8155355f7d69e3c2b13d75a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): lib/core/mosaic/mosaic_render_service.dart:286-305 | lib/core/watermark/watermark_render_service.dart:217-236 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/mosaic/mosaic_render_service.dart"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ec02a1a4902138f30ec9150704d0965708ea094cbe5fbae0477b7c6dec9893"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:750-767 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:828-847 \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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:750\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ce5dd7f5fd766bc5837e3e21ac706cd14461945e01812a4bd50841f1f43382"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): lib/presentation/providers/generation/generation_settings_notifiers.dart:155-174 | lib/presentation/providers/generation/generation_settings_notifiers.dart:249-268 \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/presentation/providers/generation/generation_settings_notifiers.dart:155\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/presentation/providers/generation/generation_settings_notifiers.dart"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"8353711702afefb35f475d3c8ba84447a5872474f772054d5fab20c02b82ca90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): lib/presentation/screens/generation/widgets/precise_reference_panel.dart:342-361 | lib/presentation/screens/generation/widgets/vibe_transfer_content.dart:415-434 \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/presentation/screens/generation/widgets/precise_reference_panel.dart:342\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/presentation/screens/generation/widgets/precise_reference_panel.dart"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"155d4ce96dc869cafafe8f7ad88a25d9fd06007840e9e5bd6a03002bcc0126b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): lib/presentation/screens/generation/widgets/precise_reference_panel.dart:848-867 | lib/presentation/screens/generation/widgets/vibe_card.dart:638-657 \u2014 before extracting anything, compare \u0060lib/presentation/screens/generation/widgets/precise_reference_panel.dart\u0060 and \u0060lib/presentation/screens/generation/widgets/vibe_card.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 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/presentation/screens/generation/widgets/precise_reference_panel.dart:848\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/presentation/screens/generation/widgets/precise_reference_panel.dart"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad906da3e8b1b6a05f3199cb2117443265066d06d2e53835c2bfee611362c4f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): lib/presentation/screens/generation/widgets/prompt_input_tooltips.dart:148-167 | lib/presentation/screens/generation/widgets/prompt_input_tooltips.dart:310-329 \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/presentation/screens/generation/widgets/prompt_input_tooltips.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e61bb7bd07e8384ac9e8e0dfa10252dbb876b96cdd08b99911f16070538e4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): lib/presentation/screens/settings/sections/appearance_settings_section.dart:293-312 | lib/presentation/screens/settings/sections/appearance_settings_section.dart:366-385 \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/presentation/screens/settings/sections/appearance_settings_section.dart:293\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/presentation/screens/settings/sections/appearance_settings_section.dart"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"869c338ec3cff9ee05c1af5a4e5686f6c46e8d93544ccb0f64da3d13d297b766"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart:158-177 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:500-517 \u2014 before extracting anything, compare \u0060lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart\u0060 and \u0060lib/presentation/widgets/gallery/gallery_category_tree_view.dart\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart:158\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/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0a49a64b266496c05377be301a862a5b6c7eb56b42173600dc4356c26c71b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): lib/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart:218-237 | lib/presentation/screens/vibe_library/widgets/vibe_import_naming_dialog.dart:203-222 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart:218\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f27d0e1a66331b4c4a2be3b69e970b91e4bac1bbf373aee2f5e77a0f824a65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): lib/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_option_card.dart:296-314 | lib/presentation/screens/vibe_library/widgets/vibe_export_dialog.dart:319-338 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_option_card.dart:296\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_option_card.dart"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9b562c180aee9497174bd523abfdeafc0191cc27fcc1bc0743eb6b39f99839"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4): lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart:441-459 | lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart:153-171 | lib/presentation/widgets/gallery/gallery_album_tree_view.dart:594-612 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:495-513 \u2014 before extracting anything, compare \u0060lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart\u0060 and \u0060lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart:441\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/presentation/screens/tag_library_page/widgets/category_tree_view.dart"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce990ac9a0cbd613f83985c6330c49bcd425c15dd13299324d306034fdca6813"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): lib/presentation/screens/generation/widgets/precise_reference_panel.dart:829-847 | lib/presentation/screens/generation/widgets/vibe_card.dart:617-635 \u2014 before extracting anything, compare \u0060lib/presentation/screens/generation/widgets/precise_reference_panel.dart\u0060 and \u0060lib/presentation/screens/generation/widgets/vibe_card.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 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/presentation/screens/generation/widgets/precise_reference_panel.dart:829\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/widgets/precise_reference_panel.dart"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"2550b17980942bdbaabd06b3ab19b480709a354f932f1561ee32b2ffda6acde3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): lib/presentation/screens/settings/sections/agent/agent_profile_actions.dart:161-179 | lib/presentation/widgets/metadata/metadata_import_dialog.dart:201-219 \u2014 before extracting anything, compare \u0060lib/presentation/screens/settings/sections/agent/agent_profile_actions.dart\u0060 and \u0060lib/presentation/widgets/metadata/metadata_import_dialog.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/settings/sections/agent/agent_profile_actions.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/settings/sections/agent/agent_profile_actions.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"db535c9aa8900c9db417dbad1892b92fa10b93108b54f2ac4394ed4a0da07aa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): lib/presentation/screens/settings/sections/storage_settings_section.dart:505-523 | lib/presentation/screens/settings/sections/storage_settings_section.dart:632-650 \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/presentation/screens/settings/sections/storage_settings_section.dart:505\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/presentation/screens/settings/sections/storage_settings_section.dart"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cad58eb40f67f051ce78e2047f5a81767c0210ddd18af0642e7a622e3674b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): lib/presentation/screens/statistics/widgets/charts/parameter_distribution_bar.dart:85-103 | lib/presentation/screens/statistics/widgets/charts/weekday_bar_chart.dart:107-125 \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/presentation/screens/statistics/widgets/charts/parameter_distribution_bar.dart:85\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/presentation/screens/statistics/widgets/charts/parameter_distribution_bar.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b93bf3b125e836952c7e309cc7092b487a7f06338dd27ed1916706cb14b600f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 2): lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart:128-146 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:477-491 \u2014 before extracting anything, compare \u0060lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart\u0060 and \u0060lib/presentation/widgets/gallery/gallery_category_tree_view.dart\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart:128\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/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8144e803e80365160b21fc47c78f038cd6c49e071e368ceb2df74de65d9b811"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): lib/presentation/widgets/gallery/gallery_album_tree_view.dart:566-581 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:463-481 \u2014 before extracting anything, compare \u0060lib/presentation/widgets/gallery/gallery_album_tree_view.dart\u0060 and \u0060lib/presentation/widgets/gallery/gallery_category_tree_view.dart\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 97 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/presentation/widgets/gallery/gallery_album_tree_view.dart:566\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/gallery/gallery_album_tree_view.dart"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a2a90d950d99f2bd7c0aef60ddc39d7382023880e60d89c8661b5906093b10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): lib/presentation/widgets/image_editor/controllers/magic_wand_controller.dart:277-295 | lib/presentation/widgets/image_editor/effects/image_editor_effects_controller.dart:204-222 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/image_editor/controllers/magic_wand_controller.dart:277\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/presentation/widgets/image_editor/controllers/magic_wand_controller.dart"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"190d860b6a5d4aa90b940dde6261c431ba360b68370996e15e2f6c97761802de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): lib/presentation/widgets/image_editor/widgets/color_picker.dart:231-249 | lib/presentation/widgets/image_editor/widgets/panels/color_panel.dart:439-457 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/image_editor/widgets/color_picker.dart:231\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/presentation/widgets/image_editor/widgets/color_picker.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4479ac697760fc8f01ca48482977cb013b50d3587fc8c252fdf43e92b565ec3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 5): lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:85-101 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:168-184 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:463-480 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:533-550 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:590-607 \u2014 all 5 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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"32beef95510ec5f9837c8521f4a10ab551227fd4a656c1684915231787a5758f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): lib/core/database/datasources/gallery_image_repository.dart:417-434 | lib/core/database/datasources/gallery_image_repository.dart:482-496 \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/core/database/datasources/gallery_image_repository.dart:417\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/core/database/datasources/gallery_image_repository.dart"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"15290c15685c49dc2cbfb44548429c0fd6b6a184e3d81a7ce0c633cdce82ec27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/core/services/windows_update_script.dart:20-37 | lib/core/services/windows_update_script.dart:78-95 \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/core/services/windows_update_script.dart:20\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. 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/core/services/windows_update_script.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aeba4f8258a5c6bf22c0ca84f1c7d67250173346f25950e9224eb5c242d997c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): lib/presentation/prompt_assistant/widgets/prompt_assistant_custom_dialog.dart:247-263 | lib/presentation/widgets/prompt/comfyui_import_dialog.dart:183-200 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/prompt_assistant/widgets/prompt_assistant_custom_dialog.dart:247\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/presentation/prompt_assistant/widgets/prompt_assistant_custom_dialog.dart"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"feebbb8b8c58c6d4f9496ebb76cbafd337754290030ef625ff4c8b312b4a8a02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/presentation/screens/generation/mobile_generation_chrome.dart:324-341 | lib/presentation/screens/generation/widgets/generation_controls/generate_button.dart:145-162 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/generation/mobile_generation_chrome.dart:324\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/presentation/screens/generation/mobile_generation_chrome.dart"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"e100fa81480d98e17460ad723a07cafbf17cae3ff50423b8b5b379dcd57f0f87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): lib/presentation/widgets/common/image_detail/file_image_detail_data.dart:58-74 | lib/presentation/widgets/common/image_detail/image_detail_data.dart:115-132 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/image_detail/file_image_detail_data.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"26be50273061a29cc2401119f81c35bc528a206b9772ef47c1f167dd0795e76a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/presentation/widgets/image_editor/tools/color_picker_tool.dart:638-655 | lib/presentation/widgets/image_editor/tools/selection/base_selection_tool.dart:198-215 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/image_editor/tools/color_picker_tool.dart:638\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/presentation/widgets/image_editor/tools/color_picker_tool.dart"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"289ef79d269b0250146aff1ff805d34a4e44d4c6a43a4c717c551882017da1e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): lib/presentation/widgets/online_gallery/gallery_detail_info_panel.dart:181-198 | lib/presentation/widgets/online_gallery/gallery_detail_info_panel.dart:619-635 \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/presentation/widgets/online_gallery/gallery_detail_info_panel.dart:181\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/presentation/widgets/online_gallery/gallery_detail_info_panel.dart"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8888b0e271556571e5ca24cbd5bd896a64ab2750764d58976c1acb608dcacfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 4): lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart:399-415 | lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart:106-122 | lib/presentation/widgets/gallery/gallery_album_tree_view.dart:559-572 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:456-471 \u2014 before extracting anything, compare \u0060lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart\u0060 and \u0060lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart:399\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/presentation/screens/tag_library_page/widgets/category_tree_view.dart"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29be585bfa181d24c8f53e1b0ad88f925e4c60183809348067efe3718b5eeb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 3): lib/core/database/datasources/gallery_query.dart:74-90 | lib/core/database/datasources/gallery_query.dart:136-150 | lib/core/database/datasources/gallery_query.dart:195-210 \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/core/database/datasources/gallery_query.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. 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/core/database/datasources/gallery_query.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc60f565ffab5666323279a9fdb1a512854bd82fa36bc8d6156989fd92b79359"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): lib/presentation/screens/statistics/widgets/charts/funnel_chart.dart:63-79 | lib/presentation/screens/statistics/widgets/charts/radar_chart.dart:69-85 | lib/presentation/screens/statistics/widgets/charts/stacked_area_chart.dart:66-82 \u2014 before extracting anything, compare \u0060lib/presentation/screens/statistics/widgets/charts/funnel_chart.dart\u0060 and \u0060lib/presentation/screens/statistics/widgets/charts/stacked_area_chart.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 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/presentation/screens/statistics/widgets/charts/funnel_chart.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"db23d13748272bd3e0ce2e61190590e626ebe2a563b8d72f245cf67db510372f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/core/autocomplete/completion_orchestrator.dart:154-170 | lib/core/autocomplete/completion_orchestrator.dart:399-415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/core/autocomplete/completion_orchestrator.dart:154\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/core/autocomplete/completion_orchestrator.dart:416\u0060 calls \u0060_preserveCurrentTranslationState\u0060 and \u0060lib/core/autocomplete/completion_orchestrator.dart:171\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/core/autocomplete/completion_orchestrator.dart"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"36458effa99b7a351738feb7bee95b643b5e304841c50b09ae4a78687f1efcc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/data/datasources/remote/nai_image_generation_api_service.dart:88-104 | lib/data/datasources/remote/nai_image_generation_api_service.dart:156-172 \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/data/datasources/remote/nai_image_generation_api_service.dart:88\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/data/datasources/remote/nai_image_generation_api_service.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"52646293f723b8d7bdde47d15ec28f307ee54f424b18b0f281fc9bd82a8bb8cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart:649-665 | lib/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart:735-751 \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/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart:649\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/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"8148e606b7d97dffc679f05ed876916b5fdbfae629e318f7b08f8174eb1b68fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:69-84 | lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:123-139 \u2014 before extracting anything, compare \u0060lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart\u0060 and \u0060lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:69\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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3be82fcc71d2c33398aa0025632b24ef118f01371bc2996fc63dcbf682c453"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/data/services/local_onnx_tagger_labels.dart:242-258 | lib/data/services/local_onnx_tagger_labels.dart:273-289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/data/services/local_onnx_tagger_labels.dart:242\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/data/services/local_onnx_tagger_labels.dart"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"156e41d3fe58eaa337bd9bd790e2a1d177dd5585cb4b03ac0c6aadc184db0c74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/data/services/vibe_library_migration_service.dart:254-270 | lib/data/services/vibe_library_migration_service.dart:330-346 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/data/services/vibe_library_migration_service.dart:272\u0060 calls \u0060put\u0060, \u0060i\u0060 and \u0060lib/data/services/vibe_library_migration_service.dart:348\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/data/services/vibe_library_migration_service.dart"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"848b433bac1d1fe9952d0362ab7269d3c3bf7c76f2f8a7bdea1865f4ade1edf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/presentation/agent_chat/services/prompt_toolbox.dart:81-97 | lib/presentation/agent_chat/services/prompt_toolbox.dart:105-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/presentation/agent_chat/services/prompt_toolbox.dart:81\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/presentation/agent_chat/services/prompt_toolbox.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1f207eda32874bfecd403a42462f5803943fe42efacd5dad753cb656e40d5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): lib/presentation/screens/prompt_config/widgets/prompt_config_unavailable_states.dart:88-103 | lib/presentation/widgets/prompt/random_manager/preview_generator_panel.dart:589-605 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/prompt_config/widgets/prompt_config_unavailable_states.dart:88\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/presentation/screens/prompt_config/widgets/prompt_config_unavailable_states.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"941d586a4a9d5533685936fd4b6aed0af23db059888d6e4fc06e90c5e049995f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/presentation/screens/settings/sections/privacy_settings_section.dart:284-300 | lib/presentation/screens/settings/sections/privacy_settings_section.dart:398-414 \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/presentation/screens/settings/sections/privacy_settings_section.dart:284\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/presentation/screens/settings/sections/privacy_settings_section.dart"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f49e07c00eed1ff8cee05923112cb989b94ca0e57b888f24a60196fa5234772"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart:269-285 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:306-322 \u2014 before extracting anything, compare \u0060lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart\u0060 and \u0060lib/presentation/widgets/gallery/gallery_category_tree_view.dart\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart:269\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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/presentation/screens/tag_library_page/widgets/category_tree_view.dart"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f69edd43c84f56ed1b41fcc93bef96079b452f4038dead80fc5bade99ecfc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/presentation/widgets/drop/image_destination_dialog.dart:157-173 | lib/presentation/widgets/drop/image_destination_dialog.dart:457-473 \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/presentation/widgets/drop/image_destination_dialog.dart:157\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/presentation/widgets/drop/image_destination_dialog.dart"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"516ea1d3d81a0f7ba21ac656ebcec476ded5e0a959f666da8f4aec1c022bd98f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/presentation/widgets/gallery/local_image_context_menu.dart:126-142 | lib/presentation/widgets/gallery/local_image_context_menu.dart:244-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/presentation/widgets/gallery/local_image_context_menu.dart:126\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/presentation/widgets/gallery/local_image_context_menu.dart"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91669311b390542329d25a70c3e08f7c70d61a8eeec608283428c680e47e605"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/core/network/dio_client.dart:228-243 | lib/data/datasources/remote/nai_auth_api_service.dart:255-270 \u2014 before extracting anything, compare \u0060lib/core/network/dio_client.dart\u0060 and \u0060lib/data/datasources/remote/nai_auth_api_service.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/dio_client.dart"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b02cef1963ec670ad2fad37e87af1fcc9487561690b6af6d37c9f3f0d09d05f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/core/services/file_export_service.dart:305-320 | lib/core/services/file_export_service.dart:334-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/core/services/file_export_service.dart:305\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/core/services/file_export_service.dart"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68a1c199257ee6bed0a01ab1c192d7436c48d435d591da8a81090812cd7dfa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/core/utils/inpaint_outpaint_utils.dart:424-439 | lib/core/utils/inpaint_outpaint_utils.dart:727-742 \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/core/utils/inpaint_outpaint_utils.dart:424\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/core/utils/inpaint_outpaint_utils.dart"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"627fdbd6583fb7524b5844ef1f71a2a8c547e6076c3a282461b11ad97ea89dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): lib/data/cloud_sync/strict_hive_cloud_sync_adapter.dart:163-178 | lib/data/cloud_sync/strict_hive_cloud_sync_adapter.dart:188-202 \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/data/cloud_sync/strict_hive_cloud_sync_adapter.dart:163\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/cloud_sync/strict_hive_cloud_sync_adapter.dart"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd70e82519f3e7610ad554b89717f72b77e9429119254761e2653670893107e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:757-772 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:784-798 \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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:757\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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"7577f7ec65b363677a26bbf9aeff28edb1706fef344804b9a70b9f2cb8723527"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/data/services/image_metadata_service.dart:231-246 | lib/data/services/image_metadata_service.dart:342-357 \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/data/services/image_metadata_service.dart:231\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/data/services/image_metadata_service.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ebc60cd0b5cfc3f7780e09b8be320b037c7892d8ec255089f7e9526f77b061"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): lib/presentation/screens/auth/login_screen.dart:705-720 | lib/presentation/screens/auth/login_screen.dart:754-767 \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/presentation/screens/auth/login_screen.dart:705\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/presentation/screens/auth/login_screen.dart"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"155abd12504c7c30edb3456b476f24d00a0ccb07abec6a017befdb2753679a88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): lib/presentation/screens/generation/widgets/precise_reference_panel.dart:326-340 | lib/presentation/screens/generation/widgets/vibe_transfer_content.dart:398-413 \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/presentation/screens/generation/widgets/precise_reference_panel.dart:326\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/presentation/screens/generation/widgets/precise_reference_panel.dart"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea0f4b91323515bd669756a8373ffdfa3e01cc8872c79b9dac0d54740ce6402"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/presentation/screens/statistics/widgets/charts/funnel_chart.dart:92-107 | lib/presentation/screens/statistics/widgets/charts/stacked_area_chart.dart:95-110 \u2014 before extracting anything, compare \u0060lib/presentation/screens/statistics/widgets/charts/funnel_chart.dart\u0060 and \u0060lib/presentation/screens/statistics/widgets/charts/stacked_area_chart.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 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/presentation/screens/statistics/widgets/charts/funnel_chart.dart:92\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/presentation/screens/statistics/widgets/charts/funnel_chart.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7d3397b14c7e66616757e46714fd539a12520bbb2c83ea969dd4c503eff044"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): lib/presentation/screens/statistics/widgets/dashboard/anlas_cost_card.dart:501-516 | lib/presentation/screens/statistics/widgets/dashboard/other_stats_card.dart:70-84 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/statistics/widgets/dashboard/anlas_cost_card.dart:501\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/presentation/screens/statistics/widgets/dashboard/anlas_cost_card.dart"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"986025756e8bc2a8072fd1bca581e3eee6e6197c903f33b0838d568edb5eaa5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart:212-227 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:247-262 \u2014 before extracting anything, compare \u0060lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart\u0060 and \u0060lib/presentation/widgets/gallery/gallery_category_tree_view.dart\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7054535abe258d4b3327a374d3e31694ba35ae53bee5d5c4a068dcb0c297714"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart:233-248 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:269-284 \u2014 before extracting anything, compare \u0060lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart\u0060 and \u0060lib/presentation/widgets/gallery/gallery_category_tree_view.dart\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart:233\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/presentation/screens/tag_library_page/widgets/category_tree_view.dart"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f21b36e2655f002dd3354030276533b4b90f15bd56295445a9a4b4390350f54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): lib/presentation/screens/tag_library_page/widgets/tag_library_toolbar.dart:289-302 | lib/presentation/widgets/gallery/local_gallery_toolbar.dart:139-154 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/tag_library_page/widgets/tag_library_toolbar.dart"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3557875b4f86099cbc2d24ca3b899b6f56b88f677433a6ef1bb7f616b0862e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): lib/presentation/widgets/auth/third_party_api_login_card.dart:77-90 | lib/presentation/widgets/auth/token_login_card.dart:54-69 \u2014 before extracting anything, compare \u0060lib/presentation/widgets/auth/third_party_api_login_card.dart\u0060 and \u0060lib/presentation/widgets/auth/token_login_card.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 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/presentation/widgets/auth/third_party_api_login_card.dart:77\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/presentation/widgets/auth/third_party_api_login_card.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1e050b89295b099ea2a8f9db2af5840c569e3cc2460d8881dca08e0bff0171"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/presentation/widgets/image_editor/tools/fill_tool.dart:122-137 | lib/presentation/widgets/image_editor/tools/magic_wand_tool.dart:82-97 \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/presentation/widgets/image_editor/tools/fill_tool.dart:122\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/image_editor/tools/fill_tool.dart"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d105312c589fbf2c4f37acc7e0dd81b7fb6e1eb12dc72b683f5e78f43ba8aaa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/presentation/widgets/image_editor/widgets/color_picker.dart:236-251 | lib/presentation/widgets/image_editor/widgets/color_picker.dart:319-334 \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/presentation/widgets/image_editor/widgets/color_picker.dart:236\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/presentation/widgets/image_editor/widgets/color_picker.dart"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eec5fb569aa9c08874b67dbb8bd977dc455af950e84ecad337e0bb862e9d018"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/presentation/widgets/prompt/diy/panels/post_process_rule_panel.dart:337-352 | lib/presentation/widgets/prompt/diy/panels/visibility_rule_panel.dart:223-238 \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/presentation/widgets/prompt/diy/panels/post_process_rule_panel.dart:337\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/presentation/widgets/prompt/diy/panels/post_process_rule_panel.dart"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"195e22b8643b5d350c4015257f454946eac81197187d50ba564c88641bafb082"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/presentation/widgets/prompt/random_manager/preset_selector_bar.dart:326-341 | lib/presentation/widgets/prompt/random_manager/tag_group_card.dart:280-295 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/prompt/random_manager/preset_selector_bar.dart:326\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/presentation/widgets/prompt/random_manager/preset_selector_bar.dart"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"573f92a1bc2faefa59c8e0e77c324b83a3e5181e56db913ca6b66975cb282cdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 6): lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:94-107 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:177-190 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:473-487 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:543-557 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:600-614 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:846-860 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:94\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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:863\u0060 calls \u0060take\u0060, \u0060toList\u0060 and \u0060lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:491\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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"548955be17237b47770a21d816573ddcbbd7ec1fd4291fd15ad076d3739ec3ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): lib/presentation/screens/auth/login_screen.dart:1083-1097 | lib/presentation/screens/auth/login_screen.dart:1161-1175 | lib/presentation/widgets/gallery/gallery_scan_progress_panel.dart:505-519 \u2014 there are 3 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 3 sites; resolving a subset leaves the remainder to drift apart. 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/presentation/screens/auth/login_screen.dart"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9db5de85a0babdb332da0afd0161df25efe369dc693471b864fecafcdffb987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): lib/presentation/screens/generation/widgets/img2img_upscale_section.dart:499-513 | lib/presentation/screens/generation/widgets/precise_reference_panel.dart:851-865 | lib/presentation/screens/generation/widgets/vibe_card.dart:641-655 \u2014 before extracting anything, compare \u0060lib/presentation/screens/generation/widgets/precise_reference_panel.dart\u0060 and \u0060lib/presentation/screens/generation/widgets/vibe_card.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 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/presentation/screens/generation/widgets/img2img_upscale_section.dart:499\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/widgets/img2img_upscale_section.dart"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7403a75d2eb1c793732b78e0492a52b17e131a24ae16de93c0463d8d95574f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): lib/presentation/screens/settings/sections/agent/agent_profile_actions.dart:159-173 | lib/presentation/screens/tag_library_page/widgets/entry_add_dialog.dart:436-450 | lib/presentation/widgets/metadata/metadata_import_dialog.dart:199-213 \u2014 before extracting anything, compare \u0060lib/presentation/screens/settings/sections/agent/agent_profile_actions.dart\u0060 and \u0060lib/presentation/widgets/metadata/metadata_import_dialog.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/settings/sections/agent/agent_profile_actions.dart:159\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/presentation/screens/settings/sections/agent/agent_profile_actions.dart"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ef7c630b499a7ddfd1c7854c3d174b63711a6ecb74838898b1776e0e1cea5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): lib/presentation/screens/vibe_library/vibe_library_workspace.dart:503-517 | lib/presentation/widgets/drop/global_drop_overlay.dart:18-32 | lib/presentation/widgets/drop/global_drop_overlay.dart:82-96 \u2014 there are 3 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 3 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/presentation/screens/vibe_library/vibe_library_workspace.dart:503\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/presentation/screens/vibe_library/vibe_library_workspace.dart"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56aa94ec55419ac7827aba3ace722473b6984283210f7e226c4f7e975b66eb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): lib/presentation/widgets/navigation/nav_rail_account_button.dart:39-53 | lib/presentation/widgets/navigation/nav_rail_items.dart:213-227 | lib/presentation/widgets/navigation/nav_rail_items.dart:318-332 \u2014 there are 3 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 3 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/presentation/widgets/navigation/nav_rail_account_button.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/navigation/nav_rail_account_button.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"795715b0fd72ecf0d27a960526134534b3b1a23a1d68357e3d6804c301ba664c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/core/cloud_sync/oauth/mobile_oauth_clients.dart:200-214 | lib/core/cloud_sync/oauth/mobile_oauth_clients.dart:379-393 \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/core/cloud_sync/oauth/mobile_oauth_clients.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/core/cloud_sync/oauth/mobile_oauth_clients.dart:215\u0060 calls \u0060toString\u0060 and \u0060lib/core/cloud_sync/oauth/mobile_oauth_clients.dart:394\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/core/cloud_sync/oauth/mobile_oauth_clients.dart"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0db861c9d92a5da03ea4b83fd2c0d729042d4cef21cc5b31ce221855b96d92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/core/cloud_sync/oauth/mobile_oauth_clients.dart:284-298 | lib/core/cloud_sync/oauth/mobile_oauth_clients.dart:477-491 \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/core/cloud_sync/oauth/mobile_oauth_clients.dart"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"67af4728c415ed9001ec0c8ab7aaf297486efdd8b9ea9ec97ee63c90a57f5dd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/core/network/web_access/exa_search_client.dart:88-102 | lib/core/network/web_access/searxng_search_client.dart:25-39 \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/core/network/web_access/exa_search_client.dart:88\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/core/network/web_access/exa_search_client.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac6f0689c5cb5fc76614e1975c3970e132e5626d47fc10ac0657d22d6ead73d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/data/datasources/remote/danbooru_api_service.dart:536-550 | lib/data/datasources/remote/danbooru_api_service.dart:556-570 \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/data/datasources/remote/danbooru_api_service.dart:536\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/data/datasources/remote/danbooru_api_service.dart"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6df3b8c0b34870cf65d2be5f4e1b88391ff2d33fb55332b1391b1ddde52754"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/data/services/efficient_vit_sam_service.dart:301-315 | lib/data/services/local_onnx_tagger_service.dart:331-345 \u2014 before extracting anything, compare \u0060lib/data/services/efficient_vit_sam_service.dart\u0060 and \u0060lib/data/services/local_onnx_tagger_service.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 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/data/services/efficient_vit_sam_service.dart"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"5443d94c754f7b7902f0600eedff97b53f3761e00b12f67e3f33e987809f2368"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/data/services/online_gallery/quick_tag_cloud_media_resolver.dart:34-48 | lib/data/services/online_gallery/quick_tag_cloud_media_resolver.dart:149-163 \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/data/services/online_gallery/quick_tag_cloud_media_resolver.dart:34\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/data/services/online_gallery/quick_tag_cloud_media_resolver.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d08e038571702c82cac6cde8c6fd9284edc7c2f086a58517ba57754755bd76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/presentation/providers/online_gallery_blacklist_provider.dart:299-313 | lib/presentation/providers/online_gallery_blacklist_provider.dart:375-389 \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/presentation/providers/online_gallery_blacklist_provider.dart:299\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/online_gallery_blacklist_provider.dart"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a944b62108ef85abf8cee821191f1af51907c29d128edd09102a207bc7a00f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): lib/presentation/screens/settings/sections/storage_settings_section.dart:489-503 | lib/presentation/screens/settings/sections/storage_settings_section.dart:617-630 \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/presentation/screens/settings/sections/storage_settings_section.dart:489\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/presentation/screens/settings/sections/storage_settings_section.dart"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2548b285e103a14b3d791e56a5ebc96d6a234ad895a18c300a0426637ac2191"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart:372-386 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:431-444 \u2014 before extracting anything, compare \u0060lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart\u0060 and \u0060lib/presentation/widgets/gallery/gallery_category_tree_view.dart\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart:372\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/presentation/screens/tag_library_page/widgets/category_tree_view.dart"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fcd01c556ba7a8af375fd6912033f71ea6bc6296b7d07b4b652a968c37daf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart:513-527 | lib/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart:549-563 \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/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart:513\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/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee462ae190648ca8c3351756b0dc1ab2697abf3f79ed7780ce1057933dcebb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/presentation/themes/modules/color/palettes/apple_light_palette.dart:22-36 | lib/presentation/themes/modules/color/palettes/neo_dark_palette.dart:25-39 \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/presentation/themes/modules/color/palettes/apple_light_palette.dart:22\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/presentation/themes/modules/color/palettes/apple_light_palette.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"127c46f0208c0a303d854931dc9312eace90435e185417c163041a3a046a7bb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): lib/presentation/widgets/auth/third_party_api_login_card.dart:185-198 | lib/presentation/widgets/auth/token_login_card.dart:152-166 \u2014 before extracting anything, compare \u0060lib/presentation/widgets/auth/third_party_api_login_card.dart\u0060 and \u0060lib/presentation/widgets/auth/token_login_card.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 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/presentation/widgets/auth/third_party_api_login_card.dart:185\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/presentation/widgets/auth/third_party_api_login_card.dart"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"878fbe31f3f2e7c2c7a60389294b27b2501f7cefa62022dc70933220dbecafb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/presentation/widgets/common/save_vibe_dialog.dart:389-403 | lib/presentation/widgets/prompt/diy/dialogs/preset_import_dialog.dart:381-395 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/common/save_vibe_dialog.dart:389\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/presentation/widgets/common/save_vibe_dialog.dart"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba54f822c88944dda7c89c58bb6395925c6a77fb5526cb67cc0553e2f7a1590"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/presentation/widgets/image_editor/tools/brush_tool.dart:503-517 | lib/presentation/widgets/image_editor/tools/eraser_tool.dart:219-233 \u2014 before extracting anything, compare \u0060lib/presentation/widgets/image_editor/tools/brush_tool.dart\u0060 and \u0060lib/presentation/widgets/image_editor/tools/eraser_tool.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/image_editor/tools/brush_tool.dart:503\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/presentation/widgets/image_editor/tools/brush_tool.dart"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e36bde322743ba3a2a0d0c1d27d3ab79c9c9479ab550bdad7ecb40d20762f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/presentation/widgets/image_editor/widgets/color_picker.dart:193-207 | lib/presentation/widgets/image_editor/widgets/color_picker.dart:283-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/image_editor/widgets/color_picker.dart:193\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/presentation/widgets/image_editor/widgets/color_picker.dart"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6096ad2f9532c2aa424fdbb8beafb41be06f89257306abe2f7554f39ba4374e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): lib/presentation/widgets/prompt/fixed_tags_button.dart:503-517 | lib/presentation/widgets/queue/task_edit_dialog.dart:330-343 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/prompt/fixed_tags_button.dart:503\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. 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/presentation/widgets/prompt/fixed_tags_button.dart"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9888f2f31021ea6e81d9d9bc2891c558d43c93876044747018e43dfd3d8fa14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/presentation/widgets/prompt/fixed_tags_dialog_chrome.dart:41-55 | lib/presentation/widgets/prompt/fixed_tags_dialog_chrome.dart:190-204 \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/presentation/widgets/prompt/fixed_tags_dialog_chrome.dart:41\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/presentation/widgets/prompt/fixed_tags_dialog_chrome.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"96172bda4d1fd8e1fa74223f662c586355e59f62f452848760e31d4b1234f286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 5): lib/presentation/router/app_router_config.dart:282-294 | lib/presentation/screens/auth/login_screen.dart:103-115 | lib/presentation/screens/image_comparison_screen.dart:286-298 | lib/presentation/screens/slideshow_screen.dart:388-400 | lib/presentation/screens/splash/splash_screen.dart:87-100 \u2014 before extracting anything, compare \u0060lib/presentation/router/app_router_config.dart\u0060 and \u0060lib/presentation/screens/image_comparison_screen.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/router/app_router_config.dart:282\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/presentation/router/app_router_config.dart"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d4b2d0ebd1ce352d0c999d511349be141b37a3c7aa4bf6654d0a4d9677fc00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): lib/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart:411-424 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:127-140 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:208-221 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:497-510 \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/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart:411\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/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f53dd586700a75f88e409b4b415b9ec60b74609aceb1a5a494de1689ead057f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): lib/data/datasources/remote/danbooru_api_service.dart:279-292 | lib/data/datasources/remote/danbooru_api_service.dart:480-493 | lib/data/datasources/remote/danbooru_api_service.dart:608-621 \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/data/datasources/remote/danbooru_api_service.dart:279\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/data/datasources/remote/danbooru_api_service.dart"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f1d519636bdd884425219a8234099b632a8946761e33c8a3d02a8e82fd8de2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): lib/core/cloud_sync/backend/webdav_collection_ensurer.dart:112-124 | lib/core/cloud_sync/backend/webdav_etag_reader.dart:46-59 \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/core/cloud_sync/backend/webdav_collection_ensurer.dart:112\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/core/cloud_sync/backend/webdav_collection_ensurer.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee195f2954e3b84050251cc9a78cfd48d1add6bb917212caedf3ba654a32ba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): lib/core/database/datasources/gallery_album_repository.dart:514-527 | lib/core/database/datasources/gallery_album_repository.dart:610-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/core/database/datasources/gallery_album_repository.dart:514\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/core/database/datasources/gallery_album_repository.dart"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17a47b5e2a7e4b0bceb1e871d3da7fcf45e13d261acac8e4d31decac831e15d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/data/services/gallery/gallery_scan_coordinator.dart:51-64 | lib/data/services/gallery/local_gallery_service_impl.dart:68-81 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/data/services/gallery/gallery_scan_coordinator.dart:51\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/data/services/gallery/local_gallery_service_impl.dart:65\u0060 calls \u0060value\u0060 and \u0060lib/data/services/gallery/gallery_scan_coordinator.dart:50\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/data/services/gallery/gallery_scan_coordinator.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e24c619a99462d435862f3cb4a2ff0fe8caaff71cb5644a05347575cf07d745"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/presentation/agent_chat/providers/agent_chat_notifier.dart:1356-1369 | lib/presentation/agent_chat/services/agent_chat_event_controller.dart:275-288 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/providers/agent_chat_notifier.dart"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e5ae5b7d3e5980072602450017e9c80088989d97c2c709c1fea664be173a35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/presentation/agent_chat/services/agent_api_client.dart:23-36 | lib/presentation/prompt_assistant/services/prompt_assistant_api_client.dart:120-133 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/agent_api_client.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d071b431862c4f0aa467dc192b314b501b2f2012de5859aba97a99d841399c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/presentation/router/global_status_banners.dart:82-95 | lib/presentation/router/global_status_banners.dart:140-153 \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/presentation/router/global_status_banners.dart:82\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/presentation/router/global_status_banners.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"52952273e513e98c6b039b3c7022cab771e3df4335e0ccbc33a6f2a6bca3b3be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/presentation/screens/generation/widgets/comfyui_workflow_dialog.dart:575-588 | lib/presentation/screens/generation/widgets/img2img_upscale_section.dart:331-344 \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/presentation/screens/generation/widgets/comfyui_workflow_dialog.dart:575\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/presentation/screens/generation/widgets/comfyui_workflow_dialog.dart"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"8caf9784e9f9d5a99409525200b3ba79fe5b698306f3b339fbc59655a25a8e69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/presentation/screens/settings/sections/agent/agent_profile_actions.dart:197-210 | lib/presentation/screens/settings/sections/agent/skill_management_panel.dart:308-321 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/settings/sections/agent/agent_profile_actions.dart"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"7490eba891cf3deaace871404ae0b8b86102d30a2827ba3fa2f22334ca4475f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/presentation/screens/settings/widgets/cache_statistics_tile.dart:216-229 | lib/presentation/widgets/queue/task_list_item.dart:1233-1246 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/settings/widgets/cache_statistics_tile.dart"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a8227043805783dbb76628a44cdb3695a357a6bbe807515087400b99e5045a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): lib/presentation/screens/tag_library_page/widgets/import_dialog.dart:355-366 | lib/presentation/screens/tag_library_page/widgets/import_dialog.dart:399-412 \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/presentation/screens/tag_library_page/widgets/import_dialog.dart:355\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. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/tag_library_page/widgets/import_dialog.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f66b0f91a302800325f617bc92575aee30556e3b3a19529557a96df72530a9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): lib/presentation/screens/watermark/watermark_editor_screen.dart:817-829 | lib/presentation/screens/watermark/watermark_editor_screen.dart:833-846 \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/presentation/screens/watermark/watermark_editor_screen.dart:817\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/presentation/screens/watermark/watermark_editor_screen.dart"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d345a173bba1820caac816019d4bea8d3d40bdabcfc37263cc5becf50ad337"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/presentation/services/library_sidebar_move_service.dart:28-41 | lib/presentation/services/library_sidebar_move_service.dart:50-63 \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/presentation/services/library_sidebar_move_service.dart:28\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/presentation/services/library_sidebar_move_service.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2228be948a6967c568345b646f02b9532e7d634ee4574b382c8ba16a792cbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/presentation/widgets/autocomplete/autocomplete_wrapper.dart:60-73 | lib/presentation/widgets/autocomplete/autocomplete_wrapper.dart:91-104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/autocomplete/autocomplete_wrapper.dart:60\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/presentation/widgets/autocomplete/autocomplete_wrapper.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b248122470291c12d779240ab7e6a8c706693ba7c80ffd0fea97c7e3e41f70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/presentation/widgets/common/app_toast.dart:381-394 | lib/presentation/widgets/common/app_toast.dart:566-579 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/presentation/widgets/common/app_toast.dart:563\u0060 calls \u0060clamp\u0060 and \u0060lib/presentation/widgets/common/app_toast.dart:380\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/presentation/widgets/common/app_toast.dart"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"eada157990844f736017e4d4d99a999ef9cd2bef5de2d576630d2a749262b923"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/presentation/widgets/common/save_as_preset_dialog.dart:440-453 | lib/presentation/widgets/common/save_vibe_dialog.dart:344-357 \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/presentation/widgets/common/save_as_preset_dialog.dart:440\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/presentation/widgets/common/save_as_preset_dialog.dart"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"45daf1e2ea4d5823116ca1dceefbb36e05c3bcda36614323d0c19942c2822a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/presentation/widgets/danbooru_post_card.dart:940-953 | lib/presentation/widgets/danbooru_post_card.dart:1201-1214 \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/presentation/widgets/danbooru_post_card.dart"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7c332ac9c7c29e970befa194c4ba478a227ccc83765b4d3fc31aa0a5ce32cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/presentation/widgets/image_editor/tools/brush_tool.dart:215-228 | lib/presentation/widgets/image_editor/tools/eraser_tool.dart:79-92 \u2014 before extracting anything, compare \u0060lib/presentation/widgets/image_editor/tools/brush_tool.dart\u0060 and \u0060lib/presentation/widgets/image_editor/tools/eraser_tool.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/presentation/widgets/image_editor/tools/brush_tool.dart:232\u0060 calls \u0060strokeStyleFor\u0060 and \u0060lib/presentation/widgets/image_editor/tools/eraser_tool.dart:96\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/presentation/widgets/image_editor/tools/brush_tool.dart"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"720a920dc88c8a9a4099e676e988d12317f4ca31dab6241473a037fb9675b7ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/presentation/widgets/model3d_editor/model3d_editor_screen.dart:201-214 | lib/presentation/widgets/model3d_editor/model3d_editor_screen.dart:374-387 \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/presentation/widgets/model3d_editor/model3d_editor_screen.dart:201\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/presentation/widgets/model3d_editor/model3d_editor_screen.dart"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ada7072f4d7c4468b6cd9b261798efe2174d86f29ef4693635ab346cf23086f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/presentation/widgets/online_gallery/blacklist_settings_panel.dart:600-613 | lib/presentation/widgets/online_gallery/blacklist_settings_panel.dart:675-688 \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/presentation/widgets/online_gallery/blacklist_settings_panel.dart:600\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/presentation/widgets/online_gallery/blacklist_settings_panel.dart"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a28738f3f14b5a000bcd49f3d5491fc30fe02f240feaebc19f103253f377f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/presentation/widgets/online_gallery/gallery_generation_transfer_dialog.dart:119-132 | lib/presentation/widgets/online_gallery/gallery_prompt_copy_dialog.dart:70-83 \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/presentation/widgets/online_gallery/gallery_generation_transfer_dialog.dart:119\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/online_gallery/gallery_generation_transfer_dialog.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"97be67b7857106ad7d7a1496b485ee3fa4a74f59b74f4ed60edd2fd659f0e411"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/presentation/widgets/prompt/global_settings_dialog.dart:440-453 | lib/presentation/widgets/prompt/random_manager/tag_group_diy_section.dart:78-92 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/prompt/global_settings_dialog.dart:440\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/prompt/global_settings_dialog.dart"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90dc7fd46cbadd3d3dac6a37d3b88b6810920df988d9a4b5bc6d3d723dcffaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): lib/presentation/screens/settings/sections/agent/agent_profile_actions.dart:159-171 | lib/presentation/screens/tag_library_page/widgets/entry_add_dialog.dart:436-448 | lib/presentation/widgets/character/add_to_library_dialog.dart:387-399 | lib/presentation/widgets/metadata/metadata_import_dialog.dart:199-211 \u2014 before extracting anything, compare \u0060lib/presentation/screens/settings/sections/agent/agent_profile_actions.dart\u0060 and \u0060lib/presentation/widgets/metadata/metadata_import_dialog.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/settings/sections/agent/agent_profile_actions.dart:159\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/presentation/screens/settings/sections/agent/agent_profile_actions.dart"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2ab9b6637274d2051abfe47980ad51531727049f0d36cd0433f402c680e1c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): lib/core/network/dio_client.dart:227-239 | lib/core/storage/secure_storage_service.dart:541-553 | lib/data/datasources/remote/nai_auth_api_service.dart:254-266 \u2014 before extracting anything, compare \u0060lib/core/network/dio_client.dart\u0060 and \u0060lib/data/datasources/remote/nai_auth_api_service.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/core/network/dio_client.dart:227\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/core/network/dio_client.dart"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95ccb450ebc40a54e497ced6aa3343372dd902d4246f82a6484ce4a177166bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 3): lib/data/cloud_sync/vibe_library_cloud_sync_adapter.dart:203-215 | lib/data/services/vibe_library_entry_reader.dart:131-141 | lib/data/services/vibe_library_entry_writer.dart:335-343 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/data/cloud_sync/vibe_library_cloud_sync_adapter.dart:203\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/data/cloud_sync/vibe_library_cloud_sync_adapter.dart"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abb2dc5eff2d476b3d93ffc5c60c7344c0bf98f824b3d855cfd2b494339823b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): lib/presentation/widgets/bulk_metadata_edit_dialog.dart:260-272 | lib/presentation/widgets/online_gallery/blacklist_settings_panel.dart:242-254 | lib/presentation/widgets/online_gallery/gallery_detail_primary_actions.dart:61-73 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/bulk_metadata_edit_dialog.dart:260\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/presentation/widgets/bulk_metadata_edit_dialog.dart"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dda8c10d6d388197a82bb7654973b73cb3d9e06792756e1fdd072a9b3a58ee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/core/cloud_sync/backend/webdav_capability_probe.dart:165-177 | lib/core/cloud_sync/backend/webdav_capability_probe.dart:178-190 \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/core/cloud_sync/backend/webdav_capability_probe.dart"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc874c4ea0716fb96eedfa299e45053b7872f6b76ec044f58457563f7e74711"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/core/database/datasources/gallery_favorite_tag_repository.dart:171-183 | lib/core/database/datasources/gallery_favorite_tag_repository.dart:314-326 \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/core/database/datasources/gallery_favorite_tag_repository.dart:171\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. 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/core/database/datasources/gallery_favorite_tag_repository.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e19a73d28010b47f36690c0489db81ef47a9ddc6c2828a5a5ea54ecaf15328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/core/utils/fatal_diagnostics.dart:182-194 | lib/core/utils/fatal_diagnostics.dart:198-210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/core/utils/fatal_diagnostics.dart:182\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/core/utils/fatal_diagnostics.dart"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"997465e09b620c07f44873a45a0f63e9457a656a979b012151d62eb87a702b36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/core/utils/inpaint_mask/inpaint_mask_operations.dart:1392-1404 | lib/core/utils/inpaint_mask/inpaint_mask_operations.dart:1420-1432 \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/core/utils/inpaint_mask/inpaint_mask_operations.dart:1392\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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"8426164040039e52fc6cd9172682f1f9f1d20454064ea716e8c888745977dfbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/data/datasources/remote/danbooru_api_service.dart:519-531 | lib/data/datasources/remote/danbooru_api_service.dart:541-553 \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/data/datasources/remote/danbooru_api_service.dart:519\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/data/datasources/remote/danbooru_api_service.dart"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"f259ddd8fe5d5b41044af7e1d6a3485044a79a3889e4f1fbeaec25dc0f1cf6fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): lib/data/services/official_random_prompt_generator.dart:197-209 | lib/data/services/official_random_prompt_generator.dart:744-755 \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/data/services/official_random_prompt_generator.dart:197\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/data/services/official_random_prompt_generator.dart"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d69c8fa42f323281d216125680494a02951848dba1298065d6dd8867811134"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/data/services/tag_library_import_planner.dart:80-92 | lib/data/services/tag_library_import_planner.dart:119-131 \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/data/services/tag_library_import_planner.dart:80\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/data/services/tag_library_import_planner.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d1f23aa55f71c86d1b0c37af54b6ba868a19fa2c9a08376c43250da3733012"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): lib/data/services/vibe_file_document_codec.dart:148-159 | lib/data/services/vibe_file_document_codec.dart:238-250 \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/data/services/vibe_file_document_codec.dart:238\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/data/services/vibe_file_document_codec.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3137722e6addb8c9a4c04293c838e56f80222a478c569a30a7578a7b2696180a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): lib/presentation/agent_chat/widgets/agent_chat_resource_widgets.dart:895-907 | lib/presentation/agent_chat/widgets/agent_chat_resource_widgets.dart:933-944 \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/presentation/agent_chat/widgets/agent_chat_resource_widgets.dart:895\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/presentation/agent_chat/widgets/agent_chat_resource_widgets.dart"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af470f338b6b35213e9858aa582ad068cbe212bc83f91451e80eab7b88847f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/presentation/agent_chat/widgets/agent_chat_tool_widgets.dart:272-284 | lib/presentation/agent_chat/widgets/agent_chat_turn.dart:494-507 \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/presentation/agent_chat/widgets/agent_chat_tool_widgets.dart:272\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/presentation/agent_chat/widgets/agent_chat_tool_widgets.dart"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e952c3d0ac2b6d06bb0ade2abf1c66ddedabee1ef9e80ad47bd84b5819ee48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/presentation/providers/generation/image_generation_coordinator.dart:531-543 | lib/presentation/providers/generation/image_generation_coordinator.dart:551-563 \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/presentation/providers/generation/image_generation_coordinator.dart:531\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/presentation/providers/generation/image_generation_coordinator.dart"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2613decec0bdae625a4dafea788e9a8411089910af4777d7b62a508e7ff5ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/presentation/screens/generation/widgets/img2img_panel.dart:85-97 | lib/presentation/screens/generation/widgets/unified_reference_panel.dart:372-384 \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/presentation/screens/generation/widgets/img2img_panel.dart:85\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/presentation/screens/generation/widgets/img2img_panel.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b32042aaad28fdd74824c076b2e671dabd51a7c14dc244d25a3c01d9fe39e53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/presentation/screens/online_gallery/online_gallery_content.dart:87-99 | lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_auth_dialogs.dart:38-50 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/online_gallery/online_gallery_content.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2b88c9acb9fbfff0fc22b292645be00a34f635c2f841996d8b1d67915e4e98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_source_controls.dart:170-182 | lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_source_controls.dart:211-223 \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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_source_controls.dart:170\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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_source_controls.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0335a0b81852438ba5598ab0baee9520786b0e91503630e695f67fffd57704"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/presentation/screens/tag_library_page/widgets/import_dialog.dart:206-218 | lib/presentation/widgets/danbooru_login_dialog.dart:162-174 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/tag_library_page/widgets/import_dialog.dart:206\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/presentation/screens/tag_library_page/widgets/import_dialog.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b46fea3e0d1a224c7da55480b44b1400ab3aa9d23929f33d3c67ebbd999319"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/presentation/widgets/auth/third_party_api_login_card.dart:156-169 | lib/presentation/widgets/auth/token_login_card.dart:119-131 \u2014 before extracting anything, compare \u0060lib/presentation/widgets/auth/third_party_api_login_card.dart\u0060 and \u0060lib/presentation/widgets/auth/token_login_card.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 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/presentation/widgets/auth/third_party_api_login_card.dart:156\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/presentation/widgets/auth/third_party_api_login_card.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56c4369b47112f5cf1dd5d64fb1ab05a820b6821bb05f474aa1732291e03756"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/presentation/widgets/common/image_detail/components/vibe_section.dart:328-340 | lib/presentation/widgets/common/image_detail/components/vibe_section.dart:347-359 \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/presentation/widgets/common/image_detail/components/vibe_section.dart:328\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/image_detail/components/vibe_section.dart"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bcafa2b983da854c918049853c31cb6a4a1fcca0860eaa96c5cac6138ab0e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/presentation/widgets/image_editor/effects/effects_preview_dialog.dart:241-253 | lib/presentation/widgets/prompt/diy/panels/dependency_config_panel.dart:682-694 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/image_editor/effects/effects_preview_dialog.dart:241\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/presentation/widgets/image_editor/effects/effects_preview_dialog.dart"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a192b01113b963cbcb2d65f5b1591ae4ee6e026932536d354b106e5881fb6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): lib/presentation/widgets/image_editor/tools/blur_tool.dart:176-188 | lib/presentation/widgets/image_editor/tools/clone_stamp_tool.dart:329-340 \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/presentation/widgets/image_editor/tools/blur_tool.dart:176\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/presentation/widgets/image_editor/tools/clone_stamp_tool.dart:327\u0060 calls \u0060SizedBox\u0060, \u0060_CloneSourceControls\u0060 and \u0060lib/presentation/widgets/image_editor/tools/blur_tool.dart:176\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/presentation/widgets/image_editor/tools/blur_tool.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fd78d00b9d9d47b10486c435dc5dcbab967a8dc55fdff4016400c1c08452ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): lib/presentation/screens/statistics/widgets/animated/animated_bar_chart.dart:38-49 | lib/presentation/screens/statistics/widgets/animated/animated_number.dart:39-50 | lib/presentation/screens/statistics/widgets/animated/animated_pie_chart.dart:38-49 | lib/presentation/screens/statistics/widgets/charts/heatmap_chart.dart:75-86 | lib/presentation/screens/statistics/widgets/charts/polar_activity_chart.dart:45-56 \u2014 before extracting anything, compare \u0060lib/presentation/screens/statistics/widgets/animated/animated_bar_chart.dart\u0060 and \u0060lib/presentation/screens/statistics/widgets/animated/animated_pie_chart.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 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/presentation/screens/statistics/widgets/animated/animated_bar_chart.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c202214a60995fe0b7910b01e5a923eb6d1696f4c38e12d37486e004aabed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): lib/core/utils/novelai_vibe_codec.dart:291-302 | lib/core/watermark/watermark_logo_service.dart:158-169 | lib/data/services/precise_ref_portable_importer.dart:20-31 | lib/presentation/prompt_assistant/services/prompt_assistant_service.dart:692-703 \u2014 before extracting anything, compare \u0060lib/core/watermark/watermark_logo_service.dart\u0060 and \u0060lib/data/services/precise_ref_portable_importer.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/core/utils/novelai_vibe_codec.dart:291\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/core/utils/novelai_vibe_codec.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"a162a5e9806484c3eb08a2ff8640110ef3b6e89e39ff2a3e48c9e12c88b542a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): lib/presentation/widgets/common/add_to_library_dialog.dart:415-426 | lib/presentation/widgets/image_editor/effects/effects_preview_dialog.dart:239-250 | lib/presentation/widgets/prompt/diy/panels/dependency_config_panel.dart:680-691 | lib/presentation/widgets/prompt/fixed_tag_edit_dialog.dart:682-693 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/common/add_to_library_dialog.dart:415\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/presentation/widgets/common/add_to_library_dialog.dart"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd9cb2094ae69c50e89e5ce48f5a9288d3b5a3d75ce7f8d9b2fffb57d6bba24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): lib/presentation/router/app_router_config.dart:306-317 | lib/presentation/screens/image_comparison_screen.dart:320-331 | lib/presentation/screens/slideshow_screen.dart:410-421 \u2014 before extracting anything, compare \u0060lib/presentation/router/app_router_config.dart\u0060 and \u0060lib/presentation/screens/image_comparison_screen.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/router/app_router_config.dart:306\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/presentation/router/app_router_config.dart"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b28c17942bdae6bfa8a5720f51464215f63b0ba5548725399e5ad2fbb39f58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): lib/presentation/themes/modules/color/palettes/apple_light_palette.dart:24-35 | lib/presentation/themes/modules/color/palettes/minimal_glass_palette.dart:27-38 | lib/presentation/themes/modules/color/palettes/neo_dark_palette.dart:27-38 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/presentation/themes/modules/color/palettes/minimal_glass_palette.dart:39\u0060 calls \u0060Color\u0060 and \u0060lib/presentation/themes/modules/color/palettes/apple_light_palette.dart:36\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/presentation/themes/modules/color/palettes/apple_light_palette.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf480f4eccda7c1151bbbe4078f9bc357a47cd4edf4bb5ca87c377954b0979c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/core/cloud_sync/data_source.dart:46-57 | lib/data/cloud_sync/verified_blob_store.dart:27-38 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/data_source.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5695e36f394a09fc7e17d3a360c74c9ece157b1451f90a5db15b8a15e79eb53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/core/utils/file_explorer_utils.dart:74-85 | lib/core/utils/file_explorer_utils.dart:99-110 \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/core/utils/file_explorer_utils.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/core/utils/file_explorer_utils.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2385d8d4204a27878ab33e67778c13f48618998116bfe8c389f42d325098d266"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/core/utils/pica_lanczos_resizer.dart:382-393 | lib/core/utils/pica_lanczos_resizer.dart:478-489 \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/core/utils/pica_lanczos_resizer.dart:382\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/core/utils/pica_lanczos_resizer.dart"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"30493da63468e1eb329e3a644ee6b4ce327c60db14680bf19a74af8a0515d4d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:162-173 | lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:425-436 \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/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e82b845938f18c9198785d5c85ecf0dac7845354525fcd94b107cceb06853b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/data/services/official_random_prompt_generator.dart:141-152 | lib/data/services/official_random_prompt_generator.dart:933-944 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/official_random_prompt_generator.dart"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b63498ab52aae9f6594a2955f8d16a4f302aa984514c5d9e9e2818807cc2dfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/data/services/vibe_import_service.dart:208-219 | lib/data/services/vibe_import_service.dart:263-274 \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/data/services/vibe_import_service.dart:208\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. 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/data/services/vibe_import_service.dart"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81df1d368d8a2ff2edff32036a6c3ba824083f180b4b0e6d0001d5b46fac8c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/agent_chat/services/fixed_tags_toolbox.dart:226-237 | lib/presentation/agent_chat/services/queue_toolbox.dart:131-142 \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/presentation/agent_chat/services/fixed_tags_toolbox.dart:226\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/presentation/agent_chat/services/fixed_tags_toolbox.dart"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"2941b8dcbc31ed4555f75a75170cc8997026f25caa526308b975df4aa572ea1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/agent_chat/services/precise_reference_toolbox.dart:60-71 | lib/presentation/agent_chat/services/vibe_library_toolbox.dart:54-65 \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/presentation/agent_chat/services/precise_reference_toolbox.dart:60\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/presentation/agent_chat/services/precise_reference_toolbox.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"51788b8af010cde73cfb252b10ab4d5ed68533b7a08ddb68e7d9fa05eee5f570"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/agent_chat/services/web_access_toolbox.dart:130-141 | lib/presentation/agent_chat/services/web_access_toolbox.dart:160-171 \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/presentation/agent_chat/services/web_access_toolbox.dart:130\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/presentation/agent_chat/services/web_access_toolbox.dart"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8455ea56a543f7df1baf01f033abb1d25c42ba0b80760caa3ccdb57996fd7b4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/providers/comfyui/comfyui_provider.dart:371-382 | lib/presentation/providers/comfyui/comfyui_provider.dart:442-453 \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/presentation/providers/comfyui/comfyui_provider.dart:371\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/comfyui/comfyui_provider.dart"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fa7be7d440934c3172106ad72ce525730f8cf481ae30857b55e6ff3f38785f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): lib/presentation/providers/precise_ref_library_provider.dart:328-339 | lib/presentation/providers/precise_ref_library_provider.dart:345-355 \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/presentation/providers/precise_ref_library_provider.dart:328\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/precise_ref_library_provider.dart"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbe5c3d6c0418d1ad7c5e720179342a2c50c31dfac6d5f013b42cfffc98248e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/screens/director_tools/director_tools_screen.dart:601-612 | lib/presentation/screens/tag_library_page/widgets/entry_selector_dialog.dart:256-267 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/director_tools/director_tools_screen.dart:601\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/presentation/screens/director_tools/director_tools_screen.dart:599\u0060 calls \u0060labelKey\u0060 and \u0060lib/presentation/screens/tag_library_page/widgets/entry_selector_dialog.dart:254\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/presentation/screens/director_tools/director_tools_screen.dart"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b4e8f37eb4b1ee05d550e16afd43ac5044ad70562dd7f34712be2a34b7b392"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/screens/mosaic/mosaic_editor_preview.dart:108-119 | lib/presentation/screens/watermark/watermark_editor_screen.dart:654-665 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/mosaic/mosaic_editor_preview.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/mosaic/mosaic_editor_preview.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"7747e8d1496c744d72f028aff8ca6f2323d72973b06770e42e01c1a63203a247"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): lib/presentation/screens/tag_library_page/widgets/entry_card.dart:92-102 | lib/presentation/screens/tag_library_page/widgets/entry_list_item.dart:90-101 \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/presentation/screens/tag_library_page/widgets/entry_card.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fd849dc092a4276e647e1b40f95ad01576aa7bc60af63c47b5a3454d068e3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/screens/tag_library_page/widgets/export_dialog.dart:29-40 | lib/presentation/screens/vibe_library/widgets/vibe_export_dialog_advanced.dart:35-46 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/tag_library_page/widgets/export_dialog.dart:29\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/presentation/screens/tag_library_page/widgets/export_dialog.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"524303d2d4f98d0028ab91370a96922d888f35f947bec47644d41254571eaf75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/screens/vibe_library/widgets/vibe_detail_viewer.dart:143-154 | lib/presentation/screens/watermark/watermark_editor_controls.dart:544-555 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/vibe_library/widgets/vibe_detail_viewer.dart:143\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/presentation/screens/vibe_library/widgets/vibe_detail_viewer.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"7678e2f2f5ef420389aa1e0d096766fe9b9fcbd64a7a35b4f935e47bcfe3f3eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/screens/vibe_library/widgets/vibe_export_dialog_advanced.dart:242-253 | lib/presentation/screens/vibe_library/widgets/vibe_export_dialog_advanced.dart:261-272 \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/presentation/screens/vibe_library/widgets/vibe_export_dialog_advanced.dart:242\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/presentation/screens/vibe_library/widgets/vibe_export_dialog_advanced.dart"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"03628f4e7e11fcd981ffbc314e3d9fbd2a3edc7eef638aaa4e7629346d614892"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/themes/modules/color/palettes/editorial_palette.dart:22-33 | lib/presentation/themes/modules/color/palettes/zen_palette.dart:29-40 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/themes/modules/color/palettes/editorial_palette.dart:22\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/presentation/themes/modules/color/palettes/zen_palette.dart:41\u0060 calls \u0060Color\u0060 and \u0060lib/presentation/themes/modules/color/palettes/editorial_palette.dart:34\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/presentation/themes/modules/color/palettes/editorial_palette.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0102ce56279cf107d9f06d7443f48c6396f43ca5ad4f82dbc8618bcf1ecfc0e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/themes/modules/color/palettes/editorial_palette.dart:36-47 | lib/presentation/themes/modules/color/palettes/zen_palette.dart:45-56 \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/presentation/themes/modules/color/palettes/editorial_palette.dart:36\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/presentation/themes/modules/color/palettes/editorial_palette.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5212099975d1dfbfde781b25b9b0c072243909549149bee1f4859b33fcf3adf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/widgets/common/image_detail/components/detail_metadata_panel.dart:910-921 | lib/presentation/widgets/online_gallery/ai_tag_generation_info_section.dart:236-247 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/common/image_detail/components/detail_metadata_panel.dart:910\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/image_detail/components/detail_metadata_panel.dart"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f984166359f2acaefa54a8610f6518c5d0c125c8e5ea95b5459d773b60ae93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/widgets/common/image_detail/components/prompt_section.dart:532-543 | lib/presentation/widgets/common/image_detail/components/vibe_section.dart:224-235 \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/presentation/widgets/common/image_detail/components/prompt_section.dart:532\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/image_detail/components/prompt_section.dart"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a88c5359539d0957d9ad7d42b4d84c932c7d3c7c0c25303ec4a7fdefa9bfc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/widgets/common/themed_confirm_dialog.dart:252-263 | lib/presentation/widgets/common/themed_confirm_dialog.dart:420-431 \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/presentation/widgets/common/themed_confirm_dialog.dart"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2f3835acb73cac4196ae08668e6f43aea5a929d2b86f4241bff881f0b26727"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/widgets/danbooru_login_dialog.dart:64-75 | lib/presentation/widgets/gelbooru_credentials_dialog.dart:120-131 \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/presentation/widgets/danbooru_login_dialog.dart:64\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/presentation/widgets/danbooru_login_dialog.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e298675daf2e0094c6930d1bedbb6961c31fac291dd0a503ea03ceb011a11f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/widgets/online_gallery/blacklist_settings_panel.dart:382-393 | lib/presentation/widgets/online_gallery/output_filter_settings_panel.dart:105-116 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/online_gallery/blacklist_settings_panel.dart:382\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/presentation/widgets/online_gallery/blacklist_settings_panel.dart"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2e78a9198e7ddfe0f720e40a6c1100a742584da5e093dc535ac0dd0dbcaa2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/widgets/prompt/diy/panels/dependency_config_panel.dart:506-517 | lib/presentation/widgets/prompt/diy/panels/visibility_rule_panel.dart:165-176 \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/presentation/widgets/prompt/diy/panels/dependency_config_panel.dart:506\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/presentation/widgets/prompt/diy/panels/dependency_config_panel.dart"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9f7889b1f7b79b63046241164c7d53cbc7436182c92c13c70d22a36a283b49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/widgets/prompt/fixed_tag_edit_dialog.dart:158-169 | lib/presentation/widgets/prompt/fixed_tag_library_picker_dialog.dart:139-150 \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/presentation/widgets/prompt/fixed_tag_edit_dialog.dart:158\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/presentation/widgets/prompt/fixed_tag_edit_dialog.dart"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"873197d60a0e59a97d5ff88221cfe9b48a6f7bc87ae4605224ae4e3f2fbb5313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/widgets/prompt/global_settings_dialog.dart:649-660 | lib/presentation/widgets/prompt/regex_rules_dialog.dart:596-607 \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/presentation/widgets/prompt/global_settings_dialog.dart:649\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/presentation/widgets/prompt/global_settings_dialog.dart"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"d706f305256045832c4e916885d4feca1f332cf69b1366e68c9f9c9c6594c7c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): lib/presentation/widgets/prompt/random_manager/add_tag_group_dialog.dart:388-399 | lib/presentation/widgets/prompt/random_manager/add_tag_group_dialog.dart:423-433 \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/presentation/widgets/prompt/random_manager/add_tag_group_dialog.dart:388\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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/presentation/widgets/prompt/random_manager/add_tag_group_dialog.dart"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5dc0f7506416cd173d2cb5e8dc45b11f22c432aaef13eb8a1f8984ba2d9c49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): lib/presentation/widgets/image_editor/tools/blur_tool.dart:161-171 | lib/presentation/widgets/image_editor/tools/clone_stamp_tool.dart:311-321 | lib/presentation/widgets/image_editor/tools/fill_tool.dart:121-131 | lib/presentation/widgets/image_editor/tools/magic_wand_tool.dart:81-91 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/image_editor/tools/blur_tool.dart:161\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/image_editor/tools/blur_tool.dart"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe21b594599e398dcc3cf72617424e65b26e403c9e76a337b98097efdeef9f69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:757-767 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:784-794 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:835-847 \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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:757\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2103de9e67233e7182d48ed1840881cafe3b04a643dad7a7349f8322a620d27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/core/agent/harness/session/jsonl/session_jsonl_storage.dart:308-318 | lib/core/agent/harness/session/jsonl/session_jsonl_storage.dart:323-333 \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/core/agent/harness/session/jsonl/session_jsonl_storage.dart:308\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/core/agent/harness/session/jsonl/session_jsonl_storage.dart"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"89487b9f63239c9e84d20953b3563e67d158f390e00ab61ee0c6057f08494e85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/core/utils/inpaint_outpaint_utils.dart:1016-1026 | lib/core/utils/inpaint_outpaint_utils.dart:1095-1105 \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/core/utils/inpaint_outpaint_utils.dart:1016\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/core/utils/inpaint_outpaint_utils.dart"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"2255edc4690fd9baf0c0716b58a19a37480866be6be710a97d820532c124e941"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:254-274 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:875-895 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060request\u0060 to \u0060GallerySearchRequest\u0060 in one and \u0060GalleryRandomSearchRequest\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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4c3764edd9805498f9c7d3993d0f81b770b289f4987ba495518b02dfb45acf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/data/services/official_random_prompt_generator.dart:160-170 | lib/data/services/official_random_prompt_generator.dart:389-399 \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/data/services/official_random_prompt_generator.dart:160\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/data/services/official_random_prompt_generator.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d16993f119002814ab9e3eacb86259fc71053fcce78c255e2f86f7df66e0aaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/presentation/prompt_assistant/providers/prompt_assistant_history_provider.dart:94-104 | lib/presentation/prompt_assistant/providers/prompt_assistant_history_provider.dart:127-137 \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/presentation/prompt_assistant/providers/prompt_assistant_history_provider.dart:94\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/presentation/prompt_assistant/providers/prompt_assistant_history_provider.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"054d6b6ac4ef1e66edc15dae5e4ccba1c4ee1b9e784cfeb439089786a915fe3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): lib/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart:113-123 | lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart:145-153 \u2014 before extracting anything, compare \u0060lib/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart\u0060 and \u0060lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart:113\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/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d734cf54584bf281a96633fa16fae29ff98372fac5b3998f1917c67b8274de36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/presentation/screens/auth/login_screen.dart:1071-1081 | lib/presentation/screens/auth/login_screen.dart:1149-1159 \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/presentation/screens/auth/login_screen.dart"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"017f3488fee12a1bbab7aca3101de22dbe8e885d8c3067f5786cf3e0b24f14a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/presentation/screens/generation/mobile_generation_chrome.dart:311-321 | lib/presentation/screens/generation/widgets/generation_controls/generate_button.dart:112-122 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/mobile_generation_chrome.dart"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"413c653b3048feb9bc2acc281fa971f1ef42a7f8168fc5a2792c13982e88d23c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/presentation/screens/generation/widgets/precise_reference_panel.dart:643-653 | lib/presentation/screens/tag_library_page/widgets/send_to_home_dialog.dart:581-591 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/generation/widgets/precise_reference_panel.dart:643\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/widgets/precise_reference_panel.dart"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb4a244cb14602dc56206f44d1bab6e89bc65ca92baa65dab14e00ab88a061a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/presentation/screens/generation/widgets/sidebar_link_painter.dart:36-46 | lib/presentation/screens/generation/widgets/sidebar_link_painter.dart:62-72 \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/presentation/screens/generation/widgets/sidebar_link_painter.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"93abbbb70dbce1081151814e5dfe4fcaf3abd5930eb2841ba7e2b8e05d3fc590"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/presentation/screens/mosaic/mosaic_editor_actions_bar.dart:34-44 | lib/presentation/screens/watermark/watermark_editor_screen.dart:763-773 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/mosaic/mosaic_editor_actions_bar.dart:34\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/mosaic/mosaic_editor_actions_bar.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af8e78b5cd683d3530dfde7cb491c23e8b8954774e5a73e768db2b3f6e3627f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_feature.dart:680-690 | lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_feature.dart:783-791 \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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_feature.dart:680\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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_feature.dart"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"0550b00c82ff181299be47bf20539a0e8625b50a7983b6fc313f278e2e3dd5f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_search.dart:58-68 | lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_search.dart:143-153 \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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_search.dart:58\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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_search.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af61c911f2993c28afd01d878eb7cebc6356d29c7f9116f88d5056cb274a512"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/presentation/screens/tag_library_page/widgets/entry_add_dialog.dart:455-465 | lib/presentation/widgets/prompt/fixed_tag_edit_dialog.dart:286-296 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/tag_library_page/widgets/entry_add_dialog.dart:455\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/presentation/screens/tag_library_page/widgets/entry_add_dialog.dart"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"495fbb23b2662e69d1ce9be4d1fedfceefecc7461072dd43209eb56742966755"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/presentation/themes/modules/color/palettes/minimal_glass_palette.dart:23-33 | lib/presentation/themes/modules/color/palettes/pro_ai_palette.dart:23-33 \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/presentation/themes/modules/color/palettes/minimal_glass_palette.dart:23\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/presentation/themes/modules/color/palettes/pro_ai_palette.dart:35\u0060 calls \u0060Color\u0060 and \u0060lib/presentation/themes/modules/color/palettes/minimal_glass_palette.dart:34\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/presentation/themes/modules/color/palettes/minimal_glass_palette.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7647b8761c69e7f9f2a48c3ecf16cc1092df0885bf1534482148802c16061afd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/presentation/widgets/common/app_toast.dart:469-479 | lib/presentation/widgets/common/app_toast.dart:732-742 \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/presentation/widgets/common/app_toast.dart"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7400a4b1d735292a1bdcb001081657c51ad754d630d15320975d81fbbc4ec6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/presentation/widgets/common/image_detail/components/detail_metadata_panel.dart:875-885 | lib/presentation/widgets/online_gallery/ai_tag_generation_info_section.dart:185-195 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/common/image_detail/components/detail_metadata_panel.dart:875\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/presentation/widgets/common/image_detail/components/detail_metadata_panel.dart"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b7ad04c83b56936d46952ce96227c8445c50a2664eb8462934ef9cbeb02da0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/presentation/widgets/common/themed_input.dart:267-277 | lib/presentation/widgets/prompt/tag_mode_prompt_field.dart:106-116 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/common/themed_input.dart:267\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/presentation/widgets/common/themed_input.dart"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"faadc84c19c2bddcb4adb68f14feae5fd2d3ffeda7ff1e8cc6cfe2aed49c51d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/presentation/widgets/image_editor/tools/brush_tool.dart:472-482 | lib/presentation/widgets/image_editor/tools/eraser_tool.dart:203-213 \u2014 before extracting anything, compare \u0060lib/presentation/widgets/image_editor/tools/brush_tool.dart\u0060 and \u0060lib/presentation/widgets/image_editor/tools/eraser_tool.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/image_editor/tools/brush_tool.dart:472\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/presentation/widgets/image_editor/tools/brush_tool.dart"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"d962ccd2445e07634392a3a0286afa74997f03a8c53817b1e0552092a322eaca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/widgets/navigation/nav_rail_account_button.dart:102-113 | lib/presentation/widgets/navigation/nav_rail_items.dart:356-367 \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/presentation/widgets/navigation/nav_rail_account_button.dart:102\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/presentation/widgets/navigation/nav_rail_account_button.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"de61a4256a07ac655c5ae455ec2194c437ff35c673fe86b08f4d5709762efac3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/presentation/widgets/online_gallery/gallery_generation_transfer_dialog.dart:147-157 | lib/presentation/widgets/online_gallery/gallery_prompt_copy_dialog.dart:94-104 \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/presentation/widgets/online_gallery/gallery_generation_transfer_dialog.dart:147\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/presentation/widgets/online_gallery/gallery_generation_transfer_dialog.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"650365664bfb6f4d41605a281ae3a0da75c54ab8f78df10ab3a9d49e44640d4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/presentation/widgets/prompt/regex_rules_dialog.dart:82-92 | lib/presentation/widgets/prompt/regex_rules_dialog.dart:592-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/presentation/widgets/prompt/regex_rules_dialog.dart:82\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/presentation/widgets/prompt/regex_rules_dialog.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d04eaa95cdfe353c90db4d0039d4be52f030cd925b002281f84f246f765a88e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7): lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:93-102 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:176-185 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:472-481 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:542-551 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:599-608 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:718-727 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:845-854 \u2014 all 7 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:717\u0060 calls \u0060usableItems\u0060 and \u0060lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:92\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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cdc9fb59a275b88a24c274f54d7702e2fdc32228a46801519f7a9c3c7e389a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): lib/core/database/datasources/gallery_favorite_tag_repository.dart:150-159 | lib/core/database/datasources/gallery_favorite_tag_repository.dart:289-298 | lib/core/database/datasources/gallery_image_repository.dart:225-234 | lib/core/database/datasources/gallery_metadata_repository.dart:302-311 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 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/core/database/datasources/gallery_favorite_tag_repository.dart:150\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/core/database/datasources/gallery_favorite_tag_repository.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c13c100ed485e8b674d88b78b999850a9eee5acc8a3801f3fad13dc9739276"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): lib/core/network/dio_client.dart:245-254 | lib/core/storage/secure_storage_service.dart:569-578 | lib/data/datasources/remote/nai_auth_api_service.dart:272-281 \u2014 before extracting anything, compare \u0060lib/core/network/dio_client.dart\u0060 and \u0060lib/data/datasources/remote/nai_auth_api_service.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/dio_client.dart"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e2ed034efc70b2af1845a87b035b455ecce5d76fc97958514abfd3b27c2d1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/core/comfyui/comfyui_websocket_service.dart:111-120 | lib/core/comfyui/comfyui_websocket_service.dart:168-177 \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/core/comfyui/comfyui_websocket_service.dart:111\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/comfyui/comfyui_websocket_service.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3370b01deea4e45cd87e2726d34808b213585264a011f82eaaea55a8d339f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/core/database/datasources/gallery_album_repository.dart:297-306 | lib/data/services/gallery/gallery_album_import_coordinator.dart:197-206 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/core/database/datasources/gallery_album_repository.dart:297\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/datasources/gallery_album_repository.dart"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fbb167194f86b2e785718dc532c00da7f610012c1ba629d3cf1d11eb2011d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): lib/core/database/datasources/gallery_album_repository.dart:850-858 | lib/core/database/datasources/gallery_album_repository.dart:860-869 \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/core/database/datasources/gallery_album_repository.dart:860\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/datasources/gallery_album_repository.dart"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"25dd0319847d604fe8fb11d39b440063245cf93b139b8df51bded07521ca40cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/core/database/datasources/gallery_records.dart:127-136 | lib/domain/entities/gallery_image_entity.dart:147-156 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/datasources/gallery_records.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1da159223c31db4d96abd74df1786d9af611b3a9ebbfda811ac3e099ece029"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/core/services/pixel_snap/internal/spread_kernel.dart:57-66 | lib/core/services/pixel_snap/internal/spread_kernel.dart:70-79 \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/core/services/pixel_snap/internal/spread_kernel.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f28772433a4ff57dc66fb32e38f8079fee03d5ff4ac0be7fd3bfa3c19444e76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/core/utils/pica_lanczos_resizer.dart:347-356 | lib/core/utils/pica_lanczos_resizer.dart:443-452 \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/core/utils/pica_lanczos_resizer.dart:347\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/core/utils/pica_lanczos_resizer.dart"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e60dc7ffe35fa3021762cfd8a1855ca01f00f323407aedbedb51454574085a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/data/services/efficient_vit_sam_service.dart:211-220 | lib/data/services/efficient_vit_sam_service.dart:255-265 \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/data/services/efficient_vit_sam_service.dart:211\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/data/services/efficient_vit_sam_service.dart"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4ecddfff096503622efa416d242b9262bfa265db35298bbf2722274131b563"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/data/services/official_random_prompt_generator.dart:214-223 | lib/data/services/official_random_prompt_generator.dart:447-456 \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/data/services/official_random_prompt_generator.dart:214\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/data/services/official_random_prompt_generator.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd000d2b9c266d1c7efc36958f06f7d2315ca69e12d86bf2af06c4e9c47176c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/data/services/precise_ref_library_archive_service.dart:298-307 | lib/data/services/tag_library_io_service.dart:463-472 \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/data/services/precise_ref_library_archive_service.dart:298\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/data/services/precise_ref_library_archive_service.dart"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf0b53f7e8e997c1f4b1d2353960dfec0a8fc2e575ddfc1c616b184312efa79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): lib/data/services/vibe_folder_sync.dart:164-170 | lib/data/services/vibe_import_service.dart:787-796 \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/data/services/vibe_import_service.dart:787\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/data/services/vibe_folder_sync.dart"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad41338b7bb9993dee367f048f8b70831284d622629abf67f91162d4b3a8ef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/presentation/screens/auth/login_screen.dart:1121-1130 | lib/presentation/screens/auth/login_screen.dart:1196-1205 \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/presentation/screens/auth/login_screen.dart:1121\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/presentation/screens/auth/login_screen.dart"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbda1d47192e238e34588dfc14a77194d3bd3a556a4483b0acdceb6972556f65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/presentation/screens/cloud_sync/cloud_sync_content_selection_dialog.dart:251-260 | lib/presentation/screens/cloud_sync/cloud_sync_skill_selection_dialog.dart:187-196 \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/presentation/screens/cloud_sync/cloud_sync_content_selection_dialog.dart:251\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/presentation/screens/cloud_sync/cloud_sync_content_selection_dialog.dart"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c56e9ddd6a23c5040d153781ef010f2d58cc0d155a5cfd21de1c5dedc2389a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/presentation/screens/generation/widgets/img2img_panel.dart:74-83 | lib/presentation/screens/generation/widgets/unified_reference_panel.dart:361-370 \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/presentation/screens/generation/widgets/img2img_panel.dart:74\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/presentation/screens/generation/widgets/img2img_panel.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"587eb2080d6795b9f574e451c6d21e3e5896802e957e430cdc9f2705068d1bb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_search.dart:294-302 | lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_search.dart:462-471 \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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_search.dart:294\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. 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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_search.dart"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d97ded4e784fcbce76f43a9fd0d41de8fde110521138073128cbfa9f16dc54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/presentation/screens/precise_ref_library/widgets/precise_ref_hover_preview.dart:200-209 | lib/presentation/screens/vibe_library/widgets/vibe_hover_preview.dart:244-254 \u2014 before extracting anything, compare \u0060lib/presentation/screens/precise_ref_library/widgets/precise_ref_hover_preview.dart\u0060 and \u0060lib/presentation/screens/vibe_library/widgets/vibe_hover_preview.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/precise_ref_library/widgets/precise_ref_hover_preview.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. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/precise_ref_library/widgets/precise_ref_hover_preview.dart"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a1f9432251fdf5054941e156b28a3e72d79c9921f1ad2e8ad178e8d0ad24b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart:267-276 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:636-645 \u2014 before extracting anything, compare \u0060lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart\u0060 and \u0060lib/presentation/widgets/gallery/gallery_category_tree_view.dart\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart:267\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060onTap\u0060 to \u0060(\u0060 in one and \u0060() =\u003E Future.delayed(const Duration(milliseconds: 100)\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/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"2556ec53d8d6eb8b378a86971f8a73153048aea491bfdc3132f09b9d9b30fa12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/presentation/widgets/character/inline_character_editor.dart:117-126 | lib/presentation/widgets/prompt/tag_mode_prompt_field.dart:108-117 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \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/presentation/widgets/character/inline_character_editor.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bbaae74167e270ce50b01d986a7f3f4f658604e3c401688bf1ce98ada67cc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/presentation/widgets/gallery/gallery_album_tree_view.dart:88-97 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:99-108 \u2014 before extracting anything, compare \u0060lib/presentation/widgets/gallery/gallery_album_tree_view.dart\u0060 and \u0060lib/presentation/widgets/gallery/gallery_category_tree_view.dart\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 97 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/presentation/widgets/gallery/gallery_album_tree_view.dart:88\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/presentation/widgets/gallery/gallery_album_tree_view.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ced6388a6b30f59a18db5ecf31dc7ef2d7f2e919d26262db0348fa9dfa7cab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/presentation/widgets/prompt/diy/panels/post_process_rule_panel.dart:132-141 | lib/presentation/widgets/prompt/diy/panels/visibility_rule_panel.dart:111-120 \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/presentation/widgets/prompt/diy/panels/post_process_rule_panel.dart:132\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/presentation/widgets/prompt/diy/panels/post_process_rule_panel.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf58587d48094db7e230849d3cfc656668bf2dd409f2800f2a58a7e4e669a025"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/presentation/widgets/prompt/quality_tags_selector.dart:70-79 | lib/presentation/widgets/prompt/uc_preset_selector.dart:79-88 \u2014 before extracting anything, compare \u0060lib/presentation/widgets/prompt/quality_tags_selector.dart\u0060 and \u0060lib/presentation/widgets/prompt/uc_preset_selector.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 76 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/presentation/widgets/prompt/quality_tags_selector.dart:70\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/presentation/widgets/prompt/quality_tags_selector.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f417432d5543d4e7444c7aa62aaa73f83824185f53fde64aee271c6716caa0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): lib/core/utils/novelai_vibe_codec.dart:290-298 | lib/core/watermark/watermark_logo_service.dart:157-165 | lib/data/services/precise_ref_portable_importer.dart:19-27 | lib/data/services/precise_ref_portable_importer.dart:36-44 | lib/presentation/prompt_assistant/services/prompt_assistant_service.dart:691-699 \u2014 before extracting anything, compare \u0060lib/core/watermark/watermark_logo_service.dart\u0060 and \u0060lib/data/services/precise_ref_portable_importer.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/core/utils/novelai_vibe_codec.dart:290\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/core/utils/novelai_vibe_codec.dart"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"848afee90a93d4ce454e74db110961cebbf30ff88fd5280f8ab08327cf70deff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): lib/presentation/prompt_assistant/widgets/prompt_assistant_custom_dialog.dart:231-240 | lib/presentation/screens/settings/sections/agent/agent_profile_actions.dart:144-152 | lib/presentation/widgets/metadata/metadata_import_dialog.dart:182-190 | lib/presentation/widgets/prompt/comfyui_import_dialog.dart:158-166 \u2014 before extracting anything, compare \u0060lib/presentation/screens/settings/sections/agent/agent_profile_actions.dart\u0060 and \u0060lib/presentation/widgets/metadata/metadata_import_dialog.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/prompt_assistant/widgets/prompt_assistant_custom_dialog.dart:231\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/presentation/screens/settings/sections/agent/agent_profile_actions.dart:141\u0060 calls \u0060Key\u0060 and \u0060lib/presentation/widgets/prompt/comfyui_import_dialog.dart:156\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/presentation/prompt_assistant/widgets/prompt_assistant_custom_dialog.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fb7cc8bd4eb94820f110e56a78553caa38dbc1081635ae58b81932d923246c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): lib/core/utils/inpaint_outpaint_utils.dart:1017-1025 | lib/core/utils/inpaint_outpaint_utils.dart:1096-1104 | lib/core/utils/inpaint_outpaint_utils.dart:1131-1138 \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/core/utils/inpaint_outpaint_utils.dart:1017\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/core/utils/inpaint_outpaint_utils.dart"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"c047aeee3fe33cdaf3b7e03a5f2fef615f624d955137d9b227ddea688daf7b80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): lib/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart:252-260 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:123-131 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:204-212 \u2014 there are 3 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 3 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/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart:252\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/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd881c44a3a41118de3270b54c35166eef1b6289f6cd2441df12f07b5d24e5b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/core/autocomplete/tag_catalog_repository.dart:165-173 | lib/core/autocomplete/tag_catalog_repository.dart:209-217 \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/core/autocomplete/tag_catalog_repository.dart:165\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/core/autocomplete/tag_catalog_repository.dart"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9531bb42e790d22501c3c65836f525b30ff31096963581c317aad8d9d3ca0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/core/storage/secure_storage_service.dart:359-368 | lib/core/storage/secure_storage_service.dart:400-408 \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/core/storage/secure_storage_service.dart:359\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/storage/secure_storage_service.dart"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9f921b3c8d9cbcbed673aa881c9ab80da5f57223dd15ad92e51e7edb7b6630"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): lib/core/utils/inpaint_mask/inpaint_mask_operations.dart:1338-1346 | lib/core/utils/inpaint_mask/inpaint_mask_operations.dart:1355-1362 \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/core/utils/inpaint_mask/inpaint_mask_operations.dart:1338\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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6add032a3658d8fc28397a17ce496d5cbaea28aaacb71bd9558353461d1ac9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/core/utils/inpaint_mask/inpaint_mask_operations.dart:1639-1648 | lib/core/utils/inpaint_mask/inpaint_mask_operations.dart:1675-1684 \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/core/utils/inpaint_mask/inpaint_mask_operations.dart:1639\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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7519fd4bd74ae487aa7458e2f2d39ff7076a43a1d66f6df07882bbacf0c249"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/core/utils/pica_lanczos_resizer.dart:395-404 | lib/core/utils/pica_lanczos_resizer.dart:498-507 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/core/utils/pica_lanczos_resizer.dart:395\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/core/utils/pica_lanczos_resizer.dart"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee07559acae5aa336cd37e058b0576146900d41b1f93456769f25fc4940732e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:186-201 | lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:440-455 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060request\u0060 to \u0060GallerySearchRequest\u0060 in one and \u0060GalleryRandomSearchRequest\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/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb0f198b5fabd60ff4ca770fe3c7290fd9d827f39b7c9e13350207b7f0b75d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/data/services/official_random_prompt_generator.dart:376-384 | lib/data/services/official_random_prompt_generator.dart:684-692 \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/data/services/official_random_prompt_generator.dart:376\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. 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/data/services/official_random_prompt_generator.dart"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"5287f6796777baa82971bf0e0cee96e4ba3f4154d273eeb31b2c83c4ede9e558"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/presentation/prompt_assistant/providers/prompt_assistant_config_provider.dart:118-126 | lib/presentation/prompt_assistant/providers/prompt_assistant_config_provider.dart:332-340 \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/presentation/prompt_assistant/providers/prompt_assistant_config_provider.dart:118\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/presentation/prompt_assistant/providers/prompt_assistant_config_provider.dart"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"427bc54612f21d9b34e765ff3ccde8a7d015b0a61cac1e2a3c1d7b6fccf1eb6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/presentation/prompt_assistant/widgets/prompt_assistant_custom_dialog.dart:231-239 | lib/presentation/widgets/prompt/diy/dialogs/preset_import_dialog.dart:319-327 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/prompt_assistant/widgets/prompt_assistant_custom_dialog.dart:231\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/presentation/prompt_assistant/widgets/prompt_assistant_custom_dialog.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa9636f568a1e1f20cfa2411ab5f84bee23b3296742334971d15be93dcc0ed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/presentation/providers/online_gallery_blacklist_provider.dart:470-478 | lib/presentation/providers/online_gallery_blacklist_provider.dart:768-776 \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/presentation/providers/online_gallery_blacklist_provider.dart:470\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. 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/presentation/providers/online_gallery_blacklist_provider.dart"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47a93876aba9b0ce2df4f1755e766aae21e3e433cf1eff0e7fc33ff3a4df698"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/presentation/screens/generation/mobile_layout.dart:90-98 | lib/presentation/screens/generation/widgets/generation_controls/generation_controls.dart:38-47 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/generation/mobile_layout.dart:90\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/presentation/screens/generation/mobile_layout.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f68e2df16ec3475ce33ed1f28e4262e9709dfef6ab2f18d9b2a0583e5551144"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/presentation/screens/mosaic/mosaic_editor_launcher.dart:77-85 | lib/presentation/screens/watermark/watermark_editor_launcher.dart:75-83 \u2014 \u0060lib/presentation/screens/mosaic/mosaic_editor_launcher.dart\u0060 and \u0060lib/presentation/screens/watermark/watermark_editor_launcher.dart\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 47 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/mosaic/mosaic_editor_launcher.dart:77\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/presentation/screens/mosaic/mosaic_editor_launcher.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c0c2666295d298ff97f5126c7e1407152cdc6ce7986b5c227e87a89306751d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/presentation/screens/online_gallery/online_gallery_detail_launcher.dart:367-378 | lib/presentation/screens/online_gallery/online_gallery_detail_launcher.dart:676-684 \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/presentation/screens/online_gallery/online_gallery_detail_launcher.dart:367\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/presentation/screens/online_gallery/online_gallery_detail_launcher.dart"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"544eb3b3d326eee11410b9346aaba01c33559fbf70eeb16f904d8a2d1d93e672"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/presentation/screens/precise_ref_library/precise_ref_library_screen.dart:1199-1207 | lib/presentation/screens/vibe_library/vibe_library_workspace.dart:463-471 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/precise_ref_library/precise_ref_library_screen.dart:1199\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/presentation/screens/precise_ref_library/precise_ref_library_screen.dart"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"06acc0b592fca615a94184cd3c3959d4b30a1427e7a3e30255df9b167aa84185"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/presentation/screens/settings/sections/agent/agent_profile_actions.dart:63-71 | lib/presentation/screens/settings/sections/agent/skill_management_panel.dart:272-280 \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/presentation/screens/settings/sections/agent/agent_profile_actions.dart:63\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/settings/sections/agent/agent_profile_actions.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fd607e9c596f1640c38c7127b81150dff380463b6da0a56f0e7e3dd5f683d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/presentation/screens/settings/widgets/cache_statistics_tile.dart:322-330 | lib/presentation/widgets/drop/prompt_library_entry_dialog.dart:670-678 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/settings/widgets/cache_statistics_tile.dart:322\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/presentation/screens/settings/widgets/cache_statistics_tile.dart:320\u0060 calls \u0060of\u0060 and \u0060lib/presentation/widgets/drop/prompt_library_entry_dialog.dart:669\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/presentation/screens/settings/widgets/cache_statistics_tile.dart"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"0104e8af13173dfd957dfb34ea8fe490af03b9d56d2a89cc1b7b14ff6b4c6fd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart:72-80 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:428-435 \u2014 before extracting anything, compare \u0060lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart\u0060 and \u0060lib/presentation/widgets/gallery/gallery_category_tree_view.dart\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart:72\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/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c722a816cbaa461bad6713406759ebe07edb91f768806db9ba462df7cf61c1dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): lib/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart:296-303 | lib/presentation/widgets/prompt/uc_preset_selector.dart:360-368 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/prompt/uc_preset_selector.dart:360\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/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a75412032cddf3484c0afea8c6ff117ec0a440d1b971cd758b38b094cdd515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): lib/presentation/screens/vibe_library/widgets/vibe_export_dialog.dart:233-241 | lib/presentation/screens/vibe_library/widgets/vibe_export_dialog_advanced.dart:196-203 \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/presentation/screens/vibe_library/widgets/vibe_export_dialog.dart:233\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/presentation/screens/vibe_library/widgets/vibe_export_dialog.dart"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"af851710cd28b85ef0627e67510bdbb54fd38dec6ddf3fc78b849f84d9c1f10c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/presentation/widgets/online_gallery/gallery_detail_overview_card.dart:201-209 | lib/presentation/widgets/online_gallery/gallery_detail_text_section.dart:25-33 \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/presentation/widgets/online_gallery/gallery_detail_overview_card.dart:201\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/online_gallery/gallery_detail_overview_card.dart"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2832d2eca2f79fb5a0aa99af8c1ec50a47bf517674f84ca7615ab4cf4470d3df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): lib/core/utils/inpaint_mask/inpaint_mask_operations.dart:1339-1346 | lib/core/utils/inpaint_mask/inpaint_mask_operations.dart:1356-1362 | lib/core/utils/inpaint_mask/inpaint_mask_operations.dart:1609-1616 \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/core/utils/inpaint_mask/inpaint_mask_operations.dart:1339\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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9ba8cdb9df4765f19cc25ede1df75ea395bfbba3ebd45265444a4aa7913aa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 3): lib/presentation/screens/statistics/widgets/cards/chart_card.dart:102-109 | lib/presentation/screens/statistics/widgets/charts/polar_activity_chart.dart:328-333 | lib/presentation/screens/statistics/widgets/charts/weekday_bar_chart.dart:379-384 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/statistics/widgets/cards/chart_card.dart:102\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/presentation/screens/statistics/widgets/cards/chart_card.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db81bd8d9d3c1bdd2583260e130e81fd35d3559f37f759f4b95bc8c34a060e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart:377-385 | lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart:84-91 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:436-443 \u2014 before extracting anything, compare \u0060lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart\u0060 and \u0060lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart:377\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/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart:93\u0060 calls \u0060withValues\u0060 and \u0060lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart:386\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/presentation/screens/tag_library_page/widgets/category_tree_view.dart"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad16687a78ce5c9a8621a69f4ef641f92d1aa069e3238b9f8b7f111300e248d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): lib/core/agent/harness/session/jsonl/session_jsonl_codec.dart:247-253 | lib/core/agent/harness/session/jsonl/session_jsonl_codec.dart:265-272 \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/core/agent/harness/session/jsonl/session_jsonl_codec.dart:247\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/core/agent/harness/session/jsonl/session_jsonl_codec.dart"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ef53bed5429e18f171a9acfc62444f0ac54e139f1ac2595d88f3cee2a20e6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/core/agent/skill_archive_service.dart:212-219 | lib/data/services/local_onnx_model_service.dart:277-284 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/data/services/local_onnx_model_service.dart:285\u0060 calls \u0060File\u0060, \u0060join\u0060 and \u0060lib/core/agent/skill_archive_service.dart:220\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/core/agent/skill_archive_service.dart"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8d3c5c2ab7e0dc70304c286db34c6c47985b10fe4acbeaf2d417fc8aba1879"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/core/autocomplete/completion_ranker.dart:70-77 | lib/core/autocomplete/cooccurrence_completion_source.dart:79-86 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/autocomplete/completion_ranker.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21ca41e24ba4ef2c74d929fa9204bf484a2b2ae463d4363926d245ad0c06d56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/data/cloud_sync/app_cloud_sync_data_source.dart:83-90 | lib/data/cloud_sync/app_cloud_sync_data_source.dart:181-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/data/cloud_sync/app_cloud_sync_data_source.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/data/cloud_sync/app_cloud_sync_data_source.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58b87cb1ba463f867a2646eba57dcb2ff16314130b1a43efd04b98fc4157a16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/data/cloud_sync/precise_ref_cloud_sync_adapter.dart:51-58 | lib/data/services/precise_ref_library_archive_service.dart:68-75 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/cloud_sync/precise_ref_cloud_sync_adapter.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fed5d8bec307c6ba34f6dfc4f7ddbabdf28e6660916a6293312cf95fcdc3977"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:276-283 | lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:203-210 \u2014 before extracting anything, compare \u0060lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart\u0060 and \u0060lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:276\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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"542e81591bcb9ae74c703699bf884846a44d4ac7a8b8ea5ae45e1354dab669b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/data/services/efficient_vit_sam_service.dart:317-324 | lib/data/services/local_onnx_tagger_service.dart:347-354 \u2014 before extracting anything, compare \u0060lib/data/services/efficient_vit_sam_service.dart\u0060 and \u0060lib/data/services/local_onnx_tagger_service.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 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/data/services/efficient_vit_sam_service.dart:317\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/data/services/local_onnx_tagger_service.dart:356\u0060 calls \u0060resolveIntraOpThreadCount\u0060 and \u0060lib/data/services/efficient_vit_sam_service.dart:325\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/data/services/efficient_vit_sam_service.dart"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"662d48f374d7322468ec5cd6f8c5c0bfa7d294223c1ddf259fc349a30d2dc5ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/data/services/online_gallery/quick_tag_cloud_parser.dart:46-53 | lib/data/services/online_gallery/quick_tag_cloud_parser.dart:84-91 \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/data/services/online_gallery/quick_tag_cloud_parser.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"df12438f22c3515a7210af88034a3fdff13651cddac06a7d2796fbfa27025b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart:133-140 | lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart:158-165 \u2014 before extracting anything, compare \u0060lib/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart\u0060 and \u0060lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart:133\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/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c30425989f23a3524ad2ba7b7cc486d108b6e039d6b3b65fa15e4809a2d753e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart:159-166 | lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart:742-747 \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/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart:159\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/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3173ba3760e0c715761ac41c05ef979a96022d9a848a8f809339276f221b5d0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/presentation/screens/mosaic/mosaic_editor_screen.dart:455-462 | lib/presentation/screens/watermark/watermark_editor_screen.dart:559-566 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/mosaic/mosaic_editor_screen.dart:455\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/mosaic/mosaic_editor_screen.dart"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e8d22b938b08e56b5384a28c75d3ca2add19044c20479a6f2069fd4f6a951e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/presentation/screens/precise_ref_library/precise_ref_library_screen.dart:507-514 | lib/presentation/widgets/common/update_check_dialog.dart:823-830 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/precise_ref_library/precise_ref_library_screen.dart:507\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/presentation/screens/precise_ref_library/precise_ref_library_screen.dart"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"59783af5625309c24019dd43b847a06ddd02097d0b8ac1636fcdd833e7eb1cbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/presentation/screens/statistics/widgets/charts/radar_chart.dart:231-238 | lib/presentation/screens/statistics/widgets/charts/radar_chart.dart:277-284 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/presentation/screens/statistics/widgets/charts/radar_chart.dart:287\u0060 calls \u0060add\u0060, \u0060Offset\u0060 and \u0060lib/presentation/screens/statistics/widgets/charts/radar_chart.dart:239\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/presentation/screens/statistics/widgets/charts/radar_chart.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"e313fdba1fb4c6fb8874637d556655b79821291fbab2184e35bab16dfee9d6d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/presentation/widgets/common/image_detail/components/detail_metadata_panel.dart:1053-1060 | lib/presentation/widgets/prompt/random_manager/tag_group_diy_section.dart:28-35 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/widgets/common/image_detail/components/detail_metadata_panel.dart:1053\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/presentation/widgets/common/image_detail/components/detail_metadata_panel.dart:1062\u0060 calls \u0060GestureDetector\u0060 and \u0060lib/presentation/widgets/prompt/random_manager/tag_group_diy_section.dart:36\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/presentation/widgets/common/image_detail/components/detail_metadata_panel.dart"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"82dc8315bc20eee83a4fbcadacc660cb77b8c8010c01b227a768e8870540dfd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): lib/presentation/screens/derivatives/derivative_editor_launcher.dart:140-146 | lib/presentation/screens/precise_ref_library/precise_ref_library_screen.dart:507-514 | lib/presentation/widgets/common/update_check_dialog.dart:823-831 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/derivatives/derivative_editor_launcher.dart:140\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/presentation/screens/derivatives/derivative_editor_launcher.dart"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"853d33125c41740edaaad966ebdbd5585d09083a9eb2e41c17ae2a1c47462b89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/core/agent/harness/session/jsonl/session_jsonl_codec.dart:84-90 | lib/core/agent/harness/session/jsonl/session_jsonl_codec.dart:193-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/harness/session/jsonl/session_jsonl_codec.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb5dcbba2c7b3dd5ebbc1997ca7dfc25a608278cbe170d600a3ec6287e70f5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/core/database/datasources/gallery_favorite_tag_repository.dart:190-196 | lib/core/database/datasources/gallery_favorite_tag_repository.dart:228-234 \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/core/database/datasources/gallery_favorite_tag_repository.dart:190\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/datasources/gallery_favorite_tag_repository.dart"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b284fb31f3ea78cb4b0b44259e4f8260a083d6681a5b3da20d3cbca9394922b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/core/utils/inpaint_outpaint_utils.dart:452-458 | lib/core/utils/inpaint_outpaint_utils.dart:762-768 \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/core/utils/inpaint_outpaint_utils.dart"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e35bc2080feb28b201a27fbc1dfba965159b72f32e573a9616bac3c24429e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/data/repositories/online_gallery_local_favorites_repository.dart:366-372 | lib/data/services/online_gallery/quick_tag_cloud_user_service.dart:517-525 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/repositories/online_gallery_local_favorites_repository.dart"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80b00226fc4044712ba70caa08bfb8bec15ee76923b49a408cd28cffa9418f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/data/services/efficient_vit_sam_service.dart:329-335 | lib/data/services/local_onnx_tagger_service.dart:363-370 \u2014 before extracting anything, compare \u0060lib/data/services/efficient_vit_sam_service.dart\u0060 and \u0060lib/data/services/local_onnx_tagger_service.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 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/data/services/efficient_vit_sam_service.dart:329\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/data/services/efficient_vit_sam_service.dart"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a41c626166b1d02a1a4f2db21cb7e200fd894190efb95988496fb9999aca37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/data/services/online_gallery/online_gallery_blacklist_filter_service.dart:37-43 | lib/presentation/screens/online_gallery/online_gallery_selection_actions.dart:190-197 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/data/services/online_gallery/online_gallery_blacklist_filter_service.dart:37\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/data/services/online_gallery/online_gallery_blacklist_filter_service.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86e1a45bc23cdf4d3c486451aaf2a5463a28a9e10c153cedff4faaaca2117b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/presentation/agent_chat/services/local_gallery_toolbox.dart:130-137 | lib/presentation/agent_chat/services/local_gallery_toolbox.dart:178-184 \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/presentation/agent_chat/services/local_gallery_toolbox.dart:130\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/local_gallery_toolbox.dart"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0501a3991885d6d7a7da2a636ce52a032e0c5f76dce4839d1b627ba20ad5eb8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart:552-558 | lib/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart:407-413 \u2014 before extracting anything, compare \u0060lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart\u0060 and \u0060lib/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 40 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/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31ff22f3033aaf2a3ef7239cf25c167bfceabf27b8ced09079ecdcfd522db71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/presentation/providers/online_gallery_detail_favorite_service.dart:81-87 | lib/presentation/providers/online_gallery_detail_favorite_service.dart:106-112 \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/presentation/providers/online_gallery_detail_favorite_service.dart:81\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/online_gallery_detail_favorite_service.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"99313e712eeb7ad254843332aee0cb612871da9c392070a97018e7372ca59cce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/presentation/providers/tag_library_page_provider.dart:643-649 | lib/presentation/providers/vibe_library_category_provider.dart:357-363 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/providers/tag_library_page_provider.dart:643\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/presentation/providers/tag_library_page_provider.dart"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c167106220076860d19b45a5842e2a9d1260bf22dd2f66334806892cc414f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/presentation/screens/tag_library_page/widgets/entry_add_dialog.dart:424-430 | lib/presentation/widgets/metadata/metadata_import_dialog.dart:185-191 \u2014 before extracting anything, compare \u0060lib/presentation/screens/tag_library_page/widgets/entry_add_dialog.dart\u0060 and \u0060lib/presentation/widgets/metadata/metadata_import_dialog.dart\u0060 as WHOLE FILES: this scan already matched 3 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/tag_library_page/widgets/entry_add_dialog.dart:424\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/presentation/screens/tag_library_page/widgets/entry_add_dialog.dart"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ec3b350b73025c6aeedfba02a3857816a708f08d476ab536854e12d9dce71a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/presentation/widgets/character/inline_character_card.dart:160-167 | lib/presentation/widgets/character/inline_character_row.dart:350-356 \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/presentation/widgets/character/inline_character_card.dart:160\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/character/inline_character_card.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22d7590742b00ca9164d83e92b80a63efca4bc523408f9b3feceba99dd7278e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/presentation/widgets/gallery/gallery_album_tree_view.dart:550-556 | lib/presentation/widgets/gallery/gallery_category_tree_view.dart:423-429 \u2014 before extracting anything, compare \u0060lib/presentation/widgets/gallery/gallery_album_tree_view.dart\u0060 and \u0060lib/presentation/widgets/gallery/gallery_category_tree_view.dart\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 97 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/presentation/widgets/gallery/gallery_album_tree_view.dart:550\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/presentation/widgets/gallery/gallery_album_tree_view.dart"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"19935dfb5be425e385f66654146d5b4f91769f8ac18e09b2d31225eb1f4c7a2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): lib/presentation/agent_chat/services/generation_execution_service.dart:292-297 | lib/presentation/providers/gallery_category_provider.dart:467-472 | lib/presentation/providers/online_gallery_blacklist_provider.dart:882-887 | lib/presentation/widgets/online_gallery/quick_tag_cloud_toolbar.dart:504-509 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/generation_execution_service.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a66427c816d1bbdf1a1b0a13aef472fab48f5cb9ab3f6b2693da45818f957d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/core/agent/harness/session/jsonl/session_jsonl_codec.dart:322-331 | lib/core/agent/harness/session/jsonl/session_jsonl_storage.dart:747-756 \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/core/agent/harness/session/jsonl/session_jsonl_codec.dart:322\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/core/agent/harness/session/jsonl/session_jsonl_codec.dart"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f396abf98583b403be12c2221801b1e4c53103140b5c3c417e11f46bd1a97a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/data/services/official_random_prompt_generator.dart:242-247 | lib/data/services/official_random_prompt_generator.dart:493-498 \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/data/services/official_random_prompt_generator.dart:242\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/data/services/official_random_prompt_generator.dart"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96f9dd77736c238a7cf4b2613871a72436492cc84e24021b2dc48405e8b40ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart:573-578 | lib/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart:33-38 \u2014 before extracting anything, compare \u0060lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart\u0060 and \u0060lib/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 40 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/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart:573\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/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"8441f3dba6ad4d56011c0edc6fe6a8a039625740559a1a3c518b7a4a6be342f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/presentation/screens/tag_library_page/widgets/entry_selector_dialog.dart:86-91 | lib/presentation/widgets/prompt/fixed_tag_library_picker_dialog.dart:53-58 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/presentation/screens/tag_library_page/widgets/entry_selector_dialog.dart:86\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/presentation/screens/tag_library_page/widgets/entry_selector_dialog.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0232979dfddd605dc159baa2c458ac377f01575072b090ecb564b86129f02bbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/presentation/widgets/navigation/nav_rail_items.dart:124-129 | lib/presentation/widgets/navigation/nav_rail_items.dart:174-179 \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/presentation/widgets/navigation/nav_rail_items.dart"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d9a7ec2d9b9f4e770edf6de8fcf01cef8eb61a5642dff422ade98f251f51bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): lib/core/database/datasources/gallery_favorite_tag_repository.dart:407-412 | lib/core/database/datasources/gallery_image_repository.dart:780-785 | lib/core/database/datasources/gallery_metadata_repository.dart:345-350 | lib/data/services/bulk_image_state_service.dart:320-325 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/datasources/gallery_favorite_tag_repository.dart"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8f3b9c02ea47b3b36792554537fdc01d9426804840531bc8403ce33d6515a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:261-268 | lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:882-889 | lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:190-197 | lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart:444-451 \u2014 before extracting anything, compare \u0060lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart\u0060 and \u0060lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart:261\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 \u0060request\u0060 to \u0060GallerySearchRequest\u0060 in one and \u0060GalleryRandomSearchRequest\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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef671621bd40d4a2511cceadfdde8a1b0ea8e4e0c8122df61c60d7b5ad221e9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): lib/core/database/datasources/gallery_album_repository.dart:853-858 | lib/core/database/datasources/gallery_album_repository.dart:863-868 | lib/core/database/datasources/gallery_album_repository.dart:891-896 \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/core/database/datasources/gallery_album_repository.dart:853\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/core/database/datasources/gallery_album_repository.dart"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f372cc393e534828880a05222b9b99fb66097c1d407e98981d5b3ca3ca9bba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): lib/data/services/official_random_prompt_generator.dart:366-373 | lib/data/services/official_random_prompt_generator.dart:666-673 | lib/data/services/official_random_prompt_generator.dart:674-681 \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/data/services/official_random_prompt_generator.dart:666\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/official_random_prompt_generator.dart"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8766979441b61af5eade2614e50abea7e8267cc52aede9eb530f4e7b96beab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/core/autocomplete/tag_catalog_repository.dart:217-221 | lib/core/autocomplete/tag_catalog_repository.dart:254-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/core/autocomplete/tag_catalog_repository.dart:217\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/core/autocomplete/tag_catalog_repository.dart"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2808a12a7a947f531b4014e02bbc0172528c3a5bd2c5e3fc416906fc91f149"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): lib/core/services/file_export_service.dart:299-303 | lib/core/services/file_export_service.dart:328-332 | lib/data/services/precise_ref_library_archive_service.dart:82-85 \u2014 there are 3 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 3 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/core/services/file_export_service.dart:299\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/core/services/file_export_service.dart"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c02ff665b36f8d9015c0346acb757248a1f51201fd13bf676b299509679c0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/data/services/discord_share_service.dart:539-543 | lib/data/services/metadata/ai_tag_generation_parser.dart:468-472 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/data/services/discord_share_service.dart:539\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/discord_share_service.dart"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f750fe1b56f36386cdbb2154aade98793f8d43cca4618de0cf6700a4ff8413"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 8): lib/presentation/themes/modules/typography/presets/editorial_typography.dart:12-22 | lib/presentation/themes/modules/typography/presets/flat_typography.dart:12-22 | lib/presentation/themes/modules/typography/presets/fluid_typography.dart:12-22 | lib/presentation/themes/modules/typography/presets/grunge_typography.dart:13-23 | lib/presentation/themes/modules/typography/presets/hand_drawn_typography.dart:13-23 | lib/presentation/themes/modules/typography/presets/material_typography.dart:12-22 | lib/presentation/themes/modules/typography/presets/retro_typography.dart:13-23 | lib/presentation/themes/modules/typography/presets/zen_typography.dart:12-22 \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 8 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/themes/modules/typography/presets/editorial_typography.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed545344ab08a212c1058b66768ef638724d63f8741ec7d573a2618549a97391"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/presentation/themes/presets/apple_light_theme.dart:25-29 | lib/presentation/themes/presets/brutalist_theme.dart:25-29 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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/presentation/themes/presets/apple_light_theme.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e5b6f04a45511527013d7a816758e320d275f9847f0800163a785e364a0ed5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): lib/presentation/themes/presets/minimal_glass_theme.dart:31-35 | lib/presentation/themes/presets/neo_dark_theme.dart:25-29 | lib/presentation/themes/presets/pro_ai_theme.dart:25-29 | lib/presentation/themes/presets/retro_wave_theme.dart:25-29 | lib/presentation/themes/presets/social_theme.dart:25-29 | lib/presentation/themes/presets/system_theme.dart:25-29 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 6 call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/themes/presets/minimal_glass_theme.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"13488031c3020555617dc5a3e13a6a9c49785d9a139f8eeb90886f7aa4036c38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): lib/core/cloud_sync/backend/github_cloud_sync_backend.dart:212-216 | lib/core/cloud_sync/backend/onedrive_cloud_sync_backend.dart:98-102 | lib/core/cloud_sync/backend/webdav_cloud_sync_backend.dart:157-161 \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/core/cloud_sync/backend/github_cloud_sync_backend.dart"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"c455a9b079afd2edfd675dc058fdc5bdcdbbe06a7db2b9009e5a518c80beba3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/core/cloud_sync/backend/webdav_capability_probe.dart:292-299 | lib/core/cloud_sync/backend/webdav_cloud_sync_backend.dart:577-584 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/backend/webdav_capability_probe.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb06b6b64a6ed246130b66c80b5a98d018fae0737817eadb225a0ffbc8bfd0b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/core/krita/krita_bridge_server.dart:311-319 | lib/core/mcp/mcp_discovery_file.dart:157-165 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/krita/krita_bridge_server.dart"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"66446964c48e78c72ba0b602fc7298a3cc8260f8e213c87c1208bff5b063e804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/core/utils/character_prompt_block_parser.dart:264-274 | lib/data/services/online_gallery/artist_chain_parser.dart:301-311 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/character_prompt_block_parser.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67e6674f4ff2f6c0a22a2ecf763d76c228d2958e147b11143668d24b51e8772"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/data/services/efficient_vit_sam_service.dart:367-372 | lib/data/services/local_onnx_tagger_service.dart:402-407 \u2014 before extracting anything, compare \u0060lib/data/services/efficient_vit_sam_service.dart\u0060 and \u0060lib/data/services/local_onnx_tagger_service.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 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/data/services/efficient_vit_sam_service.dart"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"80604cba775aa9a882e6c8e308f5d59f0cf5dce8a6ee3c2e7fc17447e298e3da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/data/services/image_metadata_service.dart:769-777 | lib/data/services/metadata/hash_calculator.dart:195-203 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/image_metadata_service.dart"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"07660ec01d7a076912ef125249114a6747dcc5718d6c7e2cf6ce544c2bba4b03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/data/services/image_metadata_service.dart:779-785 | lib/data/services/metadata/hash_calculator.dart:205-211 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/image_metadata_service.dart"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"191a87f2707b854a6f358cf75d87aca16aaa8436e14cd2fd00ab03685d4e4277"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/presentation/agent_chat/services/precise_reference_toolbox.dart:22-30 | lib/presentation/agent_chat/services/vibe_library_toolbox.dart:21-29 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/services/precise_reference_toolbox.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c732bb916a6adc75eb45074074f894ed1f1bd7c6fc58f8ed8eca4c595562ae92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart:408-417 | lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart:717-726 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f9d4a253d57954516aca1f34c72652ff2191d1ca951fd07c43c2cebb5f4667"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart:560-566 | lib/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart:415-421 \u2014 before extracting anything, compare \u0060lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart\u0060 and \u0060lib/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 40 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/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e072cc3b420c9a6cc8b33ad793e19c9584abe9d77916c59a33838d160777f68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/presentation/screens/generation/desktop_layout.dart:74-81 | lib/presentation/screens/generation/web_style_layout.dart:65-72 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/desktop_layout.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c1057e4bf4bc2e4d568e208a28ee4753a884b577a9e477c57bf1c367094688"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/screens/mosaic/mosaic_editor_launcher.dart:32-43 | lib/presentation/screens/watermark/watermark_editor_launcher.dart:30-41 \u2014 \u0060lib/presentation/screens/mosaic/mosaic_editor_launcher.dart\u0060 and \u0060lib/presentation/screens/watermark/watermark_editor_launcher.dart\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 47 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/mosaic/mosaic_editor_launcher.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d62c9739a6577cc874b2bfe8a8e41ef400acae9bd2f0222e6e929bd72b72f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/presentation/screens/mosaic/mosaic_editor_launcher.dart:45-54 | lib/presentation/screens/watermark/watermark_editor_launcher.dart:43-52 \u2014 \u0060lib/presentation/screens/mosaic/mosaic_editor_launcher.dart\u0060 and \u0060lib/presentation/screens/watermark/watermark_editor_launcher.dart\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 47 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/mosaic/mosaic_editor_launcher.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f624b887e75c59c859556e3ac7eb3a5907efe9440292ad6db56e4ff00e2fe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): lib/presentation/screens/online_gallery/online_gallery_content.dart:79-84 | lib/presentation/screens/online_gallery/online_gallery_selection_actions.dart:76-81 | lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_dialogs.dart:32-37 | lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_search.dart:27-32 | lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_source_controls.dart:41-46 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/online_gallery/online_gallery_content.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c6545977656c541121256735e2bacd274a6ba47f035afbc11867b91c0cb05c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/presentation/screens/precise_ref_library/precise_ref_library_screen.dart:74-80 | lib/presentation/screens/precise_ref_library/widgets/precise_ref_selector_dialog.dart:80-86 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/precise_ref_library/precise_ref_library_screen.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"258843e20ace57cedaca63f1870f77d119060c51605c7771b7993701ee4730e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/presentation/screens/precise_ref_library/widgets/precise_ref_card.dart:180-186 | lib/presentation/screens/vibe_library/widgets/vibe_card.dart:283-289 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/precise_ref_library/widgets/precise_ref_card.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a38fba2aaff5ec87a42131050542feaecb93a885c191835c2342561ff43c82f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): lib/presentation/screens/statistics/widgets/animated/animated_bar_chart.dart:28-36 | lib/presentation/screens/statistics/widgets/animated/animated_number.dart:29-37 | lib/presentation/screens/statistics/widgets/animated/animated_pie_chart.dart:28-36 \u2014 before extracting anything, compare \u0060lib/presentation/screens/statistics/widgets/animated/animated_bar_chart.dart\u0060 and \u0060lib/presentation/screens/statistics/widgets/animated/animated_pie_chart.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 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/presentation/screens/statistics/widgets/animated/animated_bar_chart.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"83441365d30c7e49153bf40cf4adbde12f9f54d5d81577afdbc4516edfa8d95b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): lib/presentation/screens/statistics/widgets/charts/funnel_chart.dart:50-61 | lib/presentation/screens/statistics/widgets/charts/heatmap_chart.dart:62-73 | lib/presentation/screens/statistics/widgets/charts/radar_chart.dart:56-67 | lib/presentation/screens/statistics/widgets/charts/stacked_area_chart.dart:53-64 \u2014 before extracting anything, compare \u0060lib/presentation/screens/statistics/widgets/charts/funnel_chart.dart\u0060 and \u0060lib/presentation/screens/statistics/widgets/charts/stacked_area_chart.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 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/presentation/screens/statistics/widgets/charts/funnel_chart.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07d7e2941900197cffe55e3b065eb5f215ec139d48f9d892ccec27ce9694cdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/presentation/screens/vibe_library/widgets/vibe_image_encode_dialog.dart:150-156 | lib/presentation/screens/vibe_library/widgets/vibe_import_naming_dialog.dart:143-149 \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/presentation/screens/vibe_library/widgets/vibe_image_encode_dialog.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba2cb763b49b33275c5cc130190422efd1b8b940ef220c5292c6d2d9db18f3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): lib/presentation/widgets/character/character_position_canvas.dart:690-699 | lib/presentation/widgets/character/inline_character_card.dart:399-408 | lib/presentation/widgets/character/inline_character_row.dart:507-516 \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/presentation/widgets/character/character_position_canvas.dart"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"c205b2b3988eb4df59286fd86730ade14e3d3b9fe8e64687439e5249db11a987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/presentation/widgets/character/character_prompt_button.dart:171-178 | lib/presentation/widgets/character/inline_character_row.dart:686-693 \u2014 before extracting anything, compare \u0060lib/presentation/widgets/character/character_prompt_button.dart\u0060 and \u0060lib/presentation/widgets/character/inline_character_row.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 72 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/presentation/widgets/character/character_prompt_button.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51d1047c259b5ddbf6dc0b4fa83e29d1c1d36b45aa648e3a158c908cff9b37c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/presentation/widgets/character/inline_character_card.dart:137-144 | lib/presentation/widgets/character/inline_character_row.dart:330-337 \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/presentation/widgets/character/inline_character_card.dart"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43a7e05fccd36c15393ec3adee30b160877ed8e7e9839780439a376018a869c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/presentation/widgets/image_editor/core/canvas_controller.dart:55-62 | lib/presentation/widgets/image_editor/core/tool_manager.dart:223-230 \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/presentation/widgets/image_editor/core/canvas_controller.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f3ce205eda0a87aa638395f5a2b4e6bd3039ed65f673300a68b1e3f21469dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/presentation/widgets/image_editor/tools/brush_tool.dart:190-202 | lib/presentation/widgets/image_editor/tools/eraser_tool.dart:54-66 \u2014 before extracting anything, compare \u0060lib/presentation/widgets/image_editor/tools/brush_tool.dart\u0060 and \u0060lib/presentation/widgets/image_editor/tools/eraser_tool.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/image_editor/tools/brush_tool.dart"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d137614a3b542e015b99e56364fb7e28f3070c55a15a78ae977e93124d614f60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/presentation/widgets/image_editor/tools/brush_tool.dart:204-213 | lib/presentation/widgets/image_editor/tools/eraser_tool.dart:68-77 \u2014 before extracting anything, compare \u0060lib/presentation/widgets/image_editor/tools/brush_tool.dart\u0060 and \u0060lib/presentation/widgets/image_editor/tools/eraser_tool.dart\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/image_editor/tools/brush_tool.dart"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c65424092051e27c65dabe08a22384c68654c9dc03292710996a133f43d70c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/core/agent/harness/session/jsonl/session_jsonl_storage.dart:377-384 | lib/core/agent/harness/session/session_memory.dart:88-95 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/harness/session/jsonl/session_jsonl_storage.dart"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b29783a88f3e65458c7b5597415422c710c2cba7fa766f5a796becda226343"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/core/agent/harness/session/jsonl/session_jsonl_storage.dart:391-397 | lib/core/agent/harness/session/session_memory.dart:102-108 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/harness/session/jsonl/session_jsonl_storage.dart"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"3491b964ca217a955e8351c5b52bfc2f568e8683ef8f43f3b81b11f8004005b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/core/agent/resources/agent_chat_resource_reference_codec.dart:227-233 | lib/core/krita/krita_bridge_protocol.dart:412-418 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/resources/agent_chat_resource_reference_codec.dart"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbeb2f8cadab6e5c9d36a17d1be0378c9b46d936bd0c5edcbf0a731abb3bb48a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): lib/core/cloud_sync/backend/github_backend_support.dart:111-118 | lib/core/cloud_sync/backend/onedrive_cloud_sync_backend.dart:541-548 | lib/core/cloud_sync/backend/webdav_cloud_sync_backend.dart:590-597 \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/core/cloud_sync/backend/github_backend_support.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8607c2e4d8caf64606d3703885e727a9921b2dd612028e8e7905985e3e5dc665"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/core/cloud_sync/snapshot_transfer.dart:253-259 | lib/core/cloud_sync/snapshot_uploader.dart:371-377 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/cloud_sync/snapshot_transfer.dart"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"192c9f6fe6f7d396f1ae773512894c4cd3ec3e97211a2fa4474026c5e740fcdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/core/utils/prompt_edit_document.dart:32-40 | lib/presentation/widgets/prompt/tag_editor_session.dart:14-22 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/prompt_edit_document.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4e3590731bc4d1d312b90ef87ad319edb5d22bc969a3bd8ba78a7eeccf9f76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/data/cloud_sync/app_cloud_sync_data_source.dart:811-815 | lib/data/cloud_sync/cloud_sync_operation_storage.dart:587-591 \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/data/cloud_sync/app_cloud_sync_data_source.dart"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a1231c97e9899eb141ee34b334b08bd790b94f594e44ab6ed44b8f1cfb3554"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/data/datasources/remote/online_gallery/quick_tag_cloud_gallery_mapper.dart:208-215 | lib/data/services/no_repeat_round_sampler.dart:28-35 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/datasources/remote/online_gallery/quick_tag_cloud_gallery_mapper.dart"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"99771ca62460b50bf2007d5743e2d0c397b490048353b76e57803b07f8fb08d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/data/models/prompt/pool_sync_config.dart:105-113 | lib/data/models/prompt/sync_config.dart:164-172 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/models/prompt/pool_sync_config.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c30b640581dcc3ec24e961038c00c87fb23a42fb5df906bf5cd355e7f80c8a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/data/services/online_gallery/online_gallery_random_service.dart:20-24 | lib/presentation/providers/online_gallery_pagination_service.dart:480-484 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/online_gallery/online_gallery_random_service.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d11ccd5cc57691a4364495f28932ca081d221974ece39d68f6153b4e94b605b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/presentation/agent_chat/widgets/agent_chat_panel_controller.dart:186-192 | lib/presentation/screens/settings/sections/agent/system_prompt_editor.dart:203-209 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/widgets/agent_chat_panel_controller.dart"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fd4d54a77c2f37289b33d6d9bcc09144200cf7f69e9b58978a4d5f6bc107b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/presentation/agent_chat/widgets/agent_chat_panel_coordinator.dart:457-462 | lib/presentation/prompt_assistant/widgets/prompt_assistant_custom_dialog.dart:126-131 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/widgets/agent_chat_panel_coordinator.dart"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71f8aa91f79e235eb648e7f48b0107edec6384cfbc689557a2feec1a5ed75f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/presentation/screens/mosaic/mosaic_editor_launcher.dart:59-65 | lib/presentation/screens/watermark/watermark_editor_launcher.dart:57-63 \u2014 \u0060lib/presentation/screens/mosaic/mosaic_editor_launcher.dart\u0060 and \u0060lib/presentation/screens/watermark/watermark_editor_launcher.dart\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 47 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/mosaic/mosaic_editor_launcher.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"18977ae16d4b96f71682a3438155e2e653e30c233ae77c0c188f26c3c4081246"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/presentation/screens/mosaic/mosaic_editor_launcher.dart:67-75 | lib/presentation/screens/watermark/watermark_editor_launcher.dart:65-73 \u2014 \u0060lib/presentation/screens/mosaic/mosaic_editor_launcher.dart\u0060 and \u0060lib/presentation/screens/watermark/watermark_editor_launcher.dart\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 47 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/mosaic/mosaic_editor_launcher.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bca110d50a9f153338bbae9b4bd9f75e77951fad4ce5ce14c587ac6a1165106"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/presentation/screens/online_gallery/online_gallery_content.dart:732-743 | lib/presentation/screens/online_gallery/online_gallery_scroll_prefetch_coordinator.dart:43-54 \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/presentation/screens/online_gallery/online_gallery_content.dart"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3014dd45c89baea23e83c2bfefd32b6bbeba1e63214d4bf678f34795fdb673"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/presentation/screens/statistics/widgets/animated/animated_bar_chart.dart:51-61 | lib/presentation/screens/statistics/widgets/animated/animated_pie_chart.dart:51-61 \u2014 before extracting anything, compare \u0060lib/presentation/screens/statistics/widgets/animated/animated_bar_chart.dart\u0060 and \u0060lib/presentation/screens/statistics/widgets/animated/animated_pie_chart.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 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/presentation/screens/statistics/widgets/animated/animated_bar_chart.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e14ba4434a6e68693028e7fd9448a1b2cc1cb9aa95f9e3cc490c05e4588b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/presentation/screens/tag_library_page/widgets/thumbnail_selection_preview.dart:87-93 | lib/presentation/widgets/common/thumbnail_display.dart:55-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/tag_library_page/widgets/thumbnail_selection_preview.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ac64bc9bc8471fba2e80d6663952646f67cd2cbc1f603d74bc0320f103fe79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/presentation/widgets/prompt/quality_tags_selector.dart:282-290 | lib/presentation/widgets/prompt/uc_preset_selector.dart:309-317 \u2014 before extracting anything, compare \u0060lib/presentation/widgets/prompt/quality_tags_selector.dart\u0060 and \u0060lib/presentation/widgets/prompt/uc_preset_selector.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 76 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/presentation/widgets/prompt/quality_tags_selector.dart"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67b114f703075bf37612cb01374058a2979eb6493540a0de8d09f4a427cf953"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/core/agent/harness/session/jsonl/session_jsonl_codec.dart:314-320 | lib/core/agent/harness/session/jsonl/session_jsonl_storage.dart:739-745 \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/core/agent/harness/session/jsonl/session_jsonl_codec.dart:314\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060Map\u003CString, dynamic\u003E\u0060 in one and \u0060Object?\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/core/agent/harness/session/jsonl/session_jsonl_codec.dart"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffed52bfc63674c54ce1474660009fb3ec162544674dab08f66a9b299dd8317"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/core/autocomplete/zh_dictionary_service.dart:400-404 | lib/core/database/asset_database_manager.dart:216-220 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/core/autocomplete/zh_dictionary_service.dart:400\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/core/autocomplete/zh_dictionary_service.dart"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afcbcbf3542cc56680b19860f49cac292d73a54d168fa082347529a387f2341"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/core/utils/efficient_vit_sam_image_processor.dart:263-268 | lib/core/utils/efficient_vit_sam_image_processor.dart:273-278 \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/core/utils/efficient_vit_sam_image_processor.dart:263\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/core/utils/efficient_vit_sam_image_processor.dart"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e8d1e2fa57119c44e2baf26940b12e1689d28eabeffb20c08df35a589c6348"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/data/services/discord_share_service.dart:462-466 | lib/data/services/discord_share_service.dart:467-471 \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/data/services/discord_share_service.dart"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b187ff32d45405600ce8a610b92326ac2d350ae446c24b7157fdc70de540a52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): krita_plugin/install_plugin.py:541-554 | krita_plugin/install_plugin.py:558-572 \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 \u0060krita_plugin/install_plugin.py:541\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":"krita_plugin/install_plugin.py"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade31c146e6c75c1a07dc325b9f1dafd9b53265dd0462d035607fecf8bca9504"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): krita_plugin/nai_launcher_bridge/ui.py:382-395 | krita_plugin/nai_launcher_bridge/ui.py:420-433 \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":"krita_plugin/nai_launcher_bridge/ui.py"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"29048e9de9515203a74045ff5043db3e9d82891042fe42f31ff26e2fc76dc9ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): tool/krita/krita_bridge_direct_probe_no_write.py:111-124 | tool/krita/krita_bridge_direct_probe_no_write.py:144-156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060tool/krita/krita_bridge_direct_probe_no_write.py:109\u0060 calls \u0060connect\u0060 and \u0060tool/krita/krita_bridge_direct_probe_no_write.py:142\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/krita/krita_bridge_direct_probe_no_write.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"199c33a5e35f613b0324124f9ff36d8cfc07231b532abc5569c3897e08e85b4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): krita_plugin/preflight.py:124-136 | krita_plugin/preflight.py:142-154 \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":"krita_plugin/preflight.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4dd034ff0be282700dc82a299dd3d4ce379f39c4ca9fd7cae2120947e76a2ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): tool/krita/krita_bridge_direct_probe_no_write.py:79-91 | tool/krita/krita_bridge_direct_probe_no_write.py:114-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 \u0060tool/krita/krita_bridge_direct_probe_no_write.py:79\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":"tool/krita/krita_bridge_direct_probe_no_write.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5019696ae52fb0558592edeb96697073c9eaf497bef25195dbae9baac1041c3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: OnlineGalleryNotifier (LCOM4 36): OnlineGalleryNotifier\u0027s methods fall into 36 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 36 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/presentation/providers/online_gallery_provider.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"364cd1aa0385f8a8c4f3eccb3d728dcae3d8d3571e21e26a184915ce527d6108"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _ImageEditorScreenState (LCOM4 36): _ImageEditorScreenState\u0027s methods fall into 36 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 36 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/presentation/widgets/image_editor/image_editor_screen.dart"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82c616bfa973391f43add676e2e41c1f6ac2382580ec1529c2955934736f45f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: VibeLibraryNotifier (LCOM4 13): VibeLibraryNotifier\u0027s methods fall into 13 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 13 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/presentation/providers/vibe_library_provider.dart"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe22dda5baafd2827101d580e67df172ac1c1697be4ae7ab5baec6decdc6922"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MoveTool (LCOM4 13): MoveTool\u0027s methods fall into 13 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 13 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/presentation/widgets/image_editor/tools/move_tool.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0168ebb90dfc88379f861f4082699fac8eb55dd992b894973d0d2a6231d169f2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImageEditorWorkspaceState (LCOM4 12): ImageEditorWorkspaceState\u0027s methods fall into 12 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 12 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/presentation/widgets/image_editor/image_editor_workspace.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c5219132c72415d4057894c4b731ac38c0468695be8169008d58dff995c2f4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _BenchmarkDataSource (LCOM4 11): _BenchmarkDataSource\u0027s methods fall into 11 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 11 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":"tool/cloud_sync/cloud_sync_benchmark.dart"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bdca0dbb71f7b60b4793f2ee7ace540e8d702f69158e730aa864241a947e6b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ClosedRegionFillTool (LCOM4 11): ClosedRegionFillTool\u0027s methods fall into 11 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 11 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/presentation/widgets/image_editor/tools/closed_region_fill_tool.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"97153389dd596b14c9cdca99341ad3d1b7330fb2ce82996fcc5b9c80cabf8f38"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _DiskBenchmarkBackend (LCOM4 10): _DiskBenchmarkBackend\u0027s methods fall into 10 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 10 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":"tool/cloud_sync/cloud_sync_production_benchmark.dart"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f4b0623b1fe1619eb0d28b9c4e89ae307e93b39cf8f1dc776ecad5f988ad64"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FillTool (LCOM4 10): FillTool\u0027s methods fall into 10 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 10 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/presentation/widgets/image_editor/tools/fill_tool.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbaac2f1887595605cda2718e0ffb24261832e7134eccc8f5a9fdbd204018860"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GalleryDataSource (LCOM4 9): GalleryDataSource\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/core/database/datasources/gallery_data_source.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34562a913efc67605ff1c311e9301344089d89df56ed61a7735f3090b57bbff"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DirectorToolsNotifier (LCOM4 9): DirectorToolsNotifier\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/presentation/providers/director_tools_notifier.dart"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"754f800a4a290e12ff42c6572ceb802d71d837627d75cea69ab6b998612a26f7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImageWorkflowController (LCOM4 9): ImageWorkflowController\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/presentation/providers/generation/image_workflow_controller.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"41aca853b1ad1d546c351a7c2646414b731ecc5254446434c2e8516d8cb0f664"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BlurTool (LCOM4 9): BlurTool\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/presentation/widgets/image_editor/tools/blur_tool.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1dfa97f55e49b486c4791cf9b2cd20b22dbcdbd6dca5e39af043ed287f264c5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BrushTool (LCOM4 9): BrushTool\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/presentation/widgets/image_editor/tools/brush_tool.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"618385f9031625f930af5a0fb08923fd42bf9290d631e02c206810eb30238dd1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EraserTool (LCOM4 9): EraserTool\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/presentation/widgets/image_editor/tools/eraser_tool.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15fa50db9661d08885fa710a72be987fab54dbb0527dfc609117b15f302cf6d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MagicWandTool (LCOM4 9): MagicWandTool\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/presentation/widgets/image_editor/tools/magic_wand_tool.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23f8145e86136bfc682b66dec28b385a6ce76ddb70e6a4397fde0f23a29657b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GeneratedImageDetailData (LCOM4 8): GeneratedImageDetailData\u0027s methods fall into 8 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 8 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/presentation/widgets/common/image_detail/image_detail_data.dart"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff28a09aecc4102378561680e8fc06e38dc5d815f155db971bc6742bbec416e1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CloneStampTool (LCOM4 8): CloneStampTool\u0027s methods fall into 8 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 8 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/presentation/widgets/image_editor/tools/clone_stamp_tool.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0444207a5657a0549e31d79f9995b6637c00fb45a2732e85c7f88823e51037e7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ColorPickerTool (LCOM4 8): ColorPickerTool\u0027s methods fall into 8 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 8 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/presentation/widgets/image_editor/tools/color_picker_tool.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4b0d09fa41e6c66bf0baee57d562f5dbc23bd03109d448ed74c360e8556db8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FrameTool (LCOM4 8): FrameTool\u0027s methods fall into 8 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 8 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/presentation/widgets/image_editor/tools/frame_tool.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2650f13d42281ea1f983463de15400c52a04790b232ff960a3f45d990ff86990"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImageCardContextMenuRoute (LCOM4 7): ImageCardContextMenuRoute\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/image_card_context_menu.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2bcd50156d3780e4e559605c659f97afa706a0552c8f94c11e80c618fd53fc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FileImageDetailData (LCOM4 7): FileImageDetailData\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/image_detail/file_image_detail_data.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"362891d0c5e5fb5ee49fd9e0fbe55856acbd95578880419b504c5107cb40cb6a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EditorCompressionController (LCOM4 7): EditorCompressionController\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/image_editor/controllers/editor_compression_controller.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2751487143b89ff6a213b524090615da6532e85275e866ff70bb8d37c9b3145"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _MemoryUpdateCheckStorage (LCOM4 6): _MemoryUpdateCheckStorage\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/services/update_check_service.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"596c6ca7599ad25332e74696c14c67f21d3470f536c5355eb306a88355059309"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SettingsCloudSyncAdapter (LCOM4 6): SettingsCloudSyncAdapter\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/cloud_sync/app_cloud_sync_adapters.dart"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"963233bb75850cd22204fe17867d5ffba134c93014e29209d9ccb4b37a7fdfae"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GalleryAlbumCloudSyncAdapter (LCOM4 6): GalleryAlbumCloudSyncAdapter\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/cloud_sync/gallery_album_cloud_sync_adapter.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"652a32a18ec018f83d072a17f9410c20dedabd909f150543800ea4535739b70c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GelbooruGallerySourceAdapter (LCOM4 6): GelbooruGallerySourceAdapter\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5def55c18df6dd696e25113ef303e4a026dac9c635153472d29accbaa182b0a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ErrorGalleryService (LCOM4 6): ErrorGalleryService\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/gallery/unified_gallery_service.dart"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c602a8dcf78cf6a8ae3b58c0be3a36812a79a50e35e6e748cb0db5a8eba450"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: VibeLibraryStorageService (LCOM4 6): VibeLibraryStorageService\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/vibe_library_storage_service.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01f5348472149f594ca7983c1f4f027203d0ecfb17f13342d5fe10fa663e1de"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: UpdateStateNotifier (LCOM4 6): UpdateStateNotifier\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/update_provider.dart"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4487ba67bb9f45bb4c4e2d0c453d0aabb5ccf9120aaf8a7a745a0b945dfb530"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WarmupNotifier (LCOM4 6): WarmupNotifier\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/warmup_provider.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d800a18e6fea4c93f71c31d7ea0c8306233a0ef0dff6b97dff09de6a89158be6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Img2ImgPanelCoordinator (LCOM4 6): Img2ImgPanelCoordinator\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/generation/widgets/img2img_panel_coordinator.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de006d12470fae40b68d1dfe9ff370b829a8e1c57d4dba6d73067a7ffd30c20"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: VibeLibraryScreenController (LCOM4 6): VibeLibraryScreenController\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/vibe_library/vibe_library_screen_controller.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3026b5fe9f76d62b0892ce4e6f632dd6fc161760db101b5bbb15b7868ba4e3b1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImportMenu (LCOM4 6): ImportMenu\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/vibe_library/widgets/menus/vibe_import_menu.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6614db73b9d9c5760de4a945f6caa6cda9904c72219141a5dd2645f2c000871"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RenderAdaptiveTitleBar (LCOM4 6): RenderAdaptiveTitleBar\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/adaptive_title_bar.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f3d8bd1d4334993d94fc604cab8ca76a7a85a9a8ddbe5221f70bab738c0082"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LocalImageDetailData (LCOM4 6): LocalImageDetailData\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/image_detail/image_detail_data.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3180ff28d0b992ec52817c59df92039e8467d8af7c2b49874ac249dd3cca5f1d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImageEditorProcessingService (LCOM4 6): ImageEditorProcessingService\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/image_editor/image_editor_processing_service.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc4aa56bc3f6371e0fb55bf0387b87f9ae53fd43fbd196314a447109c05affa"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LassoSelectionTool (LCOM4 6): LassoSelectionTool\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/image_editor/tools/selection/lasso_selection_tool.dart"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0717016bffbbac19b4c1e8ad0244c8714ee21c6679f3760b0509b02b1f0435a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _BenchmarkAdapter (LCOM4 5): _BenchmarkAdapter\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":"tool/cloud_sync/cloud_sync_production_benchmark.dart"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5caead004d4753ff97fd5e81365f5d1d2b71d59554c83afcf6cc0827e5e5a9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GalleryImageRequest (LCOM4 5): GalleryImageRequest\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/core/cache/gallery_image_request.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"74dcbb395d25063155e23831783a12579d61cfd6bd725e0cb936f5de3e7cc682"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DanbooruTagDataSource (LCOM4 5): DanbooruTagDataSource\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/core/database/datasources/danbooru_tag_data_source.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"616ee03df6c6762ba2daf8cc0fdfcc3354d96138afa97e8c735394a94deccdab"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PreciseRefCloudSyncAdapter (LCOM4 5): PreciseRefCloudSyncAdapter\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/data/cloud_sync/precise_ref_cloud_sync_adapter.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b58a983c6de5622fb2b8cce68ad47f71fd71c37ca143c051b6c18d572dd835"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: VibeLibraryCloudSyncAdapter (LCOM4 5): VibeLibraryCloudSyncAdapter\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/data/cloud_sync/vibe_library_cloud_sync_adapter.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"82621d2ea8a7a40541bdfc6b68ebc14e2e913e8e1a4ab7ef2a475c8c87132bac"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GelbooruAuth (LCOM4 5): GelbooruAuth\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/data/services/gelbooru_auth_service.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d285b4defdbef10e3a87b3b41994e7acd843230b5b89a731590da3f2168369"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _AgentChatComposerState (LCOM4 5): _AgentChatComposerState\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/presentation/agent_chat/widgets/agent_chat_composer.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e071285faa0537a13de45301fd2e380bcb59ca4200afd9f8d6385dbfdc29e0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _AgentChatThreadViewportState (LCOM4 5): _AgentChatThreadViewportState\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/presentation/agent_chat/widgets/agent_chat_history.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef6e75b9dd59218d7ab4f5d1213123f36dd61fad8d91d3edc055dfaa20390e5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImageGenerationNotifier (LCOM4 5): ImageGenerationNotifier\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/presentation/providers/image_generation_provider.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f2c4453aa51bd4cfc71ed19316647c0f568800ec9f0fb98a13bacb2a350f7d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _CloudSyncSetupState (LCOM4 5): _CloudSyncSetupState\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/presentation/screens/cloud_sync/cloud_sync_setup.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"021a8a07f0495c12dc87ebea8c56fcfe72d54defc6978b739353b2156c360781"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: OnlineGalleryToolbarSourceControls (LCOM4 5): OnlineGalleryToolbarSourceControls\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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_source_controls.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"756b3f13c1abc8a5f1503d2080cbea613413262574032cf6185d65b6bf63abd1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _PromptSectionState (LCOM4 5): _PromptSectionState\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/presentation/widgets/common/image_detail/components/prompt_section.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69087a977065156f6d3eb789da87f83021c4ba049bd50c179d27a53c1759ce7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EditorFrameController (LCOM4 5): EditorFrameController\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/presentation/widgets/image_editor/frame/editor_frame_controller.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bfb907910d2323913bdd0b9c03fec909b5bbd3cb7ea7fadfc068f49ad53f38"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _OnlineGalleryBlacklistSettingsPanelState (LCOM4 5): _OnlineGalleryBlacklistSettingsPanelState\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/presentation/widgets/online_gallery/blacklist_settings_panel.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f504d1f63a8046db42136bddbb21da3e3b3f7d86af057b031aa09ce8944556"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _BenchmarkBackend (LCOM4 4): _BenchmarkBackend\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":"tool/cloud_sync/cloud_sync_benchmark.dart"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"a271436afb3d3e384cb1025bc5526669c86bc3007b28f3600b145727abb538e7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AgentSkillsCloudSyncAdapter (LCOM4 4): AgentSkillsCloudSyncAdapter\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/data/cloud_sync/agent_cloud_sync_adapters.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"17560d1f999d56249bf27baa0bea0f38956505357a856d162b223c263b5ac138"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GalleryBlacklistCloudSyncAdapter (LCOM4 4): GalleryBlacklistCloudSyncAdapter\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/data/cloud_sync/app_cloud_sync_adapters.dart"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ace7a0588f9770d661c6c3436288b3a5358a901349df1961c815c5cd8595bb"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PromptAssistantProfileCloudSyncAdapter (LCOM4 4): PromptAssistantProfileCloudSyncAdapter\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/data/cloud_sync/app_cloud_sync_adapters.dart"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e19541adf58c16b7ee0212ed29d8b5845d7e4b4ea76727207d5e0003e82d5c3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FfdkjInstallIntentAdapter (LCOM4 4): FfdkjInstallIntentAdapter\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/data/cloud_sync/ffdkj_install_intent_adapter.dart"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1983281a9444e8d44fd0af214539bf260e2406d4578504cf6d34b3c0d269b23"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FixedTagUsageCloudSyncAdapter (LCOM4 4): FixedTagUsageCloudSyncAdapter\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/data/cloud_sync/fixed_tag_usage_cloud_sync_adapter.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6e0eb158ea706d8b4074bcf261423e127e30ec5cec3c41d4310ea398fde883"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: OnlineFavoritesCloudSyncAdapter (LCOM4 4): OnlineFavoritesCloudSyncAdapter\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/data/cloud_sync/online_favorites_cloud_sync_adapter.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fab1f12d07628e0ba5f1605d44351a0ca83962d6f476939a5554c7002f87537"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: UserTagLibraryCloudSyncAdapter (LCOM4 4): UserTagLibraryCloudSyncAdapter\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/data/cloud_sync/user_tag_library_cloud_sync_adapter.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"70822a06dfbe4dd3f3340e0e840e9b16ca27f9ba412b05684a0bf7d1b578d052"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NaiGenerationTransport (LCOM4 4): NaiGenerationTransport\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/data/datasources/remote/nai_generation_transport.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fcfe73d18bb27640e19220b065ebaa71ec61d24ce5d7dab75115db1a5ae0bc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AiTagGallerySourceAdapter (LCOM4 4): AiTagGallerySourceAdapter\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/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf41ae781eb722d1c40bbe65c431b9e6117183a3db3619cca4e580bba130488"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: QuickTagCloudMediaResolver (LCOM4 4): QuickTagCloudMediaResolver\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/data/services/online_gallery/quick_tag_cloud_media_resolver.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c5df3a56eadabc45e6a0a362b9fd3af736b2726c0cb47c51a39c52d487758b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: VibeLibraryNotifierImportRepository (LCOM4 4): VibeLibraryNotifierImportRepository\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/data/services/vibe_library_import_repository_impl.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d46a5306d9b7828bcf545ace43c6756df4e82b94a6709a4f765aa624eac3193"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AgentChatPanelController (LCOM4 4): AgentChatPanelController\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/presentation/agent_chat/widgets/agent_chat_panel_controller.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b922bf9de117dec74d8bbd6ca65d04508ad222e32cfc5edac2e5fde0fac68b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _AgentChatWorkTrailState (LCOM4 4): _AgentChatWorkTrailState\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/presentation/agent_chat/widgets/agent_chat_turn.dart"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba4289e4d76decd831e2e0391d4717123ae77bc4bf846732ab2355848e279d0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BulkOperationNotifier (LCOM4 4): BulkOperationNotifier\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/presentation/providers/bulk_operation_provider.dart"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70703b6645b104a63cca59982e435b5632289f3cab07a517791e897562382b9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GenerationParamsPersistenceService (LCOM4 4): GenerationParamsPersistenceService\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/presentation/providers/generation/generation_params_persistence_service.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eaba57e19ffd38a2ce85dc630059e27de375eab112aab9517eab04d23ecce29"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImageWorkflowParamsSyncService (LCOM4 4): ImageWorkflowParamsSyncService\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/presentation/providers/generation/image_workflow_params_sync_service.dart"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61b5a9c0dbfff7c7132e175ae83741f9bc0304bb76c27a7567a0bf8444108ad"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: StreamGenerationNotifier (LCOM4 4): StreamGenerationNotifier\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/presentation/providers/generation/stream_generation_notifier.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68a634c04bec02ca0d5f7ed7707eea5ec0a9a615981d59a3dd0c19d8dbc77b2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _HistoryPanelState (LCOM4 4): _HistoryPanelState\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/presentation/screens/generation/widgets/history_panel.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36edf65034d19c92afad760a8f458164e9546885d19fa2a8ecc227ff5498352"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: OnlineGalleryScreenController (LCOM4 4): OnlineGalleryScreenController\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/presentation/screens/online_gallery/online_gallery_screen_controller.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f995edde8557783807d666fdc94d227b93ba9c3f00db09b0b82a2c173a337a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: OnlineGalleryToolbarAuthControls (LCOM4 4): OnlineGalleryToolbarAuthControls\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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_auth.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"684715b6383c71eeed6d26bce6e74047edd0fa7d8bfd3c14b6f85689b472ecd1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _PreciseRefLibraryScreenState (LCOM4 4): _PreciseRefLibraryScreenState\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/presentation/screens/precise_ref_library/precise_ref_library_screen.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b52b94c151af28d78e6c4443bd3c82ba8f34677d2860d0d14db60b7af8560bf"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _VibeExportDialogState (LCOM4 4): _VibeExportDialogState\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/presentation/screens/vibe_library/widgets/vibe_export_dialog.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3329fad4a7006354d7fb25332b860dec80e024d3ba600642f65083357acbe67"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _InlineCharacterCardState (LCOM4 4): _InlineCharacterCardState\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/presentation/widgets/character/inline_character_card.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"54db0b5acbf355ab9a809986a30664ea10b24a3546b2ebf28c7452890d57df5e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _SelectableImageCardState (LCOM4 4): _SelectableImageCardState\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/presentation/widgets/common/selectable_image_card.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6e2652543f9db859ed063a4fb501c944cc3ece71ff1e638bf4849ac64fb018"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EditorState (LCOM4 4): EditorState\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/presentation/widgets/image_editor/core/editor_state.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85a85872eaf77ebca6dc5ac92f9492346abf54b3b87e0f443da95262dddc7e5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LayerCommands (LCOM4 4): LayerCommands\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/presentation/widgets/image_editor/core/layer_commands.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbbb4db7f319f6095a39458d82e28bd7e94897062c87b6f285af135b82d13e9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PlaceImageLayerAction (LCOM4 4): PlaceImageLayerAction\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/presentation/widgets/image_editor/core/transform_actions.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6140d6b3cb9e0466019d2d99882a0f4eaacb4d3bb7997913cbe7939d699cda4a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BaseSelectionTool (LCOM4 4): BaseSelectionTool\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/presentation/widgets/image_editor/tools/selection/base_selection_tool.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2721b30c102b7090542c870aa60989f814e5bd0cfb532a28a2be2c86bb57457"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _GalleryDetailDialogState (LCOM4 4): _GalleryDetailDialogState\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/presentation/widgets/online_gallery/gallery_detail_dialog.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb65d9ac0bcaf95232fc00cd624258eb6e6faaf742fb6555e564c0c266601b4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _ConditionalBranchPanelState (LCOM4 4): _ConditionalBranchPanelState\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/presentation/widgets/prompt/diy/panels/conditional_branch_panel.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23be18b2b28da8ab4adc3027100a3a7956600dd5e3dfaf833fddbb055d577f4"}},{"ruleId":"D13","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":"f79d02082f793cd00ea9447d96aa75a6028ee521925906f38f1edf45a8d627a8"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"9773b5a95e5b42433d728b26ef8b3a48782d37569f53e47186de8763b9698d37"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"8e245da7d24121f7dc93a00318ea0ea1b1fb41bc4fb422ee588b6a816175a9a8"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"677001b5967a8f8af6c798f5b3a76d989afdbabb964c5d19b6da153889a212e6"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"099dbaee37fc612b25ff6a6d360d5d82149a6a43670b2e0f72ddb062de45f118"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/danbooru_post_card.dart: lib/presentation/widgets/danbooru_post_card.dart changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in _DanbooruPostCardState._buildCard at line 559. 14 of those changes were fix/bug commits, and the other 25 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/danbooru_post_card.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/presentation/widgets/danbooru_post_card.dart"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3d08b31d2d717f76c8578b89f704ac0e277a0d1c34394939282601d79371a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/providers/image_generation_provider.dart: lib/presentation/providers/image_generation_provider.dart changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in ImageGenerationNotifier.generate at line 292. 13 of those changes were fix/bug commits, and the other 30 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/providers/image_generation_provider.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/presentation/providers/image_generation_provider.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf0d3be080c9c8a4a039edf6efb012017396b359a6aef6a7b08dc108d10819a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/generation/widgets/image_preview.dart: lib/presentation/screens/generation/widgets/image_preview.dart changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in _ImagePreviewWidgetState._buildGeneratedImageCard at line 656. 15 of those changes were fix/bug commits, and the other 26 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/generation/widgets/image_preview.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/presentation/screens/generation/widgets/image_preview.dart"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b24395a41d34c4363f9556141d0b487a191852c732d6c96dabd26dde7dde7bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/agent_chat/providers/agent_chat_notifier.dart: lib/presentation/agent_chat/providers/agent_chat_notifier.dart changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in AgentChatNotifier._sendMessage at line 1143. 16 of those changes were fix/bug commits, and the other 18 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/agent_chat/providers/agent_chat_notifier.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/providers/agent_chat_notifier.dart"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f4a961f21ea7b40a9dfec39822e9cbd147b1abe76415d846e666c1e22fec53"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/online_gallery/online_gallery_screen.dart: lib/presentation/screens/online_gallery/online_gallery_screen.dart changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in _OnlineGalleryScreenState._handleGalleryStateChanged at line 303. 17 of those changes were fix/bug commits, and the other 28 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/online_gallery/online_gallery_screen.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/presentation/screens/online_gallery/online_gallery_screen.dart"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15566354dcfd3062f28a8f40c79fa4c2f4ec6caa779cbc22be8dd319fce51fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/agent_chat/widgets/agent_chat_composer.dart: lib/presentation/agent_chat/widgets/agent_chat_composer.dart changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in _AgentChatComposerState._editor at line 236. 8 of those changes were fix/bug commits, and the other 19 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/agent_chat/widgets/agent_chat_composer.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/presentation/agent_chat/widgets/agent_chat_composer.dart"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a767047a219c60a26c82ef951dcfb5853aa01997795088876afdd0bf4537fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/prompt/unified/unified_prompt_input.dart: lib/presentation/widgets/prompt/unified/unified_prompt_input.dart changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in _UnifiedPromptInputState._handleHardwareKeyEvent at line 156. 16 of those changes were fix/bug commits, and the other 16 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/unified/unified_prompt_input.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/presentation/widgets/prompt/unified/unified_prompt_input.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"079bc12e6922dcbd6dd1883a7e16188fa4df3887d68770e6788b790b983ad516"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/vibe_library/widgets/vibe_card.dart: lib/presentation/screens/vibe_library/widgets/vibe_card.dart changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in _VibeCardState._buildCard at line 291. 7 of those changes were fix/bug commits, and the other 20 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/vibe_library/widgets/vibe_card.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/presentation/screens/vibe_library/widgets/vibe_card.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b591343e479d18190b3f1cf6614ab84507dbe44cb019725781acd688503e1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/online_gallery/online_gallery_content.dart: lib/presentation/screens/online_gallery/online_gallery_content.dart changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in _OnlineGalleryContentPresenter._buildResolvedPostCard at line 369. 7 of those changes were fix/bug commits, and the other 12 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/online_gallery/online_gallery_content.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/presentation/screens/online_gallery/online_gallery_content.dart"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab56b3461e933018c9d5f4342c82cdff602671e0b6987c5ec48089d59476693d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/data/models/gallery/nai_image_metadata.dart: lib/data/models/gallery/nai_image_metadata.dart changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in NaiImageMetadata.upgradeFromRawJsonIfNeeded at line 238. 8 of those changes were fix/bug commits, and the other 12 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/models/gallery/nai_image_metadata.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/data/models/gallery/nai_image_metadata.dart"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fd3650d9e1fac54ad381b2c6ceb5c5f27eb7b447c78d20452ca89a11bca03d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/agent_chat/widgets/agent_chat_messages.dart: lib/presentation/agent_chat/widgets/agent_chat_messages.dart changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in AgentChatMessages.build at line 35. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/agent_chat/widgets/agent_chat_messages.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/presentation/agent_chat/widgets/agent_chat_messages.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52217fe657c20c23725aa6718478b91348ea995306e1693c72eda99ff144032"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/online_gallery/quick_tag_cloud_toolbar.dart: lib/presentation/widgets/online_gallery/quick_tag_cloud_toolbar.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in _QuickTagCloudToolbarState.build at line 62. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/online_gallery/quick_tag_cloud_toolbar.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/presentation/widgets/online_gallery/quick_tag_cloud_toolbar.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fdece40bfb67945b07d3f1b3553999c9452ca895a17b71b593b91f7eeda97d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/common/image_card_surface.dart: lib/presentation/widgets/common/image_card_surface.dart changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in ImageCardSurface._buildSurface 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/common/image_card_surface.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/presentation/widgets/common/image_card_surface.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4c9d12bb67b9b30415c77af6d76be352e5e4391d92d4740aab33e77e8492b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/providers/online_gallery_provider.dart: lib/presentation/providers/online_gallery_provider.dart changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in OnlineGalleryNotifier.goToPage at line 532. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/providers/online_gallery_provider.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/presentation/providers/online_gallery_provider.dart"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc52685cf900da2dde5c8c7510fdc50ca584dfb191d459a461a3bccb5b0b6ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/common/image_detail/image_detail_viewer.dart: lib/presentation/widgets/common/image_detail/image_detail_viewer.dart changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in _ImageDetailViewerState._buildMainContent at line 602. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/common/image_detail/image_detail_viewer.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/presentation/widgets/common/image_detail/image_detail_viewer.dart"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"2023914d578b80f00da044b9e92c708b1190e6cd0b2f7e6aa91232f1ac684336"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/network/request_builders/nai_image_request_builder.dart: lib/core/network/request_builders/nai_image_request_builder.dart changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in NAIImageRequestBuilder.build at line 563. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/network/request_builders/nai_image_request_builder.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/core/network/request_builders/nai_image_request_builder.dart"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3bbe8c885f49d3f954aaf58bb34b9ecbdd617c05703f1749ce4fa7ee6e3fe0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/providers/generation/image_generation_coordinator.dart: lib/presentation/providers/generation/image_generation_coordinator.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in ImageGenerationCoordinator.execute at line 81. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/providers/generation/image_generation_coordinator.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/presentation/providers/generation/image_generation_coordinator.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f35c93873c2f80072f27dd922567a896f91105a6dd165c693d382ab743cc99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart: lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in OpenAiChatCompletionsAdapter.completeAgent at line 97. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.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/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"df72e88a161e0ebe24af9843549a16f406f64fe3fafe5fcb654afd50c02e51c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/settings/sections/privacy_settings_section.dart: lib/presentation/screens/settings/sections/privacy_settings_section.dart changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in _PrivacySettingsSectionState.build at line 94. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/settings/sections/privacy_settings_section.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/presentation/screens/settings/sections/privacy_settings_section.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"391a5a85d4922cebe1f1b09fbfc34e12a9a3fa66a2444e4d24a2287766b04bc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/gallery/gallery_category_tree_view.dart: lib/presentation/widgets/gallery/gallery_category_tree_view.dart changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in _CategoryItemState.build at line 423. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/gallery/gallery_category_tree_view.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/presentation/widgets/gallery/gallery_category_tree_view.dart"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2b48eaa397dd72ffdf96f1541a4e3c1bdf2561be716169f62a2ccfb55e76c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/prompt_assistant/widgets/prompt_assistant_overlay.dart: lib/presentation/prompt_assistant/widgets/prompt_assistant_overlay.dart changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in _PromptAssistantOverlayState._runAction at line 242. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/prompt_assistant/widgets/prompt_assistant_overlay.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/presentation/prompt_assistant/widgets/prompt_assistant_overlay.dart"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"66af6009aab99b55007127d3b9f0a9724672c505e48c02ff4bf02aee33ed5958"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/agent_chat/widgets/agent_chat_tool_widgets.dart: lib/presentation/agent_chat/widgets/agent_chat_tool_widgets.dart changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in _AgentChatToolResultTileState.build at line 147. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/agent_chat/widgets/agent_chat_tool_widgets.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/presentation/agent_chat/widgets/agent_chat_tool_widgets.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9d11843c3a7ddf1220835e80d309cf4643dcd718305c36d264675039e0fd8c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/common/card_action_buttons.dart: lib/presentation/widgets/common/card_action_buttons.dart changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in CardActionButtons.build at line 93. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/common/card_action_buttons.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/presentation/widgets/common/card_action_buttons.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca131e9085ddee3379f42cf68e203473f43290133fb1126e9b5220565d5f20a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/tag_library_page/tag_library_page_screen.dart: lib/presentation/screens/tag_library_page/tag_library_page_screen.dart changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in _TagLibraryPageScreenState.build at line 93. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/tag_library_page/tag_library_page_screen.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/presentation/screens/tag_library_page/tag_library_page_screen.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3c251f27e17db0c2dda693a65b034c7e141a4c5279382f49919e0aedf2d98d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart: lib/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in GeminiGenerateContentAdapter.completeAgent at line 71. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.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/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f6c1c61f53d3b36314ef98f152bf3bceae7046772fe387a584e7e92d07a080"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart: lib/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in AnthropicMessagesAdapter.completeAgent 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.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/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e365e9bc0dbc269b80baf000a72e9386b67faeb3f7e11480149fa8f08159b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/autocomplete/autocomplete_wrapper.dart: lib/presentation/widgets/autocomplete/autocomplete_wrapper.dart changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in _AutocompleteWrapperState._onKeyEvent at line 625. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/autocomplete/autocomplete_wrapper.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/presentation/widgets/autocomplete/autocomplete_wrapper.dart"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4b56a642c8d905502d31a2a39ac52e8c16069c7f99882fcaa2945a1267147a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/gallery/gallery_album_tree_view.dart: lib/presentation/widgets/gallery/gallery_album_tree_view.dart changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in _AlbumItemState.build at line 550. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/gallery/gallery_album_tree_view.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/presentation/widgets/gallery/gallery_album_tree_view.dart"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28f4a01654d6b5f665c8856895a3c52978c6d93db67e5f23842af13a27b1680"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/agent_chat/services/generation_preparation_service.dart: lib/presentation/agent_chat/services/generation_preparation_service.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in GenerationPreparationService.prepareForKind at line 140. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/agent_chat/services/generation_preparation_service.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/presentation/agent_chat/services/generation_preparation_service.dart"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90232cd7e44dc2facd36650a3b7aef2279fb9240379ea58c09c796680b55e8a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/data/services/official_random_prompt_generator.dart: lib/data/services/official_random_prompt_generator.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in _OfficialRecipeEngine._furryCharacter at line 502. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/services/official_random_prompt_generator.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/data/services/official_random_prompt_generator.dart"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51922968ae505126e0686f85b23b02a5d515a489f8d21f5d4ab99b262d724ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/providers/online_gallery_pagination_service.dart: lib/presentation/providers/online_gallery_pagination_service.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 95 in OnlineGalleryPaginationService.load at line 90. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/providers/online_gallery_pagination_service.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/presentation/providers/online_gallery_pagination_service.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4895ad314cdc313ed3c344c7a4a0ec67442f772f370767b99c39a2418cfcc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/image_editor/core/input_handler.dart: lib/presentation/widgets/image_editor/core/input_handler.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in InputHandler.handleKeyEvent at line 193. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/image_editor/core/input_handler.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/presentation/widgets/image_editor/core/input_handler.dart"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b296eeb346e86c05eaf48da21a24ea0919f514f3fb4d735bc3880299cb5d840"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/gallery/local_gallery_toolbar.dart: lib/presentation/widgets/gallery/local_gallery_toolbar.dart changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in _LocalGalleryToolbarState.build at line 167. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/gallery/local_gallery_toolbar.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/presentation/widgets/gallery/local_gallery_toolbar.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af62bcb1291bf11e569d5c353b31e7cc61cf9b67817b32fd3b0c2eb8534fc34"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart: lib/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in OpenAiResponsesAdapter.completeAgent at line 70. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.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/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ad02f39212e10edf78f6cda5fac5c8020d9cbdd7292f54d004be54c90560e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/local_gallery/local_gallery_action_coordinator.dart: lib/presentation/screens/local_gallery/local_gallery_action_coordinator.dart changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in LocalGalleryActionCoordinator.packSelectedImages at line 260. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/local_gallery/local_gallery_action_coordinator.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/presentation/screens/local_gallery/local_gallery_action_coordinator.dart"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8549d59ac25d3524646a87f4c6f0db080e04860ef728e647eeaa8cc7219a407"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart: lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in _CategoryItemState.build at line 359. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/tag_library_page/widgets/category_tree_view.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/presentation/screens/tag_library_page/widgets/category_tree_view.dart"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00e02a220ad2fc0495482ee1e7e9b6fa96a65945e07a728a82517505e04a8b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/precise_ref_library/precise_ref_library_screen.dart: lib/presentation/screens/precise_ref_library/precise_ref_library_screen.dart changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _PreciseRefLibraryScreenState.build at line 589. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/precise_ref_library/precise_ref_library_screen.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/presentation/screens/precise_ref_library/precise_ref_library_screen.dart"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d60c69da4c9be261db81a0742151254ed83e5b830c664b6861411c177b304be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/agent_chat/services/agent_chat_event_controller.dart: lib/presentation/agent_chat/services/agent_chat_event_controller.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in AgentChatEventController.handle at line 42. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/agent_chat/services/agent_chat_event_controller.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/presentation/agent_chat/services/agent_chat_event_controller.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72ab5858ac54f99b826e2a3941baf7f610797d41b463b947c213a15a21d561e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/data/services/auth_provider.dart: lib/data/services/auth_provider.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in AuthNotifier._restoreStoredSession at line 289. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/services/auth_provider.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/data/services/auth_provider.dart"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b5554666bb0bf3090f03eacded529e75c6ff8c762f8dd115ae09d5b0b25648"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/tag_library_page/widgets/entry_card.dart: lib/presentation/screens/tag_library_page/widgets/entry_card.dart changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in _EntryCardState.build at line 82. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/tag_library_page/widgets/entry_card.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/presentation/screens/tag_library_page/widgets/entry_card.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8d60336d52ada2869576c7064586d088c5187cce94c4de49786827202ae167"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/services/image_workflow_launcher.dart: lib/presentation/services/image_workflow_launcher.dart changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in ImageWorkflowLauncher._openEditor 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/services/image_workflow_launcher.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/presentation/services/image_workflow_launcher.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e188a80f05fbbd175f172e9c21ccd2d450f1a513cd1342b273a82170f24af4b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/generation/widgets/prompt_input_editor.dart: lib/presentation/screens/generation/widgets/prompt_input_editor.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in PromptInputEditor.build at line 35. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/generation/widgets/prompt_input_editor.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/presentation/screens/generation/widgets/prompt_input_editor.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0722fadbfeca37d30eef6fdd806b5ca40fde4a77f305c97cb617f257a68a15e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart: lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in _VibeCategoryItemState.build at line 65. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/vibe_library/widgets/category/vibe_category_item.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/presentation/screens/vibe_library/widgets/category/vibe_category_item.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc62373e0c7cd574014b44a74699384608e705c83e8698fed47b17d969f6879d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/data/services/random_prompt_generator.dart: lib/data/services/random_prompt_generator.dart changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in RandomPromptGenerator._generateFromPoolGroup at line 712. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/services/random_prompt_generator.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/data/services/random_prompt_generator.dart"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"922434379e4e4824781746cadb98143389fcf43999de18091b8dbdaf0da9cf9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/common/image_detail/components/detail_top_bar.dart: lib/presentation/widgets/common/image_detail/components/detail_top_bar.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in _DetailTopBarActions._buildActions at line 196. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/common/image_detail/components/detail_top_bar.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/presentation/widgets/common/image_detail/components/detail_top_bar.dart"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd189330c9aad7635352c8242ff09e9fc62c9e9fd541ac853f93dde26dca0db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/prompt_assistant/models/assistant_model_capability.dart: lib/presentation/prompt_assistant/models/assistant_model_capability.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in AssistantModelCatalog._resolvePiProvider at line 361. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/prompt_assistant/models/assistant_model_capability.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/presentation/prompt_assistant/models/assistant_model_capability.dart"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba253570f52d1d7c5342a26860d31538789e7beb2a845df51fb040579fb0f90f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/precise_ref_library/widgets/precise_ref_selector_dialog.dart: lib/presentation/screens/precise_ref_library/widgets/precise_ref_selector_dialog.dart changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in _PreciseRefSelectorDialogState.build at line 129. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/precise_ref_library/widgets/precise_ref_selector_dialog.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/presentation/screens/precise_ref_library/widgets/precise_ref_selector_dialog.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2a25609083b0495771c95c1cb70b2628a6caa5e3c5386443d19d02acae5189"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/common/update_check_dialog.dart: lib/presentation/widgets/common/update_check_dialog.dart changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in UpdateCheckDialog._buildActions at line 682. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/common/update_check_dialog.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/presentation/widgets/common/update_check_dialog.dart"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"865c207f8b2d7cd2685f2ed35d361dee9701ebd1bf9e3e0f65ca3e93cfdaf4c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/services/image_send_action_dispatcher.dart: lib/presentation/services/image_send_action_dispatcher.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ImageSendActionDispatcher.handle at line 36. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/services/image_send_action_dispatcher.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/presentation/services/image_send_action_dispatcher.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d82c9bd4bf06fea033ba9e7bba007096a24d57eb3249311ce121766bb587f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/providers/queue_execution_provider.dart: lib/presentation/providers/queue_execution_provider.dart changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in QueueExecutionNotifier._onGenerationStateChanged at line 584. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/providers/queue_execution_provider.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/presentation/providers/queue_execution_provider.dart"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"d904e6729186db951ba8960551c771cff927c0c438def1ecb1f30a44d95933f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/metadata/metadata_import_dialog.dart: lib/presentation/widgets/metadata/metadata_import_dialog.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in _MetadataImportDialogState._buildPromptSection at line 264. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/metadata/metadata_import_dialog.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/presentation/widgets/metadata/metadata_import_dialog.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ddc21489c5b507d392953320ddc6d54830423b92a34c19f5cc63adc54aeaf2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/agent_chat/widgets/agent_chat_panel_coordinator.dart: lib/presentation/agent_chat/widgets/agent_chat_panel_coordinator.dart changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in AgentChatPanelCoordinator._send at line 124. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/agent_chat/widgets/agent_chat_panel_coordinator.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/presentation/agent_chat/widgets/agent_chat_panel_coordinator.dart"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dce2b7672b5c135bd62d7ff736746def306e5e65aa26b44132385cf226db7d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/online_gallery/gallery_detail_info_panel.dart: lib/presentation/widgets/online_gallery/gallery_detail_info_panel.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in GalleryDetailInfoPanel.build at line 30. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/online_gallery/gallery_detail_info_panel.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/presentation/widgets/online_gallery/gallery_detail_info_panel.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b78db7b9bde75b174362a6422f1365a844073c7a5e69d81dd79beae56d7c5b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/data/models/metadata/metadata_import_options.dart: lib/data/models/metadata/metadata_import_options.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in MetadataImportOptions.selectedCountFor at line 166. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/models/metadata/metadata_import_options.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/data/models/metadata/metadata_import_options.dart"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"1236020c624033cdb1d1c3a0756bc314902988bfdefa3cc8f60fddc5f9ed8686"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/vibe_library/vibe_library_workspace.dart: lib/presentation/screens/vibe_library/vibe_library_workspace.dart changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in _Toolbar.build at line 286. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/vibe_library/vibe_library_workspace.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/presentation/screens/vibe_library/vibe_library_workspace.dart"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3b10500f73f7e09c6c57739704e452ae593309e7a01d8fe984842fdf0a37ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/settings/sections/generation_settings_section.dart: lib/presentation/screens/settings/sections/generation_settings_section.dart changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in _GenerationSettingsSectionState.build at line 115. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/settings/sections/generation_settings_section.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/presentation/screens/settings/sections/generation_settings_section.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1644a2da7792bb12af30805df2bcd5368bda84ec9e9f16c25f8b2f54375c084"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart: lib/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in AiTagGallerySourceAdapter._fetchList at line 178. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.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/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af37aa977652f59c4ce8842cc9b68594d24bdd38fbe53ca227f07e1107c0762"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/online_gallery/online_gallery_grid.dart: lib/presentation/screens/online_gallery/online_gallery_grid.dart changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in OnlineGalleryGrid.build at line 87. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/online_gallery/online_gallery_grid.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/presentation/screens/online_gallery/online_gallery_grid.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca04a0a7582ca173e0c0d2a825ad1cfe4fed6088d91b4b763362f574cda32077"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/prompt/prompt_weight_editing.dart: lib/presentation/widgets/prompt/prompt_weight_editing.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in PromptWeightEditing._resolveTarget at line 98. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/prompt_weight_editing.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/presentation/widgets/prompt/prompt_weight_editing.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a73db70a934778375f69717e212c478d06b7e986265155740d54a034569871"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/watermark/watermark_render_service.dart: lib/core/watermark/watermark_render_service.dart changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in WatermarkRenderService.render at line 107. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/watermark/watermark_render_service.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/core/watermark/watermark_render_service.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7a0d3b4dc607a17038d8c3da7c02f7c6d11024183afe97e3d45586c8dd0709"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/data/models/prompt_assistant/prompt_assistant_models.dart: lib/data/models/prompt_assistant/prompt_assistant_models.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in PromptAssistantConfigState._isUntouchedLegacyPollinationsDefault at line 1322. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/models/prompt_assistant/prompt_assistant_models.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/data/models/prompt_assistant/prompt_assistant_models.dart"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb57b3bec2103bfe1ca2e3f19f7eb586efc4d6a6d0349e8ad12ad86fb46aed11"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/queue/task_list_item.dart: lib/presentation/widgets/queue/task_list_item.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in _TaskListItemState.build at line 95. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/queue/task_list_item.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/presentation/widgets/queue/task_list_item.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"664c8d2283d2d105badecb4bf839469f938441b29e30470aeec82875e5f137dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/agent_chat/widgets/agent_chat_resource_widgets.dart: lib/presentation/agent_chat/widgets/agent_chat_resource_widgets.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in _AgentChatResourcePickerBodyState._buildLocalGallery at line 723. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/agent_chat/widgets/agent_chat_resource_widgets.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/presentation/agent_chat/widgets/agent_chat_resource_widgets.dart"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2465763af82f21927b6c609a935fbfcdee82b7f87a5c2459cc40dee1204061"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/settings/sections/storage_settings_section.dart: lib/presentation/screens/settings/sections/storage_settings_section.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in _StorageSettingsSectionState.build at line 176. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/settings/sections/storage_settings_section.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/presentation/screens/settings/sections/storage_settings_section.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4aa08ac6c75e80ddd4774bf82950052746f1e50a31d6ed343db54d4f857f23f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/autocomplete/completion_overlay.dart: lib/presentation/widgets/autocomplete/completion_overlay.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in CompletionOverlay.build at line 61. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/autocomplete/completion_overlay.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/presentation/widgets/autocomplete/completion_overlay.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b867aa4070840770fc923b8b15fbd9d8370be7d9b81ce5bd2bab5130e2c03144"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/common/image_detail/components/prompt_copy_dialog.dart: lib/presentation/widgets/common/image_detail/components/prompt_copy_dialog.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in _PromptCopyDialogState._buildExportOptions at line 264. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/common/image_detail/components/prompt_copy_dialog.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/presentation/widgets/common/image_detail/components/prompt_copy_dialog.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2944844768d2d7c08bbf85c28b163c1fd4a1f45f6a579fc5dd385a2daea5fdd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/common/image_card_actions.dart: lib/presentation/widgets/common/image_card_actions.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ImageCardActionCatalog.build at line 56. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/common/image_card_actions.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/presentation/widgets/common/image_card_actions.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ad77173120871726031b045f2c0a7b8fc108dafbdb2d138e05cea6110c1c32"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/autocomplete/completion_orchestrator.dart: lib/core/autocomplete/completion_orchestrator.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in CompletionOrchestrator.query at line 62. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/autocomplete/completion_orchestrator.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/core/autocomplete/completion_orchestrator.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef059ca50dbe72c0d3370bda9c68d3c6b7c92123bcdfcc73fd253c659c9b8368"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart: lib/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in _DriveFile.fromJson at line 894. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/cloud_sync/backend/google_drive_cloud_sync_backend.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/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d8faac2405a72b1f7d43472a6267822b87c40f7c92c76fc6f0c11744c98276"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/utils/dropped_file_reader.dart: lib/presentation/utils/dropped_file_reader.dart changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DroppedFileReader._resolve at line 95. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/utils/dropped_file_reader.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/presentation/utils/dropped_file_reader.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18d5fcf3cfc1ef6426eb3181f4c78b1bdfdcf28feac94024f5bf4c54d5059d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/data/services/metadata/image_metadata_container_codec.dart: lib/data/services/metadata/image_metadata_container_codec.dart changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ImageMetadataContainerCodec._scanValidatedPngChunks at line 356. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/services/metadata/image_metadata_container_codec.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/data/services/metadata/image_metadata_container_codec.dart"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ae57ece0eb2dea623e6c358a42bb15f162b7168f3bc51ed6714a77fd07c38a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/generation/mobile_generation_workspace.dart: lib/presentation/screens/generation/mobile_generation_workspace.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in MobileCollapsedPromptLauncher.build at line 225. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/generation/mobile_generation_workspace.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/presentation/screens/generation/mobile_generation_workspace.dart"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"188dabad123fff2ae049d63dbb5b6198c7c5554cc6e5624fe3f9372beb7ce302"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/data/services/gallery/gallery_stream_scanner.dart: lib/data/services/gallery/gallery_stream_scanner.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in GalleryStreamScanner._processSingleFile at line 463. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/services/gallery/gallery_stream_scanner.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/data/services/gallery/gallery_stream_scanner.dart"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b4bc5367257fadf820979b6da0337f7fea75abb342ae4fe28f3112345442fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/generation/mobile_generation_chrome.dart: lib/presentation/screens/generation/mobile_generation_chrome.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in _MobileGenerateButton.build at line 309. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/generation/mobile_generation_chrome.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/presentation/screens/generation/mobile_generation_chrome.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ad5a99ce2c02a5ed83931e451a57679187f1ea1c66df96a3183b859f8016ca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/utils/inpaint_mask/inpaint_mask_operations.dart: lib/core/utils/inpaint_mask/inpaint_mask_operations.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in InpaintMaskUtils.prepareNovelAiInpaintMaskArtifacts at line 755. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/utils/inpaint_mask/inpaint_mask_operations.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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"525fabc9176ac26889242c17423fb678a8a4c08aa9a921ec829648baf825b253"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/watermark/watermark_editor_controls.dart: lib/presentation/screens/watermark/watermark_editor_controls.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in WatermarkEditorControls.build at line 38. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/watermark/watermark_editor_controls.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/presentation/screens/watermark/watermark_editor_controls.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cab61b77111e87ce14d95807b48c0a95b4129c48508c0d2e3f7924a8609766"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/agent_chat/services/online_gallery_toolbox.dart: lib/presentation/agent_chat/services/online_gallery_toolbox.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in OnlineGalleryToolbox._executeBrowse at line 107. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/agent_chat/services/online_gallery_toolbox.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/presentation/agent_chat/services/online_gallery_toolbox.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"4473c2d8a928e005bb88edd5345f5554fc3a31f93dee1495cb653136f7f80e07"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/providers/random_preset_provider.dart: lib/presentation/providers/random_preset_provider.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in RandomPresetNotifier._loadPresets at line 115. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/providers/random_preset_provider.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/presentation/providers/random_preset_provider.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c976345fa3415f9999fe4e09557007c65ed1abbf557cc080ee716055a7cf35c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/tag_library_page/widgets/entry_list_item.dart: lib/presentation/screens/tag_library_page/widgets/entry_list_item.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _EntryListItemState.build 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/tag_library_page/widgets/entry_list_item.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/presentation/screens/tag_library_page/widgets/entry_list_item.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"01146f0e23bc00327b13f9b250b3f8d1ab2350e65b99f8718275d358c7aedbc0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/common/collapsible_image_panel.dart: lib/presentation/widgets/common/collapsible_image_panel.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in _CollapsibleImagePanelState.build at line 278. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/common/collapsible_image_panel.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/presentation/widgets/common/collapsible_image_panel.dart"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"609cd8a44fc3e9f959ad8bcfa041f464268db4fda4b3d0dd7f4c556a1d876b7c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/generation/widgets/img2img_upscale_section.dart: lib/presentation/screens/generation/widgets/img2img_upscale_section.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in _Img2ImgUpscaleSectionState.build at line 99. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/generation/widgets/img2img_upscale_section.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/presentation/screens/generation/widgets/img2img_upscale_section.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ff9b25c41df86377a702bd104ba455c2f7de988de43f9b6fd5830b6cd91ed9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/generation/widgets/precise_reference_panel.dart: lib/presentation/screens/generation/widgets/precise_reference_panel.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in _PreciseReferencePanelState.build at line 59. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/generation/widgets/precise_reference_panel.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/presentation/screens/generation/widgets/precise_reference_panel.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4840be74b36dc68aa2d61da1099a05aac3919662c7722b7e901be60eb08df916"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/discord_share/discord_share_dialog.dart: lib/presentation/widgets/discord_share/discord_share_dialog.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in _DiscordShareDialogState._send at line 343. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/discord_share/discord_share_dialog.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/presentation/widgets/discord_share/discord_share_dialog.dart"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b07817ff5a3288d04700affaf950ff6aad9165dceed26d865d11b0d796219e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/settings/widgets/data_source_cache_settings.dart: lib/presentation/screens/settings/widgets/data_source_cache_settings.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in _ZhDictionaryStatus.build at line 463. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/settings/widgets/data_source_cache_settings.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/presentation/screens/settings/widgets/data_source_cache_settings.dart"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"6123b78a2f91c2ab7c5de2080beebd74d500c5c89973b0787333a17036cb7e0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/online_gallery/online_gallery_scroll_prefetch_coordinator.dart: lib/presentation/screens/online_gallery/online_gallery_scroll_prefetch_coordinator.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in OnlineGalleryScrollPrefetchCoordinator._requestNextIfNeeded at line 177. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/online_gallery/online_gallery_scroll_prefetch_coordinator.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/presentation/screens/online_gallery/online_gallery_scroll_prefetch_coordinator.dart"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2f670c492b06ef47f24e9cdde25131878428ba2fe956feaf131e6184b59912"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_feature.dart: lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_feature.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in _OnlineGalleryToolbarPresenter._buildPrimaryActions at line 659. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_feature.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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_feature.dart"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa975110b6804d708bd5893339ab62af2e0aa746cbc5a2fbe84a14632034f35"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/data/services/local_onnx_model_service.dart: lib/data/services/local_onnx_model_service.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in LocalOnnxModelService._inferKind at line 597. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/services/local_onnx_model_service.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/data/services/local_onnx_model_service.dart"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"0359490978890001f4a51bdb1f186910cc6b3a55639957f80852f5f2aff89aee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/data/datasources/remote/nai_generation_response_processor.dart: lib/data/datasources/remote/nai_generation_response_processor.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in NaiGenerationResponseProcessor.processMessagePackStream at line 95. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/datasources/remote/nai_generation_response_processor.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/data/datasources/remote/nai_generation_response_processor.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d653643d95908df16caf04c25bd8d7bc76ded358fa021318881d8aa9627cd51c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/cloud_sync/snapshot_uploader.dart: lib/core/cloud_sync/snapshot_uploader.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ResumableSnapshotUploader.resume at line 33. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/cloud_sync/snapshot_uploader.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/core/cloud_sync/snapshot_uploader.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b03c930a3c248dc8bfd3108258dae5d5e4411ef96441a97b04f79bb1187fb1d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/settings/sections/web_access_settings.dart: lib/presentation/screens/settings/sections/web_access_settings.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in _WebAccessSettingsState.build at line 49. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/settings/sections/web_access_settings.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/presentation/screens/settings/sections/web_access_settings.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"975e22a8af47b48df5078e79ac64e6baebd89cc36ffadb5f40b6a8e19411f9a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/providers/gallery_category_provider.dart: lib/presentation/providers/gallery_category_provider.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in GalleryCategoryNotifier._moveCategoryToSlot at line 314. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/providers/gallery_category_provider.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/presentation/providers/gallery_category_provider.dart"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da4ae898617f75c6332e2f537780a4d9c5f4ed9fd1b592675aa547a2acc5d29"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/cloud_sync/backend/backend_http.dart: lib/core/cloud_sync/backend/backend_http.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in BackendHttp.request at line 40. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/cloud_sync/backend/backend_http.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/core/cloud_sync/backend/backend_http.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db83fc252d52838ebb9c40375da3da3a6a05d0e032ee8b2d85b63b763f83151"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/cloud_sync/backend/webdav_capability_probe.dart: lib/core/cloud_sync/backend/webdav_capability_probe.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in WebDavCapabilityProbe.run at line 32. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/cloud_sync/backend/webdav_capability_probe.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/core/cloud_sync/backend/webdav_capability_probe.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0deb78e182897790b19012251cf4d7509f10806464849325009a784567955de5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/online_gallery/online_gallery_selection_actions.dart: lib/presentation/screens/online_gallery/online_gallery_selection_actions.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in OnlineGallerySelectionActions._buildReplicationTask at line 100. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/online_gallery/online_gallery_selection_actions.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/presentation/screens/online_gallery/online_gallery_selection_actions.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e11eadef4d67c8efe89b106a6a8f58232566e97990c3f36009431d0040902f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/prompt/tag_editor_session.dart: lib/presentation/widgets/prompt/tag_editor_session.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in TagEditorSession.apply at line 330. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/tag_editor_session.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/presentation/widgets/prompt/tag_editor_session.dart"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"50aa0c88d430b97bb3938188c3600316574d6c3a74841d2679e2511ac13ebeb8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/generation/widgets/generation_controls/generate_button.dart: lib/presentation/screens/generation/widgets/generation_controls/generate_button.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in GenerateButtonWithCost._buildPrimaryButton at line 111. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/generation/widgets/generation_controls/generate_button.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/presentation/screens/generation/widgets/generation_controls/generate_button.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f039f69fc603b5563c27c6762c0d5223220f922cf7997b27af58a41ea0c74d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/common/compact_icon_button.dart: lib/presentation/widgets/common/compact_icon_button.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in CompactIconButton.build at line 37. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/common/compact_icon_button.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/presentation/widgets/common/compact_icon_button.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bab7768000b3635a4e18d3f4de455def334bd6547010e0963ff72fd647afa73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/data/models/agent/agent_settings.dart: lib/data/models/agent/agent_settings.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in AgentChatConfig.fromJson at line 220. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/models/agent/agent_settings.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/data/models/agent/agent_settings.dart"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f684ae37f0be0eb4e2847c68d26577466dac95e6dca015f62bbdcb2d98d4bf0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/vibe_library/widgets/vibe_detail/vibe_detail_param_panel.dart: lib/presentation/screens/vibe_library/widgets/vibe_detail/vibe_detail_param_panel.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in VibeDetailParamPanel._buildActionBar at line 400. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/vibe_library/widgets/vibe_detail/vibe_detail_param_panel.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/presentation/screens/vibe_library/widgets/vibe_detail/vibe_detail_param_panel.dart"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f7e7ab4c66d6c2a31fd59315b202afdfd2ea31f057cf37028ebb07c51694f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/services/generation_prompt_transfer_service.dart: lib/presentation/services/generation_prompt_transfer_service.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in GenerationPromptTransferService.replaceMainPrompt at line 192. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/services/generation_prompt_transfer_service.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/presentation/services/generation_prompt_transfer_service.dart"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc1542545b0812434ba5f66799cff454ca910c5e8a3d99cc778574d55971178"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/providers/krita/krita_bridge_notifier.dart: lib/presentation/providers/krita/krita_bridge_notifier.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in KritaBridgeNotifier.enable at line 207. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/providers/krita/krita_bridge_notifier.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/krita/krita_bridge_notifier.dart"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"42612e8e6f6c20c0e6483188f7d6a1e5966aab33b7dc28dffb196e030a861722"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/providers/online_gallery_blacklist_provider.dart: lib/presentation/providers/online_gallery_blacklist_provider.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in OnlineGalleryBlacklistNotifier.pushToCloud at line 418. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/providers/online_gallery_blacklist_provider.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/presentation/providers/online_gallery_blacklist_provider.dart"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab41b11babcfd53d53b709b742dc329a9465c1b9c87c65aa4ccc91919d39d4e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/providers/subscription_provider.dart: lib/presentation/providers/subscription_provider.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in SubscriptionNotifier.build at line 52. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/providers/subscription_provider.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/presentation/providers/subscription_provider.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0392960acb27e62de771a882ee95fec151c2999b193e6ec20b630b2fb0d2d595"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/autocomplete/prompt_token_parser.dart: lib/core/autocomplete/prompt_token_parser.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in PromptTokenParser.editChangesActiveToken at line 205. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/autocomplete/prompt_token_parser.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/core/autocomplete/prompt_token_parser.dart"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"1174fee04394dcb696f0b85d4eb825478c77e90bd1f018c63197cb83e6cad910"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/model3d_editor/model3d_editor_screen.dart: lib/presentation/widgets/model3d_editor/model3d_editor_screen.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in _Model3dEditorScreenState.build at line 389. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/model3d_editor/model3d_editor_screen.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/presentation/widgets/model3d_editor/model3d_editor_screen.dart"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b961f83007fabac7a9d4ba262c12495cb0b17ad2380ffe47d2026446d7fc71d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/image_editor/tools/fill_tool.dart: lib/presentation/widgets/image_editor/tools/fill_tool.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _FillRequest.floodFill at line 201. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/image_editor/tools/fill_tool.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/presentation/widgets/image_editor/tools/fill_tool.dart"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceec4c9f69b19ab84c3c18259a8139e18a2a20311175d14954f311ed38356ea2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/common/image_card_controller.dart: lib/presentation/widgets/common/image_card_controller.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in ImageCardController.update at line 68. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/common/image_card_controller.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/presentation/widgets/common/image_card_controller.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f15e6a6bfa5b5f0ce9e7e99750e04df2bbe56a2cee825996670220f2554b330"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/providers/generation/image_generation_service.dart: lib/presentation/providers/generation/image_generation_service.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ImageGenerationService._execute at line 133. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/providers/generation/image_generation_service.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/presentation/providers/generation/image_generation_service.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc40e3ac00a24791dd42c6041d1bc47797db1ae60250e607e15dee0653d7ac2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/utils/metadata_import_applier.dart: lib/presentation/utils/metadata_import_applier.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MetadataImportApplier.applyPromptAndGenerationParams at line 54. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/utils/metadata_import_applier.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/presentation/utils/metadata_import_applier.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"998c7b3d003a96a5deab83e99d88de28ae469828e71ebf19700af3be35d27168"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/settings/sections/agent/system_prompt_editor.dart: lib/presentation/screens/settings/sections/agent/system_prompt_editor.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in _AgentSystemPromptEditorState.build at line 54. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/settings/sections/agent/system_prompt_editor.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/presentation/screens/settings/sections/agent/system_prompt_editor.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5387b565e2466faf57275e1f85942d8a1926ab867a051d3120a5de9957a5a81c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/vibe_library/vibe_import_controller.dart: lib/presentation/screens/vibe_library/vibe_import_controller.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in VibeImportController.importDrop at line 150. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/vibe_library/vibe_import_controller.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/presentation/screens/vibe_library/vibe_import_controller.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f69d1f276278b72d98fd5fcb4240d37af75b028b26ed448d41c2cd46aeeadb6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/prompt/fixed_tags_dialog_view.dart: lib/presentation/widgets/prompt/fixed_tags_dialog_view.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in FixedTagsDialogView.build at line 26. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/fixed_tags_dialog_view.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/presentation/widgets/prompt/fixed_tags_dialog_view.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b736b2ef19b216c36f4dfa5393aa3376f853af8674ad022cbd9079e01ea413b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/utils/prompt_edit_document.dart: lib/core/utils/prompt_edit_document.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in PromptEditDocument._span at line 170. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/utils/prompt_edit_document.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/core/utils/prompt_edit_document.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37d9e70230e21194533cbfbb0cbab56dac35e2984a6d468e59e6e773bb2ca2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/cloud_sync/backend/onedrive_api_client.dart: lib/core/cloud_sync/backend/onedrive_api_client.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in OneDriveApiClient._decodeItem at line 520. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/cloud_sync/backend/onedrive_api_client.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/core/cloud_sync/backend/onedrive_api_client.dart"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"38205e747a8fbe7c6896945853b8ae31de7a5a1b33d8649b703a1584346ceb80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/data/models/gallery/nai_image_metadata_raw_decoder.dart: lib/data/models/gallery/nai_image_metadata_raw_decoder.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in NaiImageMetadataRawDecoder.decode at line 17. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/models/gallery/nai_image_metadata_raw_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/data/models/gallery/nai_image_metadata_raw_decoder.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aaf6804e1ee895b1c5086ac92d90b4a7854c44554cb45b285e0797235d5eb5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/prompt/nai_syntax_controller.dart: lib/presentation/widgets/prompt/nai_syntax_controller.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in NaiSyntaxController._applyComposingUnderline at line 183. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/nai_syntax_controller.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/presentation/widgets/prompt/nai_syntax_controller.dart"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"670c4c613e05616cfff538a2983440c55dbe0b3d06ca0fa031cf0ea889736f5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/online_gallery/online_gallery_pagination.dart: lib/presentation/screens/online_gallery/online_gallery_pagination.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in OnlineGalleryPagination._buildBar at line 35. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/online_gallery/online_gallery_pagination.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/presentation/screens/online_gallery/online_gallery_pagination.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c9237354daceb1f8d4c9051955de425b2f036579edbcd93e475d46f0e5dab7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/image_editor/controllers/magic_wand_controller.dart: lib/presentation/widgets/image_editor/controllers/magic_wand_controller.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in MagicWandController.apply at line 42. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/image_editor/controllers/magic_wand_controller.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/presentation/widgets/image_editor/controllers/magic_wand_controller.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e94e75ac01f85f321cfdb6314491df66bedf7be652536e4875d4225c6078fb8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/agent_chat/services/agent_tool_permission_controller.dart: lib/presentation/agent_chat/services/agent_tool_permission_controller.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in AgentToolPermissionController.beforeToolCall at line 49. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/agent_chat/services/agent_tool_permission_controller.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/presentation/agent_chat/services/agent_tool_permission_controller.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7a10d6f2347dd81404e1704a9592d8b297adf663ea096f7e383124bd98f5fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/database/datasources/gallery_album_repository.dart: lib/core/database/datasources/gallery_album_repository.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in SqliteGalleryAlbumRepository._moveAlbumToSlot at line 791. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/database/datasources/gallery_album_repository.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/core/database/datasources/gallery_album_repository.dart"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8f4376377897dd08cc020f6d1c554f3b7c865eb42e7dd938e12ff4e52fde65"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/prompt/unified/unified_prompt_config.dart: lib/presentation/widgets/prompt/unified/unified_prompt_config.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in UnifiedPromptConfig.== at line 227. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/unified/unified_prompt_config.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/presentation/widgets/prompt/unified/unified_prompt_config.dart"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"542aadf4101aee1987bdfc97e88c68874ce4396d630842950b7dba58b1c6923b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/cloud_sync/models.dart: lib/core/cloud_sync/models.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in SnapshotManifest.SnapshotManifest at line 128. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/cloud_sync/models.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/core/cloud_sync/models.dart"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bea388ac0aa40e3df5c103a26dbb30c2be81b394a9f8a800ce8a789ca652903"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/common/animated_favorite_button.dart: lib/presentation/widgets/common/animated_favorite_button.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in _FavoriteIconButtonState.build at line 162. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/common/animated_favorite_button.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/presentation/widgets/common/animated_favorite_button.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cefd03caf97d52e506a753f3f9a585ed6c066a928dc2786f00146720a0c1c8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/bulk_progress_dialog.dart: lib/presentation/widgets/bulk_progress_dialog.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in _BulkProgressDialogState.build 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/bulk_progress_dialog.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/presentation/widgets/bulk_progress_dialog.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"5549358c62c0ae8c0a9af84ebc9bc62130c187b6dbe45711f37d6bb22638d2a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/agent_chat/services/generation_queue_task_service.dart: lib/presentation/agent_chat/services/generation_queue_task_service.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in GenerationQueueTaskService.queueTask at line 20. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/agent_chat/services/generation_queue_task_service.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/presentation/agent_chat/services/generation_queue_task_service.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e855dcdb6f5f163df382371457a42ed5d3c06a4e8d699fb1ad6a921f7f4e174"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/agent/harness/session/jsonl/session_jsonl_codec.dart: lib/core/agent/harness/session/jsonl/session_jsonl_codec.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in SessionJsonlCodec.encode at line 8. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/agent/harness/session/jsonl/session_jsonl_codec.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/core/agent/harness/session/jsonl/session_jsonl_codec.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"938ed93ce37753fa8454c6f75ee4d5361ff743f545f37b310e758b36c5aeb802"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/autocomplete/cooccurrence_data_pack_service.dart: lib/core/autocomplete/cooccurrence_data_pack_service.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in CooccurrenceDataPackService._install at line 187. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/autocomplete/cooccurrence_data_pack_service.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/core/autocomplete/cooccurrence_data_pack_service.dart"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c4a9c2ab99c5885a054633526b4405c449c4fc7814afc7eece8a505e9e43bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/common/update_notice_banner.dart: lib/presentation/widgets/common/update_notice_banner.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in UpdateNoticeBanner.build at line 42. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/common/update_notice_banner.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/presentation/widgets/common/update_notice_banner.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3a23bc23e5493a131caf3e78021fe0e97c462cfe363c3a54c1f1e7f5d4a51c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_auth.dart: lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_auth.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in OnlineGalleryToolbarAuthControls._buildUserButton 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_auth.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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_auth.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae63699773f75f50de83377f705bfda9d0853a437ab59281b84b19900b6c03ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/statistics/widgets/charts/heatmap_chart.dart: lib/presentation/screens/statistics/widgets/charts/heatmap_chart.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in _HeatmapChartState.build at line 94. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/statistics/widgets/charts/heatmap_chart.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/presentation/screens/statistics/widgets/charts/heatmap_chart.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c29ab369a04eda4bd26514ce3709499c90677fd15fa759c047a793035e94eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/agent_chat/widgets/agent_chat_turn.dart: lib/presentation/agent_chat/widgets/agent_chat_turn.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in _AgentChatWorkTrailState.build at line 379. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/agent_chat/widgets/agent_chat_turn.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/presentation/agent_chat/widgets/agent_chat_turn.dart"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"420591a589cc7c0db169d41f9e949a368f1a6111972bf1415d558cdc474f0609"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/generation/auto_save_toggle_chip.dart: lib/presentation/widgets/generation/auto_save_toggle_chip.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in _AutoSaveToggleChipState.build at line 68. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/generation/auto_save_toggle_chip.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/presentation/widgets/generation/auto_save_toggle_chip.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cecb9acb5ce5278160d913d1a23f7095502c9a6a63c099d1dee25aa3c22d90"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/agent_chat/widgets/agent_chat_session_picker.dart: lib/presentation/agent_chat/widgets/agent_chat_session_picker.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in _AgentChatSessionPickerBodyState.build at line 232. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/agent_chat/widgets/agent_chat_session_picker.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/presentation/agent_chat/widgets/agent_chat_session_picker.dart"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"65eff43762614cfebbf98ae8a25194bfd091a09f1b9cab67da29e74e95392dfd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/settings/sections/comfyui_settings_section.dart: lib/presentation/screens/settings/sections/comfyui_settings_section.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in _ComfyUISettingsSectionState.build at line 37. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/settings/sections/comfyui_settings_section.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/presentation/screens/settings/sections/comfyui_settings_section.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"129bbfd3aa41b26e9d2b61e20bfa1690f0df8b8c2ec32998ee7fb2622495a8dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/bulk_action_bar.dart: lib/presentation/widgets/bulk_action_bar.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in _ActionButton.build at line 381. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/bulk_action_bar.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/presentation/widgets/bulk_action_bar.dart"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d492da23ae523c9397e99d386344cbb6773b7008a6f3a10e48896d9b59e341"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/online_gallery/online_gallery_card_status_overlays.dart: lib/presentation/widgets/online_gallery/online_gallery_card_status_overlays.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in OnlineGalleryCardLeftStatusOverlays.build at line 103. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/online_gallery/online_gallery_card_status_overlays.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/presentation/widgets/online_gallery/online_gallery_card_status_overlays.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"94290acbc7f4b15cbf08af8ebfd58b97b8b8c4ee2c3202167c19cde457006f41"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar.dart: lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in OnlineGalleryRatingDropdown.build at line 692. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar.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/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar.dart"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb235e089d868c38fe6210d98a4b9559376df75e9599e445c47252c74eae14ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/common/image_detail/components/detail_thumbnail_bar.dart: lib/presentation/widgets/common/image_detail/components/detail_thumbnail_bar.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in _ThumbnailItemState.build at line 106. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/common/image_detail/components/detail_thumbnail_bar.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/presentation/widgets/common/image_detail/components/detail_thumbnail_bar.dart"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52e270182cac6dc5d30081012f2b9f827b0e234077ea0c8fa383cf7c014dad9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/agent/harness/tools/read.dart: lib/core/agent/harness/tools/read.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ReadHarnessTool.executeWithContext at line 105. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/agent/harness/tools/read.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/core/agent/harness/tools/read.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e85eff285451dc0388c9909b5e47cf039509df7d97250bfedf54d44d0d2097"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/agent_chat/services/generation_settings_service.dart: lib/presentation/agent_chat/services/generation_settings_service.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in GenerationSettingsService.updateSettings at line 68. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/agent_chat/services/generation_settings_service.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/presentation/agent_chat/services/generation_settings_service.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc020a34de273d9aa4b86291d3fae5b4f11337bbcc8ffb37ae10346a8ff7e4a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/autocomplete/danbooru_completion_source.dart: lib/core/autocomplete/danbooru_completion_source.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in DanbooruCompletionSource.search at line 46. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/autocomplete/danbooru_completion_source.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/core/autocomplete/danbooru_completion_source.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6c5eb1cf87254a5abde75c8cab36834f701931dcfbd67707c022788ab0e1de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/agent/agent_profile_service.dart: lib/core/agent/agent_profile_service.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in AgentProfileService.previewImport at line 35. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/agent/agent_profile_service.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/core/agent/agent_profile_service.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"265be3ec07acb747cd4ec4c2f29b9a6b6daddf61095ecbc02c77d055aa300863"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/screens/statistics/widgets/dashboard/animated_refresh_button.dart: lib/presentation/screens/statistics/widgets/dashboard/animated_refresh_button.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in _AnimatedRefreshButtonState.build at line 54. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/statistics/widgets/dashboard/animated_refresh_button.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/presentation/screens/statistics/widgets/dashboard/animated_refresh_button.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb1ca98e8b6c3a0429746fed587fab0bfc14c21ebb90439a7acb0d0cd012236"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/agent_chat/services/generation_character_orchestration.dart: lib/presentation/agent_chat/services/generation_character_orchestration.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in GenerationCharacterOrchestrator.normalizeExplicit at line 38. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/agent_chat/services/generation_character_orchestration.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/presentation/agent_chat/services/generation_character_orchestration.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac827b19ce25e6f036f71b260226da50c09d4fbadcf1a3d9703ed440d0f6ff3e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/core/cloud_sync/backend/webdav_operation_inventory.dart: lib/core/cloud_sync/backend/webdav_operation_inventory.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in WebDavOperationInventory.findExisting at line 38. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/cloud_sync/backend/webdav_operation_inventory.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/core/cloud_sync/backend/webdav_operation_inventory.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bad90575602122470179f311522988871f18f64d3d409470d8c4c43e15b5f5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/data/datasources/remote/nai_auth_api_service.dart: lib/data/datasources/remote/nai_auth_api_service.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in NAIAuthApiService.validateToken at line 56. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/datasources/remote/nai_auth_api_service.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/data/datasources/remote/nai_auth_api_service.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"50138e06dbd30103bcf34ed8d2e9db976240a72e994e7a3cb980207edc3a1d1a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/providers/reverse_prompt_provider.dart: lib/presentation/providers/reverse_prompt_provider.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ReversePromptNotifier.runChain at line 368. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/providers/reverse_prompt_provider.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/presentation/providers/reverse_prompt_provider.dart"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"887a2fb7ada227c68bf07a7269135ea9ecf1e85036c495892316b6621c2706aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/drop/prompt_library_entry_dialog.dart: lib/presentation/widgets/drop/prompt_library_entry_dialog.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in _PromptLibraryEntryDialogState.build at line 208. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/drop/prompt_library_entry_dialog.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/presentation/widgets/drop/prompt_library_entry_dialog.dart"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7b97f07cc7f092042c95370e6a738815646ec05c9753ff8432e733b40e6b0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/widgets/common/elevated_card.dart: lib/presentation/widgets/common/elevated_card.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in _ElevatedCardState.build at line 112. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/common/elevated_card.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/presentation/widgets/common/elevated_card.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ba4d2d0788113301a21962cda45df279f3e8c43c784e61f206543dccb9f546"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/presentation/agent_chat/services/image_presentation_toolbox.dart: lib/presentation/agent_chat/services/image_presentation_toolbox.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in AgentImagePresentationService.present at line 40. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/agent_chat/services/image_presentation_toolbox.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/presentation/agent_chat/services/image_presentation_toolbox.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e307d150e94c0de8807da259249ed0acca806bdf6dcb4e4a8eee6d3ddcc0ff9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/data/datasources/remote/nai_generation_transport.dart: lib/data/datasources/remote/nai_generation_transport.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in NaiGenerationTransport.buildGenerationMultipart at line 154. 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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/datasources/remote/nai_generation_transport.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/data/datasources/remote/nai_generation_transport.dart"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"631cdca9100bdf24a895d4a22e60e903f7f32e353394002a70db365a4aa783f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/prompt/random_manager/tag_group_card.dart: lib/presentation/widgets/prompt/random_manager/tag_group_card.dart changed 20 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is _TagGroupCardState._buildCapabilityIndicators at line 216), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(prompt): \u6761\u4EF6\u5206\u652F\u53EF\u6307\u5B9A\u8F93\u51FA\u672C\u7C7B\u522B\u7684\u8BCD\u7EC4\u4E0E\u89E6\u53D1\u6761\u4EF6\u5E76\u771F\u6B63\u751F\u6548\u201D; \u201Cfix(prompt): \u6570\u91CF\u4E0E\u503C\u4F9D\u8D56\u5728\u6240\u6709\u9009\u62E9\u6A21\u5F0F\u4E0B\u51B3\u5B9A\u62BD\u53D6\u6570\u91CF\u201D; \u201Cfix(prompt): \u8BCD\u7EC4\u7F16\u8F91\u5F39\u7A97\u6062\u590D\u89E6\u5C4F\u6A2A\u6ED1\u5207\u6362\u6807\u7B7E\u9875\u201D; \u201Cfix(prompt): \u968F\u673A\u8BCD\u5E93\u786E\u8BA4\u5F39\u7A97\u3001\u9884\u8BBE\u6807\u9898\u4E0E\u9884\u89C8\u6807\u7B7E\u5728\u653E\u5927\u6587\u5B57\u4E0B\u4E0D\u6EA2\u51FA\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/random_manager/tag_group_card.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/presentation/widgets/prompt/random_manager/tag_group_card.dart"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e19841828460058d920e4d8e0820eb02bdafa04dcdeebb924923ed8044242f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/prompt/random_manager/add_tag_group_dialog.dart: lib/presentation/widgets/prompt/random_manager/add_tag_group_dialog.dart changed 17 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is _DanbooruListTileState.build at line 666), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ui): \u8868\u5355\u9875\u811A\u7EDF\u4E00\u7531 AdaptiveFormFooter \u5448\u73B0\uFF0C\u6309\u94AE\u8D34\u53F3\u4E0D\u518D\u7F29\u5230\u4E2D\u95F4\u201D; \u201Cfix(prompt): \u6DFB\u52A0\u8BCD\u7EC4\u3001\u65B0\u5EFA\u9884\u8BBE\u4E0E\u914D\u65B9\u641C\u7D22\u7684\u624B\u5199\u8F93\u5165\u6846\u6539\u7528\u5171\u4EAB\u8F93\u5165\u6846\u201D; \u201Cfix(prompt): \u6DFB\u52A0\u8BCD\u7EC4\u5F39\u7A97\u6539\u7528 ContentSizedAdaptiveForm\uFF0C\u9762\u677F\u9AD8\u5EA6\u968F\u5185\u5BB9\u6536\u7D27\u201D; \u201Cfix(prompt): \u968F\u673A\u8BCD\u5E93\u4E0E DIY \u9762\u677F\u7684\u6587\u5B57\u5B57\u53F7\u6539\u7528\u4E3B\u9898\u6392\u7248 token\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/random_manager/add_tag_group_dialog.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/presentation/widgets/prompt/random_manager/add_tag_group_dialog.dart"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"56236009998de20d403f1dbe2198a79fd0ebaa011ce573269278c0b59a676362"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/adaptive/adaptive_presenter.dart: lib/presentation/adaptive/adaptive_presenter.dart changed 16 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is AdaptivePresenter.showForm at line 24), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(prompt): \u6DFB\u52A0\u8BCD\u7EC4\u5F39\u7A97\u6536\u655B\u4E3A\u5355\u4E00\u7EB5\u5411\u6EDA\u52A8\u5BB9\u5668\u5E76\u4FDD\u7559\u5DE6\u53F3\u6ED1\u52A8\u6362\u6765\u6E90\u201D; \u201Cfix(adaptive): \u8F93\u5165\u4E0E\u65B0\u5EFA\u9884\u8BBE\u5F39\u7A97\u5728\u77ED\u6A2A\u5C4F\u3001\u952E\u76D8\u4E0E\u653E\u5927\u6587\u5B57\u4E0B\u4E0D\u518D\u6EA2\u51FA\u201D; \u201Cfix(dialog): \u4FDD\u6301\u952E\u76D8\u4E0A\u65B9\u786E\u8BA4\u5F39\u7A97\u7D27\u51D1\u201D; \u201Cfix(ui): \u4FEE\u590D\u77ED\u8868\u5355\u5F39\u7A97\u5F02\u5E38\u6491\u9AD8\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/adaptive/adaptive_presenter.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/presentation/adaptive/adaptive_presenter.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb393d591de2f61cddb25a2353c375cd0158498bc62e797abc41054b2751e68"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/screens/online_gallery/online_gallery_detail_launcher.dart: lib/presentation/screens/online_gallery/online_gallery_detail_launcher.dart changed 17 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is OnlineGalleryDetailLauncher.show at line 51), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(prompt): \u81EA\u52A8\u683C\u5F0F\u5316\u9075\u5FAA\u7A7A\u683C\u504F\u597D\u5E76\u6309\u5B98\u7F51\u89C4\u5219\u4FDD\u62A4\u5F15\u53F7\u6587\u5B57\u201D; \u201Cfix(online-gallery): \u6279\u91CF\u4E0E\u8BE6\u60C5\u64CD\u4F5C\u5728 await \u524D\u53D6\u5F97\u7A33\u5B9A\u53E5\u67C4\u201D; \u201Cfix(toast): \u6309\u63D0\u793A\u7C7B\u578B\u56FA\u5B9A\u8BED\u4E49\u914D\u8272\u5E76\u4FEE\u6B63\u6587\u751F\u56FE\u53CD\u9988\u201D; \u201Cfix(dialog): \u7EDF\u4E00\u684C\u9762\u5F39\u7A97\u5C3A\u5BF8\u4E0E\u5185\u5BB9\u9AD8\u5EA6 (#234)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/online_gallery/online_gallery_detail_launcher.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/presentation/screens/online_gallery/online_gallery_detail_launcher.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1482b608cec86cbc885af98f00d321eca96cc1a23259a4c83c87601ae422d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/screens/cloud_sync/cloud_sync_setup.dart: lib/presentation/screens/cloud_sync/cloud_sync_setup.dart changed 17 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is _CloudSyncSetupState._run at line 75), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cloud-sync): \u4FEE\u590D\u5207\u6362\u7A97\u53E3\u540E\u5907\u4EFD\u8BBE\u7F6E\u8868\u5355\u88AB\u6E05\u7A7A (#361)\u201D; \u201Cfix(cloud-sync): \u660E\u786E\u63D0\u793A OAuth \u6388\u6743\u5931\u8D25\u201D; \u201Cfix(cloud-sync): \u7CBE\u7B80\u5907\u4EFD\u9009\u62E9\u754C\u9762\u5C42\u7EA7\u201D; \u201Cfix(cloud-sync): \u79FB\u9664\u56FE\u50CF\u4E0E\u5927\u6587\u4EF6\u5907\u4EFD (#227)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/cloud_sync/cloud_sync_setup.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/presentation/screens/cloud_sync/cloud_sync_setup.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b24b2da590e1d7ce0599fc9fcebf62ffc2fcb9b8abad7969d8e68a31b4adcca"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/screens/generation/widgets/sidebar_entry_tile.dart: lib/presentation/screens/generation/widgets/sidebar_entry_tile.dart changed 16 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is _SidebarEntryTileState.build at line 110), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(generation): \u56FA\u5B9A\u8BCD\u6761\u76EE\u9996\u6B21\u89E6\u5C4F\u70B9\u64CD\u4F5C\u6309\u94AE\u4E0D\u518D\u8BEF\u5207\u6362\u542F\u7528\u201D; \u201Cfix(generation): \u4FEE\u590D\u56FA\u5B9A\u8BCD\u4FA7\u680F\u7A84\u5BBD\u4E0E\u89E6\u5C4F\u4E0B\u7684\u6EA2\u51FA\u201D; \u201Cfix(prompt): \u589E\u5F3A\u56FA\u5B9A\u8BCD\u9009\u4E2D\u72B6\u6001\u4E0E\u6587\u5B57\u5BF9\u6BD4\u5EA6 (#268)\u201D; \u201Crefactor(fixed-tags): \u4FA7\u680F\u6761\u76EE\u4E0D\u518D\u6E32\u67D3\u6807\u7B7E\u8BD1\u6587\u5E76\u6536\u7D27\u7F51\u683C\u5361\u7247\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/generation/widgets/sidebar_entry_tile.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/presentation/screens/generation/widgets/sidebar_entry_tile.dart"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8e59a3fbaa2736de29856f543f7ea3023b9b8cea6061fa370e4707cf0f9913"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/agent_chat/widgets/agent_chat_panel_controller.dart: lib/presentation/agent_chat/widgets/agent_chat_panel_controller.dart changed 13 times in last 90 days and 8 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 AgentChatPanelController.scrollToBottom at line 815), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(agent-chat): \u5217\u8868\u81EA\u8EAB\u4FEE\u6B63\u4F4D\u7F6E\u65F6\u4E0D\u518D\u91CD\u590D\u8865\u507F\uFF0C\u6309\u4F4F\u6216\u62D6\u52A8\u65F6\u5185\u5BB9\u4E0D\u88AB\u9876\u8D70\u201D; \u201Cfix(agent-chat): \u6B63\u6587\u5220\u6389\u5F15\u7528\u7684\u56FE\u7247\u9644\u4EF6\u4ECD\u968F\u6D88\u606F\u53D1\u9001\uFF0C\u79FB\u9664\u9644\u4EF6\u540E\u4FEE\u6B63\u5149\u6807\u201D; \u201Cfix(agent-chat): \u6D41\u5F0F\u8F93\u51FA\u65F6\u6EDA\u52A8\u8303\u56F4\u4E0D\u518D\u8DF3\u53D8\uFF0C\u6682\u505C\u9605\u8BFB\u540C\u5E27\u8865\u507F\u6F02\u79FB\u201D; \u201CAdd agent slash commands and fix context menu, third-party login, and IME rendering (#192)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/agent_chat/widgets/agent_chat_panel_controller.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/presentation/agent_chat/widgets/agent_chat_panel_controller.dart"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0584ab90691b3429c57fb130320e08d8731fb39df278de25d80aca594a7813"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/prompt/diy/panels/dependency_config_panel.dart: lib/presentation/widgets/prompt/diy/panels/dependency_config_panel.dart changed 13 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is _DependencyConfigPanelState._buildTypeOptions at line 191), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(prompt): DIY \u8868\u5355\u4E0D\u518D\u5728\u9762\u677F\u9996\u884C\u91CD\u590D\u8868\u5355\u6807\u9898\u201D; \u201Cfix(prompt): \u6570\u91CF\u4E0E\u503C\u4F9D\u8D56\u5728\u6240\u6709\u9009\u62E9\u6A21\u5F0F\u4E0B\u51B3\u5B9A\u62BD\u53D6\u6570\u91CF\u201D; \u201Cfix(prompt): \u4F9D\u8D56\u6309\u6E90\u6C42\u503C\uFF0C\u89D2\u8272\u6570\u91CF\u6E90\u53EF\u7528\u4E8E\u5B58\u5728\u4E0E\u6392\u65A5\u4F9D\u8D56\u201D; \u201Cfix(prompt): DIY \u914D\u7F6E\u8868\u5355\u5728\u7A84\u5C4F\u4E0E\u653E\u5927\u6587\u5B57\u4E0B\u4E0D\u6EA2\u51FA\u4E14\u89C4\u5219\u53EF\u7F16\u8F91\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/diy/panels/dependency_config_panel.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/presentation/widgets/prompt/diy/panels/dependency_config_panel.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f82e1fcfa1aa4eb38cc220c1689f97f2325755fa26118499aefd327903f9c2f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/common/weight_adjust_toolbar.dart: lib/presentation/widgets/common/weight_adjust_toolbar.dart changed 12 times in last 90 days and 7 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 _WeightAdjustToolbarWrapperState._syncToolbarWithControllerSelection at line 150), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(prompt): \u6309\u4F4F\u9F20\u6807\u62D6\u9009\u65F6\u6EDA\u8F6E\u53EA\u6EDA\u52A8\u63D0\u793A\u8BCD\uFF0C\u4E0D\u518D\u8C03\u6574\u6743\u91CD\u201D; \u201Cfix(prompt): \u6EDA\u8F6E\u8C03\u6743\u91CD\u6539\u5199\u9009\u533A\u6240\u5728\u7684\u5DF2\u6709\u6743\u91CD\uFF0C\u6743\u91CD\u6570\u5B57\u53BB\u6389\u672B\u5C3E\u7684\u96F6\u201D; \u201Cfix(prompt): \u4FEE\u590D\u7D27\u51D1\u5E03\u5C40\u6EA2\u51FA\u4E0E\u5DE5\u5177\u680F\u5EF6\u65F6\u6E05\u7406\u201D; \u201Cfix(prompt): \u8865\u9F50\u6587\u672C\u6A21\u5F0F\u6279\u91CF\u7981\u7528\u4E0E\u542F\u7528\u5165\u53E3\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/common/weight_adjust_toolbar.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/presentation/widgets/common/weight_adjust_toolbar.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f470f5af65505cbe7f1af0995cb9a7b81341c23a8071ef153af50d129d4799c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/prompt/diy/panels/post_process_rule_panel.dart: lib/presentation/widgets/prompt/diy/panels/post_process_rule_panel.dart changed 11 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is _PostProcessRulePanelState.build at line 82), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(prompt): DIY \u8868\u5355\u4E0D\u518D\u5728\u9762\u677F\u9996\u884C\u91CD\u590D\u8868\u5355\u6807\u9898\u201D; \u201Cfix(prompt): \u5206\u652F\u6761\u4EF6\u4E0E\u9884\u8BBE\u540E\u5904\u7406\u89C4\u5219\u6309\u952E\u540D\u627E\u7C7B\u522B\u65F6\u590D\u7528\u7C7B\u522B\u5F15\u7528\u89E3\u6790\u201D; \u201Cfix(prompt): \u89C4\u5219\u4E0E\u5206\u652F\u5217\u8868\u9762\u677F\u5171\u7528\u589E\u5220\u9009\u4E2D\u903B\u8F91\uFF0C\u9009\u4E2D\u7B56\u7565\u4FDD\u6301\u4E00\u81F4\u201D; \u201Cfix(prompt): \u540E\u5904\u7406\u9884\u8BBE\u6309\u952E\u540D\u6307\u5411\u771F\u5B9E\u7C7B\u522B\uFF0C\u8BCD\u7EC4\u540E\u5904\u7406\u4F5C\u7528\u4E8E\u6574\u8F6E\u7ED3\u679C\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/diy/panels/post_process_rule_panel.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/presentation/widgets/prompt/diy/panels/post_process_rule_panel.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1fe113a095c42072375d16996fc7bf8db02ade2f7bb23eafbb5041c5f44fc3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/prompt/diy/panels/conditional_branch_panel.dart: lib/presentation/widgets/prompt/diy/panels/conditional_branch_panel.dart changed 10 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is _ConditionalBranchPanelState.build at line 111), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(prompt): DIY \u8868\u5355\u4E0D\u518D\u5728\u9762\u677F\u9996\u884C\u91CD\u590D\u8868\u5355\u6807\u9898\u201D; \u201Cfix(prompt): \u89C4\u5219\u4E0E\u5206\u652F\u5217\u8868\u9762\u677F\u5171\u7528\u589E\u5220\u9009\u4E2D\u903B\u8F91\uFF0C\u9009\u4E2D\u7B56\u7565\u4FDD\u6301\u4E00\u81F4\u201D; \u201Cfix(prompt): \u968F\u673A\u8BCD\u5E93\u4E0E DIY \u9762\u677F\u7684\u6587\u5B57\u5B57\u53F7\u6539\u7528\u4E3B\u9898\u6392\u7248 token\u201D; \u201Cfix(prompt): \u6761\u4EF6\u5206\u652F\u53EF\u6307\u5B9A\u8F93\u51FA\u672C\u7C7B\u522B\u7684\u8BCD\u7EC4\u4E0E\u89E6\u53D1\u6761\u4EF6\u5E76\u771F\u6B63\u751F\u6548\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/diy/panels/conditional_branch_panel.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/presentation/widgets/prompt/diy/panels/conditional_branch_panel.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bd9349a90422e43ea82a3b6227f382e3156cfaaf687e30b8489e4e56db02d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/prompt/tag_mode_prompt_field.dart: lib/presentation/widgets/prompt/tag_mode_prompt_field.dart changed 9 times in last 90 days and 7 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 _TagModePromptFieldState.build at line 123), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(prompt): \u8865\u9F50\u6587\u672C\u6A21\u5F0F\u6279\u91CF\u7981\u7528\u4E0E\u542F\u7528\u5165\u53E3\u201D; \u201Cfix(prompt): \u6309\u5F53\u524D\u7F16\u8F91\u6A21\u5F0F\u6062\u590D\u5185\u5BB9\u81EA\u52A8\u9AD8\u5EA6\u201D; \u201Cfix(prompt): \u9694\u79BB\u8F93\u5165\u6846\u6807\u7B7E\u6A21\u5F0F\u5E76\u7EDF\u4E00\u5171\u4EAB\u63A7\u4EF6\u201D; \u201Cfix(prompt): \u8BA9\u6A21\u5F0F\u5207\u6362\u6309\u94AE\u8DDF\u968F\u7F16\u8F91\u533A\u53EF\u89C1\u8303\u56F4\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/tag_mode_prompt_field.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/presentation/widgets/prompt/tag_mode_prompt_field.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"054fe3427e8b479a9f50d7b5bcd9cd5cb45065b73b22f0a4eeeaa7e3bff5d8c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/agent_settings/providers/agent_settings_provider.dart: lib/presentation/agent_settings/providers/agent_settings_provider.dart changed 11 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 12 (its worst body is AgentSettingsNotifier._removeLegacyAgentFields at line 189), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(providers): \u5F02\u6B65\u521D\u59CB\u5316\u63A8\u8FDF\u5230 build \u8FD4\u56DE\u4E4B\u540E\u201D; \u201Cfix(logging): \u672C\u5730\u5B58\u50A8\u635F\u574F\u65F6\u65E5\u5FD7\u4E0E\u5F02\u5E38\u4E0D\u518D\u5E26\u51FA\u63D0\u793A\u8BCD\u201D; \u201Cfix(agent): \u5206\u79BB\u7CFB\u7EDF\u63D0\u793A\u8BCD\u6B63\u6587\u4E0E\u81EA\u52A8\u4E0A\u4E0B\u6587\u201D; \u201CAdd agent slash commands and fix context menu, third-party login, and IME rendering (#192)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/agent_settings/providers/agent_settings_provider.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/presentation/agent_settings/providers/agent_settings_provider.dart"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"677f7f8d2338f04a34f39aeaf5c70d0cadc093fbd4dc239483858ded347b74eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/character/character_prompt_button.dart: lib/presentation/widgets/character/character_prompt_button.dart changed 11 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 9 (its worst body is CharacterPromptButton.build at line 46), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(menu): \u5F39\u51FA\u83DC\u5355\u9879\u7EDF\u4E00\u6539\u7528 MenuActionLabel\uFF0C\u957F\u6587\u6848\u4E0E\u5927\u5B57\u53F7\u4E0B\u6362\u884C\u201D; \u201Cfix(ui): \u4FEE\u590D\u4E0D\u900F\u660E\u5E95\u8272\u906E\u6321\u6309\u538B\u4E0E\u60AC\u505C\u53CD\u9988 (#344)\u201D; \u201Cfix(prompt): \u4FEE\u590D\u52A9\u624B\u6267\u884C\u53CD\u9988\u4E0E\u63D0\u793A\u8BCD\u63A7\u4EF6\u4EA4\u4E92\u201D; \u201Cfix(prompt): \u9632\u6B62\u89D2\u8272\u6570\u91CF\u5FBD\u7AE0\u88AB\u88C1\u5207\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/character/character_prompt_button.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/presentation/widgets/character/character_prompt_button.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8577aff2755d8cd0f3aaccd2f81c009953255392a64735b6b81ce27ea02d1da0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/data/services/dlss/dlss_worker.dart: lib/data/services/dlss/dlss_worker.dart changed 11 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 13 (its worst body is DlssWorker.run at line 40), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(image): \u5E26 EXIF \u65B9\u5411\u7684 WebP \u4E0E JPEG \u540C\u6837\u6309\u8F6C\u6B63\u540E\u50CF\u7D20\u5904\u7406\u201D; \u201Cfix(image): \u91CD\u7F16\u7801\u540E\u590D\u5236\u7684 EXIF \u65B9\u5411\u7F6E\u4E3A 1\uFF0C\u907F\u514D\u67E5\u770B\u5668\u4E8C\u6B21\u65CB\u8F6C\u201D; \u201Cfix(image): EXIF \u65CB\u8F6C\u7684 JPEG \u6309\u89E3\u7801\u540E\u7684\u50CF\u7D20\u5C3A\u5BF8\u53C2\u4E0E\u5BFC\u5165\u3001\u7F16\u8F91\u4E0E\u653E\u5927\u201D; \u201Cfix(dlss): \u5220\u9664\u591A\u6B21\u53E0\u52A0\u5E76\u7EDF\u4E00\u5355\u6B21 NR \u5904\u7406\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/services/dlss/dlss_worker.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/data/services/dlss/dlss_worker.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5329bb6392a2c1db3dc23b551d2c7a94fd580e8f9b3708d254b747681d1ebab5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/agent_chat/services/agent_resource_resolver.dart: lib/presentation/agent_chat/services/agent_resource_resolver.dart changed 11 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 15 (its worst body is AgentResourceResolver.exists at line 112), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(agent): QuickTagCloud \u4F5C\u54C1\u5F15\u7528\u6539\u7528\u53EF\u9006\u7F16\u7801\u7684\u4E0D\u900F\u660E id\u201D; \u201Cfix(agent): \u65E0\u56FE\u8BCD\u6761\u7684\u5360\u4F4D\u5C01\u9762\u540C\u6837\u4E0D\u4F5C\u4E3A\u5A92\u4F53 id \u66B4\u9732\u201D; \u201Cfix(agent): \u5728\u7EBF\u753B\u5ECA\u5F15\u7528\u4E0D\u518D\u66B4\u9732 AI TAG \u5217\u8868\u5360\u4F4D\u5A92\u4F53 id\u201D; \u201Cfix(agent): \u660E\u786E\u53C2\u8003\u56FE\u8D44\u6E90\u53C2\u6570\u5E76\u8865\u9F50\u8131\u654F\u6743\u9650\u8BCA\u65AD (#303)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/agent_chat/services/agent_resource_resolver.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/presentation/agent_chat/services/agent_resource_resolver.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf3da04a871cb1f5b759c141835998bfff15a4a427cfe32a66127484daab123"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/tag_library/tag_library_entry_hover_preview.dart: lib/presentation/widgets/tag_library/tag_library_entry_hover_preview.dart changed 11 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 9 (its worst body is _TagLibraryEntryHoverPreviewState.didUpdateWidget at line 62), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(preview): \u5EF6\u8FDF\u663E\u793A\u53EF\u6EDA\u52A8\u60AC\u6D6E\u9884\u89C8\u201D; \u201Cfix(ui): \u7EDF\u4E00\u5361\u7247\u5206\u7EC4\u4E0E\u60AC\u6D6E\u9884\u89C8\u5C42\u7EA7 (#243)\u201D; \u201Cfix(prompt): \u652F\u6301\u6EDA\u52A8\u67E5\u770B\u957F\u60AC\u6D6E\u9884\u89C8\u201D; \u201Cfix(tags): \u8865\u5168\u8BCD\u5E93\u60AC\u6D6E\u7FFB\u8BD1\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/tag_library/tag_library_entry_hover_preview.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/presentation/widgets/tag_library/tag_library_entry_hover_preview.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"05617e1cf4aeba07cd623d20f54a85859b7ef8c8b58c5f52da0e4e8a857d30f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/common/themed_input.dart: lib/presentation/widgets/common/themed_input.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 15 (its worst body is _ThemedInputState.build at line 291), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ui): \u5171\u4EAB\u8F93\u5165\u6846\u7684\u6E05\u7A7A\u6309\u94AE\u6309\u4EA4\u4E92\u7B56\u7565\u53D6\u8DB3\u547D\u4E2D\u533A\uFF0C\u5355\u884C\u65F6\u4E0D\u76D6\u4F4F\u6587\u5B57\u201D; \u201Cfix(ui): \u5171\u4EAB\u8F93\u5165\u6846\u5207\u6362\u63A7\u5236\u5668\u6216\u4E4B\u540E\u5F00\u542F\u6E05\u7A7A\u6309\u94AE\u65F6\u6B63\u786E\u76D1\u542C\u4E0E\u91CA\u653E\u201D; \u201Cfix(ui): \u5171\u4EAB\u8868\u5355\u8F93\u5165\u6846\u6539\u4E3A\u7531 ThemedInput \u5448\u73B0\uFF0C\u8865\u4E0A\u4E3B\u9898\u53F3\u952E\u83DC\u5355\u4E0E Ctrl\u002BY\u201D; \u201Cfix(ui): \u5171\u4EAB\u8F93\u5165\u6846\u7684\u5E2E\u52A9\u4E0E\u9519\u8BEF\u6587\u5B57\u7EDF\u4E00\u6392\u5728\u8F93\u5165\u6846\u4E0B\u65B9\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/common/themed_input.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/presentation/widgets/common/themed_input.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafe9817562bda3cc84a511ee5008d438cfc823b41aa13e7c334624d45f829ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/prompt/fixed_tag_entry_tile.dart: lib/presentation/widgets/prompt/fixed_tag_entry_tile.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 12 (its worst body is _FixedTagEntryTileState.build at line 43), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(prompt): \u589E\u5F3A\u56FA\u5B9A\u8BCD\u9009\u4E2D\u72B6\u6001\u4E0E\u6587\u5B57\u5BF9\u6BD4\u5EA6 (#268)\u201D; \u201Crefactor(fixed-tags): \u4FA7\u680F\u6761\u76EE\u6539\u7528\u5E38\u9A7B\u884C\u5185\u64CD\u4F5C\u201D; \u201Cfix(fixed-tags): \u5C45\u4E2D\u79FB\u52A8\u7AEF\u524D\u540E\u7F00\u6807\u8BC6\u201D; \u201Cfix(fixed-tags): \u5F3A\u5316\u6761\u76EE\u5C42\u7EA7\u5E76\u79FB\u9664\u53CC\u5C42\u60AC\u6D6E\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/fixed_tag_entry_tile.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/presentation/widgets/prompt/fixed_tag_entry_tile.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a31a9ea8e3029266bfe57b368a4386a9997119025ae8bc4f741e622352d523"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/prompt/random_manager/tag_group_edit_dialog.dart: lib/presentation/widgets/prompt/random_manager/tag_group_edit_dialog.dart changed 9 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 6 (its worst body is _TagGroupEditDialogState._buildDiyPanel at line 412), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ui): \u8868\u5355\u9875\u811A\u7EDF\u4E00\u7531 AdaptiveFormFooter \u5448\u73B0\uFF0C\u6309\u94AE\u8D34\u53F3\u4E0D\u518D\u7F29\u5230\u4E2D\u95F4\u201D; \u201Cfix(prompt): \u7F16\u8F91\u5668\u6253\u5F00\u65F6\u5206\u652F\u6761\u4EF6\u7684\u5B58\u91CF\u952E\u4E0E\u751F\u6210\u65F6\u540C\u6837\u89E3\u6790\u4E3A ID\u201D; \u201Cfix(prompt): DIY \u8868\u5355\u4E0D\u518D\u5728\u9762\u677F\u9996\u884C\u91CD\u590D\u8868\u5355\u6807\u9898\u201D; \u201Cfix(prompt): \u8BCD\u7EC4\u7F16\u8F91\u9762\u677F\u7684\u6807\u7B7E\u680F\u6539\u7528\u5171\u4EAB\u7684\u81EA\u9002\u5E94\u56FA\u5B9A\u6807\u9898\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/random_manager/tag_group_edit_dialog.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/presentation/widgets/prompt/random_manager/tag_group_edit_dialog.dart"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7731fd14f4b612a2d8d28a90608a45210ee882181ff1cf54d029706da737f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/data/services/random_preset_rules.dart: lib/data/services/random_preset_rules.dart changed 8 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 7 (its worst body is RandomPresetRules.isGroupEligible at line 71), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(prompt): \u4F9D\u8D56\u6307\u5B9A\u7684\u53D8\u91CF\u6E90\u4E0E\u7C7B\u522B\u6E90\u7ECF\u540C\u4E00\u5165\u53E3\u5339\u914D\u6620\u5C04\u201D; \u201Cfix(prompt): \u5206\u652F\u6761\u4EF6\u91CC\u6309\u952E\u540D\u6216\u540D\u79F0\u4FDD\u5B58\u7684\u5B58\u91CF\u53D8\u91CF\u7EDF\u4E00\u89E3\u6790\u4E3A ID\u201D; \u201Cfix(prompt): \u6761\u4EF6\u5206\u652F\u53EF\u6307\u5B9A\u8F93\u51FA\u672C\u7C7B\u522B\u7684\u8BCD\u7EC4\u4E0E\u89E6\u53D1\u6761\u4EF6\u5E76\u771F\u6B63\u751F\u6548\u201D; \u201Cfix(prompt): \u5B50\u8BCD\u7EC4\u751F\u6210\u65F6\u6C42\u503C\u65F6\u95F4\u3001\u53EF\u89C1\u6027\u3001\u4F9D\u8D56\u4E0E\u6027\u522B\u9650\u5B9A\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/services/random_preset_rules.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/data/services/random_preset_rules.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"116fd6835d506ad72139471bae4f9c695818959796770600b897039b95a08734"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/adaptive/content_sized_adaptive_form.dart: lib/presentation/adaptive/content_sized_adaptive_form.dart changed 7 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 7 (its worst body is _HostedHeaderFormState._buildForm at line 183), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(adaptive): \u8868\u5355\u9875\u811A\u56FA\u5B9A\u65F6\u4E0E\u968F\u6B63\u6587\u6EDA\u52A8\u65F6\u4E00\u6837\u5360\u6EE1\u8868\u5355\u5BBD\u5EA6\u201D; \u201Cfix(adaptive): \u6B63\u6587\u672A\u6258\u7BA1\u9762\u677F\u6807\u9898\u65F6\u5728\u8C03\u8BD5\u6784\u5EFA\u4E2D\u62A5\u9519\u201D; \u201Cfix(adaptive): \u8868\u5355\u6807\u9898\u680F\u4E0E\u5E95\u90E8\u64CD\u4F5C\u6309\u540C\u4E00\u6761\u5B9E\u6D4B\u89C4\u5219\u56FA\u5B9A\u6216\u968F\u6B63\u6587\u6EDA\u52A8\u201D; \u201Cfix(prompt): \u6DFB\u52A0\u8BCD\u7EC4\u5F39\u7A97\u6536\u655B\u4E3A\u5355\u4E00\u7EB5\u5411\u6EDA\u52A8\u5BB9\u5668\u5E76\u4FDD\u7559\u5DE6\u53F3\u6ED1\u52A8\u6362\u6765\u6E90\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/adaptive/content_sized_adaptive_form.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/presentation/adaptive/content_sized_adaptive_form.dart"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d049ddad16e7cc4a33ef36b74e97f88c24f64eebda96f0509e70acc80c475f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/utils/nai_resolution_adapter.dart: lib/core/utils/nai_resolution_adapter.dart changed 7 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 10 (its worst body is NaiResolutionAdapter.findOfficialImportResolution at line 100), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(image): \u5E26 EXIF \u65B9\u5411\u7684 WebP \u4E0E JPEG \u540C\u6837\u6309\u8F6C\u6B63\u540E\u50CF\u7D20\u5904\u7406\u201D; \u201Cfix(image): \u65B9\u5411\u975E 1 \u7684 JPEG \u53D1\u9001\u524D\u8F6C\u6B63\u4E3A PNG\uFF0C\u4E0E\u5B98\u7F51\u8BF7\u6C42\u4E00\u81F4\u201D; \u201Cfix(image): EXIF \u65CB\u8F6C\u7684 JPEG \u6309\u89E3\u7801\u540E\u7684\u50CF\u7D20\u5C3A\u5BF8\u53C2\u4E0E\u5BFC\u5165\u3001\u7F16\u8F91\u4E0E\u653E\u5927\u201D; \u201Cfix(generation): \u5BFC\u5165\u5C3A\u5BF8\u4FDD\u7559\u539F\u56FE\u5E76\u8BA9\u805A\u7126\u91CD\u7ED8\u8DDF\u968F\u6E90\u56FE\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/utils/nai_resolution_adapter.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/core/utils/nai_resolution_adapter.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b80597e21715e8e34475c7a93124ac799ac674c86ad7c36aaed88eb5faf4f3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/providers/update_provider.dart: lib/presentation/providers/update_provider.dart changed 9 times in last 90 days and 5 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 UpdateStateNotifier.initialize at line 121), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(update): \u7A0D\u540E\u63D0\u9192\u540E\u91CD\u65B0\u663E\u793A\u66F4\u65B0\u63D0\u793A\u65F6\u4FDD\u7559\u5931\u8D25\u539F\u56E0\u201D; \u201Cfix(update): \u66F4\u65B0\u4E0B\u8F7D\u4E0E\u5B89\u88C5\u7684\u9519\u8BEF\u63D0\u793A\u8DDF\u968F\u754C\u9762\u8BED\u8A00\u663E\u793A\u201D; \u201Cfix(update): \u4FEE\u590D\u66F4\u65B0\u68C0\u67E5\u9650\u6D41\u4E0E\u9519\u8BEF\u5C55\u793A\u201D; \u201Cfix(app): \u4FEE\u590D\u753B\u5ECA\u6EDA\u52A8\u3001\u66F4\u65B0\u68C0\u6D4B\u4E0E\u5206\u8FA8\u7387\u6821\u9A8C\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/providers/update_provider.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/presentation/providers/update_provider.dart"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"de888d85b6c6fa06bbe7923ae4c0381a0bdf18e80352271864d2b898292223e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/utils/metadata_import_coordinator.dart: lib/presentation/utils/metadata_import_coordinator.dart changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is MetadataImportCoordinator._applyFixedTags at line 94), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(metadata): \u5BFC\u5165\u5143\u6570\u636E\u540E\u8D1F\u9762\u4E0D\u518D\u53E0\u52A0\u56FA\u5B9A\u8BCD\u4E0E UC \u9884\u8BBE\u201D; \u201Cfix(prompt): \u89D2\u8272\u53EA\u6309\u52FE\u9009\u5BFC\u5165\uFF0C\u6743\u91CD\u8C03\u6574\u5728\u5173\u95ED\u81EA\u52A8\u8865\u5168\u65F6\u4E5F\u80FD\u4FDD\u5B58\u201D; \u201Cfix: \u4FEE\u590D Issue #166 \u53CD\u9988\u95EE\u9898 (#168)\u201D; \u201Cfix(v5): preserve production metadata and model constraints\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/utils/metadata_import_coordinator.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/presentation/utils/metadata_import_coordinator.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a1044a11e30f22a2689492e25abec1e2e6c9a32c283fc006506cbaa55ba1c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/prompt/tag_editor_commands.dart: lib/presentation/widgets/prompt/tag_editor_commands.dart changed 9 times in last 90 days and 5 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 TagEditorCommands.available at line 173), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(prompt): \u6EDA\u8F6E\u8C03\u6743\u91CD\u6539\u5199\u9009\u533A\u6240\u5728\u7684\u5DF2\u6709\u6743\u91CD\uFF0C\u6743\u91CD\u6570\u5B57\u53BB\u6389\u672B\u5C3E\u7684\u96F6\u201D; \u201Cfix(prompt): \u4FEE\u590D\u7981\u7528\u6807\u7B7E\u5207\u6362\u5E76\u5B8C\u5584\u5220\u9664\u4E0E\u52A9\u624B\u6536\u8D77\u4EA4\u4E92\u201D; \u201Cfix(prompt): \u6743\u91CD\u5F52\u4E00\u65F6\u89E3\u9664\u5206\u7EC4\u5E76\u79FB\u9664\u6743\u91CD\u8BED\u6CD5\u201D; \u201Cfix(prompt): \u4FEE\u590D\u6574\u7EC4\u8C03\u6743\u7684\u62EC\u53F7\u53E0\u52A0\u4E0E\u6743\u91CD\u8FB9\u754C\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/tag_editor_commands.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/presentation/widgets/prompt/tag_editor_commands.dart"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46d474ff3a29c3adb61183ebc21bdc88c9e36779e5804d977650dc1fe0edb08"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/screens/vibe_library/widgets/vibe_detail_viewer.dart: lib/presentation/screens/vibe_library/widgets/vibe_detail_viewer.dart changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is _VibeDetailViewerState._hasParamChanges at line 247), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(shortcuts): \u5404\u9875\u9762\u8F93\u5165\u6846\u5931\u7126\u540E\u6309\u952E\u5904\u7406\u5668\u6536\u56DE\u7126\u70B9\u201D; \u201Cfix(adaptive): \u5176\u4F59\u8868\u5355\u9762\u677F\u7684\u6807\u9898\u968F\u6B63\u6587\u6EDA\u52A8\uFF0C\u77EE\u89C6\u53E3\u4E0B\u4E0D\u518D\u6324\u538B\u6B63\u6587\u201D; \u201Cfix(dialog): \u7EDF\u4E00\u77ED\u5F39\u7A97\u5185\u5BB9\u9AD8\u5EA6\u5E76\u8865\u5145\u5E03\u5C40\u56DE\u5F52\u6D4B\u8BD5\u201D; \u201Cfix(dialog): \u7EDF\u4E00\u684C\u9762\u5F39\u7A97\u5C3A\u5BF8\u4E0E\u5185\u5BB9\u9AD8\u5EA6 (#234)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/vibe_library/widgets/vibe_detail_viewer.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/presentation/screens/vibe_library/widgets/vibe_detail_viewer.dart"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6a45512c8e04638d377ec6ae82d8382da41d7ed96ddcb0af1adcb8827c5245"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/data/models/online_gallery/gallery_item.dart: lib/data/models/online_gallery/gallery_item.dart changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is GalleryItem.fromDanbooruJson at line 290), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(agent): \u65E0\u56FE\u8BCD\u6761\u7684\u5360\u4F4D\u5C01\u9762\u540C\u6837\u4E0D\u4F5C\u4E3A\u5A92\u4F53 id \u66B4\u9732\u201D; \u201Cfix(agent): \u5728\u7EBF\u753B\u5ECA\u5F15\u7528\u4E0D\u518D\u66B4\u9732 AI TAG \u5217\u8868\u5360\u4F4D\u5A92\u4F53 id\u201D; \u201Cfix(gallery): \u4FEE\u590D\u5E76\u5B8C\u5584\u590D\u5236\u5168\u90E8 TAG (#183)\u201D; \u201Cfix(gallery): \u9694\u79BB\u540E\u53F0\u7F51\u7EDC\u6D3B\u52A8\u4E0E\u56FE\u50CF\u751F\u6210 (#141)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/models/online_gallery/gallery_item.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/data/models/online_gallery/gallery_item.dart"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab92d6c03c5107b3417949aa656c1ef8fbcf2e66e4e493b20c4da790b9535d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/shortcuts/shortcut_aware_widget.dart: lib/presentation/widgets/shortcuts/shortcut_aware_widget.dart changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is _ShortcutAwareWidgetState._resolveShortcuts at line 98), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(shortcuts): \u5916\u5C42\u5FEB\u6377\u952E\u4E0D\u518D\u88AB\u5185\u5C42\u541E\u6389\uFF0C\u7F16\u8F91\u952E\u8BA9\u7ED9\u8F93\u5165\u6846\uFF0C\u5931\u7126\u540E\u6536\u56DE\u7126\u70B9\u201D; \u201Cfix(shortcuts): \u672C\u5730\u56FE\u5E93\u4E0E\u8BCD\u5E93\u9875\u5FEB\u6377\u952E\u6536\u4E0D\u5230\u6309\u952E\uFF0C\u6279\u91CF\u64A4\u9500\u8BA9\u4F4D\u8F93\u5165\u6846\u201D; \u201Cfix(shortcuts): \u5185\u5C42\u5305\u88C5\u5668\u6CA1\u6709\u53EF\u7528\u5FEB\u6377\u952E\u65F6\u4E0D\u518D\u541E\u6389\u5916\u5C42\u5FEB\u6377\u952E\u201D; \u201Cfix(shortcuts): \u65E0\u53EF\u7528\u5FEB\u6377\u952E\u65F6\u951A\u70B9\u8BA9\u51FA autofocus\uFF0C\u914D\u7F6E\u56DE\u9000\u4E0E\u9884\u89C8\u4E00\u81F4\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/shortcuts/shortcut_aware_widget.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/presentation/widgets/shortcuts/shortcut_aware_widget.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4624ff49f67357a9c170a0e510b79e3063597d5ad54eda0842c03d21abcea485"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/screens/generation/widgets/parameter_panel.dart: lib/presentation/screens/generation/widgets/parameter_panel.dart changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is ParameterPanel.build at line 27), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(generation): \u9AD8\u7EA7\u9009\u9879\u6CA1\u6709\u53EF\u663E\u793A\u7684\u63A7\u4EF6\u65F6\u4E0D\u518D\u6E32\u67D3\u7A7A\u5206\u7EC4\u201D; \u201Cfix(generation): \u4FEE\u590D\u9AD8\u7EA7\u9009\u9879\u6750\u8D28\u5C42\u7EA7\u201D; \u201Cfix(generation): \u8C03\u6574\u7ECF\u5178\u89D2\u8272\u7F16\u8F91\u987A\u5E8F\u201D; \u201Cfix(generation): \u5C06\u7ECF\u5178\u89D2\u8272\u7F16\u8F91\u79FB\u56DE\u5DE6\u4FA7\u680F\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/generation/widgets/parameter_panel.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/presentation/screens/generation/widgets/parameter_panel.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b418fe0cbcddf653c7ee25eec43f83da4b8954dfef96f40a724afebf89a5b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/agent_chat/widgets/agent_chat_history.dart: lib/presentation/agent_chat/widgets/agent_chat_history.dart changed 7 times in last 90 days and 5 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 _AgentChatThreadViewportState._captureVisibleAnchors at line 223), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(agent-chat): \u5217\u8868\u81EA\u8EAB\u4FEE\u6B63\u4F4D\u7F6E\u65F6\u4E0D\u518D\u91CD\u590D\u8865\u507F\uFF0C\u6309\u4F4F\u6216\u62D6\u52A8\u65F6\u5185\u5BB9\u4E0D\u88AB\u9876\u8D70\u201D; \u201Cfix(agent-chat): \u6D41\u5F0F\u8F93\u51FA\u65F6\u6EDA\u52A8\u8303\u56F4\u4E0D\u518D\u8DF3\u53D8\uFF0C\u6682\u505C\u9605\u8BFB\u540C\u5E27\u8865\u507F\u6F02\u79FB\u201D; \u201Cfix(agent): \u5B8C\u5584\u8D44\u6E90\u5F15\u7528\u4E0E\u4F1A\u8BDD\u72B6\u6001\u201D; \u201Cfix(agent-chat): \u7A33\u5B9A\u6682\u505C\u6EDA\u52A8\u951A\u70B9\u5E76\u8FC7\u6EE4\u91CD\u590D\u56FE\u7247\u9884\u89C8\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/agent_chat/widgets/agent_chat_history.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/presentation/agent_chat/widgets/agent_chat_history.dart"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa42d82428db11049ca00f45d054251caee231acc4a059b70079c1f4f7c4142"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/prompt/diy/panels/visibility_rule_panel.dart: lib/presentation/widgets/prompt/diy/panels/visibility_rule_panel.dart changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is _VisibilityRuleEditor._conditionTypeLabel at line 343), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(prompt): DIY \u8868\u5355\u4E0D\u518D\u5728\u9762\u677F\u9996\u884C\u91CD\u590D\u8868\u5355\u6807\u9898\u201D; \u201Cfix(prompt): \u89C4\u5219\u4E0E\u5206\u652F\u5217\u8868\u9762\u677F\u5171\u7528\u589E\u5220\u9009\u4E2D\u903B\u8F91\uFF0C\u9009\u4E2D\u7B56\u7565\u4FDD\u6301\u4E00\u81F4\u201D; \u201Cfix(prompt): \u53EF\u89C1\u6027\u89C4\u5219\u7684\u76EE\u6807\u53EF\u9009\u201C\u672C\u8BCD\u7EC4\u201D\uFF0C\u5B58\u91CF\u6309\u8BCD\u7EC4 ID \u4FDD\u5B58\u7684\u89C4\u5219\u4E0D\u518D\u663E\u793A\u5DF2\u5931\u6548\u201D; \u201Cfix(prompt): DIY \u914D\u7F6E\u8868\u5355\u5728\u7A84\u5C4F\u4E0E\u653E\u5927\u6587\u5B57\u4E0B\u4E0D\u6EA2\u51FA\u4E14\u89C4\u5219\u53EF\u7F16\u8F91\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/diy/panels/visibility_rule_panel.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/presentation/widgets/prompt/diy/panels/visibility_rule_panel.dart"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4d1392d6f24682ad2b4a76e0c281ad97920cc2fd1eda2522063a5ba4852959"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/data/models/prompt/random_tag_group.dart: lib/data/models/prompt/random_tag_group.dart changed 7 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 7 (its worst body is RandomTagGroup.diyFeatureIcons at line 353), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(prompt): \u6761\u4EF6\u5206\u652F\u53EF\u6307\u5B9A\u8F93\u51FA\u672C\u7C7B\u522B\u7684\u8BCD\u7EC4\u4E0E\u89E6\u53D1\u6761\u4EF6\u5E76\u771F\u6B63\u751F\u6548\u201D; \u201Cfix(prompt): \u65F6\u95F4\u6761\u4EF6\u53EA\u4FDD\u7559\u4E00\u4E2A\u542F\u7528\u5F00\u5173\uFF0C\u5173\u95ED\u6BCF\u5E74\u91CD\u590D\u540E\u53EF\u9009\u5E74\u4EFD\u201D; \u201Cfix(prompt): \u540E\u5904\u7406\u9884\u8BBE\u6309\u952E\u540D\u6307\u5411\u771F\u5B9E\u7C7B\u522B\uFF0C\u8BCD\u7EC4\u540E\u5904\u7406\u4F5C\u7528\u4E8E\u6574\u8F6E\u7ED3\u679C\u201D; \u201Cfix(prompt): \u8BCD\u7EC4\u53EF\u89C1\u6027\u89C4\u5219\u4EE5\u7C7B\u522B\u4E3A\u76EE\u6807\u65F6\u4F5C\u7528\u4E8E\u8BE5\u7C7B\u522B\u5168\u90E8\u8BCD\u7EC4\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/models/prompt/random_tag_group.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/data/models/prompt/random_tag_group.dart"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab985fd74122d9900bbd0ab09d459b9c79b5cfa9ce5d4631f73fd82842ed625"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/common/save_as_preset_dialog.dart: lib/presentation/widgets/common/save_as_preset_dialog.dart changed 7 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 13 (its worst body is _SaveAsPresetDialogState.build at line 282), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(metadata): \u5BFC\u5165\u5143\u6570\u636E\u540E\u8D1F\u9762\u4E0D\u518D\u53E0\u52A0\u56FA\u5B9A\u8BCD\u4E0E UC \u9884\u8BBE\u201D; \u201Cfix(adaptive): \u5176\u4F59\u8868\u5355\u9762\u677F\u7684\u6807\u9898\u968F\u6B63\u6587\u6EDA\u52A8\uFF0C\u77EE\u89C6\u53E3\u4E0B\u4E0D\u518D\u6324\u538B\u6B63\u6587\u201D; \u201Cfix(ui): \u4FEE\u590D\u754C\u9762\u56DE\u5F52\u5E76\u6E05\u7406\u5931\u6548\u6D4B\u8BD5\u65AD\u8A00\u201D; \u201Cfix(dialog): \u7EDF\u4E00\u684C\u9762\u5F39\u7A97\u5C3A\u5BF8\u4E0E\u5185\u5BB9\u9AD8\u5EA6 (#234)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/common/save_as_preset_dialog.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/presentation/widgets/common/save_as_preset_dialog.dart"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"74134bd7b8bbd1537098756fa78d3140e4e8cd4a942421074b633f749349d528"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/screens/statistics/widgets/dashboard/anlas_cost_card.dart: lib/presentation/screens/statistics/widgets/dashboard/anlas_cost_card.dart changed 7 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 7 (its worst body is _AnlasCostCardState._loadPeriodPreference at line 43), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(statistics): \u7EDF\u8BA1\u9875\u5404\u5361\u7247\u5728\u7A84\u5C4F\u548C\u5927\u5B57\u53F7\u4E0B\u6362\u884C\u6536\u655B\uFF0C\u4E0D\u518D\u6EA2\u51FA\u6216\u622A\u65AD\u201D; \u201Cfix(adaptive): \u5176\u4F59\u8868\u5355\u9762\u677F\u7684\u6807\u9898\u968F\u6B63\u6587\u6EDA\u52A8\uFF0C\u77EE\u89C6\u53E3\u4E0B\u4E0D\u518D\u6324\u538B\u6B63\u6587\u201D; \u201Cfix(dialog): \u7EDF\u4E00\u77ED\u5F39\u7A97\u5185\u5BB9\u9AD8\u5EA6\u5E76\u8865\u5145\u5E03\u5C40\u56DE\u5F52\u6D4B\u8BD5\u201D; \u201Cfix(dialog): \u7EDF\u4E00\u684C\u9762\u5F39\u7A97\u5C3A\u5BF8\u4E0E\u5185\u5BB9\u9AD8\u5EA6 (#234)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/statistics/widgets/dashboard/anlas_cost_card.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/presentation/screens/statistics/widgets/dashboard/anlas_cost_card.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84b7513defd13db8741e60310812bd7ad46c3b6fc62413014b39d01a78e6610"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/prompt/global_settings_dialog.dart: lib/presentation/widgets/prompt/global_settings_dialog.dart changed 7 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 _GlobalSettingsDialogState._showAddTagOptionDialog at line 492), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(prompt): \u4EBA\u6570\u7C7B\u522B\u914D\u7F6E\u7684\u300C\u53EF\u81EA\u5B9A\u4E49\u300D\u6539\u7528\u8F85\u52A9\u8272\uFF0C\u4E0D\u518D\u4E0E\u5361\u7247\u5E95\u8272\u51E0\u4E4E\u76F8\u540C\u201D; \u201Cfix(ui): \u8868\u5355\u9875\u811A\u7EDF\u4E00\u7531 AdaptiveFormFooter \u5448\u73B0\uFF0C\u6309\u94AE\u8D34\u53F3\u4E0D\u518D\u7F29\u5230\u4E2D\u95F4\u201D; \u201Cfix(ui): \u5171\u4EAB\u8868\u5355\u8F93\u5165\u6846\u4FDD\u7559\u8C03\u7528\u65B9\u4F20\u5165\u7684\u6807\u7B7E\u3001\u63D0\u793A\u3001\u56FE\u6807\u4E0E\u521D\u59CB\u503C\u201D; \u201Cfix(dialog): \u7EDF\u4E00\u684C\u9762\u5F39\u7A97\u5C3A\u5BF8\u4E0E\u5185\u5BB9\u9AD8\u5EA6 (#234)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/global_settings_dialog.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/presentation/widgets/prompt/global_settings_dialog.dart"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"2383d9efe94e177c7f5ffb087dbbc202e282ce60cd7b01e352b8b5d1339607e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/prompt/diy/panels/time_condition_panel.dart: lib/presentation/widgets/prompt/diy/panels/time_condition_panel.dart changed 7 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 7 (its worst body is _TimeConditionStatusCard.build at line 560), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(prompt): DIY \u8868\u5355\u4E0D\u518D\u5728\u9762\u677F\u9996\u884C\u91CD\u590D\u8868\u5355\u6807\u9898\u201D; \u201Cfix(prompt): \u65F6\u95F4\u6761\u4EF6\u53EA\u4FDD\u7559\u4E00\u4E2A\u542F\u7528\u5F00\u5173\uFF0C\u5173\u95ED\u6BCF\u5E74\u91CD\u590D\u540E\u53EF\u9009\u5E74\u4EFD\u201D; \u201Cfix(prompt): DIY \u914D\u7F6E\u8868\u5355\u5728\u7A84\u5C4F\u4E0E\u653E\u5927\u6587\u5B57\u4E0B\u4E0D\u6EA2\u51FA\u4E14\u89C4\u5219\u53EF\u7F16\u8F91\u201D; \u201Cfix(ui): \u4FEE\u590D\u4E0D\u900F\u660E\u5E95\u8272\u906E\u6321\u6309\u538B\u4E0E\u60AC\u505C\u53CD\u9988 (#344)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/diy/panels/time_condition_panel.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/presentation/widgets/prompt/diy/panels/time_condition_panel.dart"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7f2b4987781b426cd978aa146a1c718c2dfc17d934a23c77e6e173234665c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/common/themed_form_input.dart: lib/presentation/widgets/common/themed_form_input.dart changed 7 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 6 (its worst body is _ThemedFormInputState.didUpdateWidget at line 103), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ui): \u5171\u4EAB\u8868\u5355\u8F93\u5165\u6846\u6539\u4E3A\u7531 ThemedInput \u5448\u73B0\uFF0C\u8865\u4E0A\u4E3B\u9898\u53F3\u952E\u83DC\u5355\u4E0E Ctrl\u002BY\u201D; \u201Cfix(ui): \u5171\u4EAB\u8F93\u5165\u6846\u7684\u5E2E\u52A9\u4E0E\u9519\u8BEF\u6587\u5B57\u7EDF\u4E00\u6392\u5728\u8F93\u5165\u6846\u4E0B\u65B9\u201D; \u201Cfix(ui): \u5171\u4EAB\u8868\u5355\u8F93\u5165\u6846\u4FDD\u7559\u8C03\u7528\u65B9\u4F20\u5165\u7684\u6807\u7B7E\u3001\u63D0\u793A\u3001\u56FE\u6807\u4E0E\u521D\u59CB\u503C\u201D; \u201Cfix(ui): \u5B8C\u5584\u53CC\u7AEF\u8F93\u5165\u805A\u7126\u4E0E\u79FB\u52A8\u7AEF\u54CD\u5E94\u5F0F\u5E03\u5C40\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/common/themed_form_input.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/presentation/widgets/common/themed_form_input.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4551e92d519b483d5f408a60df0fc456b43eeaae39cf436ec45b153f6a514f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart: lib/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart changed 7 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 10 (its worst body is _VibeBundleImportDialogState._buildVibeGridCard at line 813), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ui): \u8865\u5168\u6ED1\u5757\u914D\u5957\u63A7\u4EF6\u8BFB\u5C4F\u540D\u79F0\u5E76\u6309\u5B9E\u6D4B\u5BBD\u5EA6\u5BF9\u9F50\u6807\u7B7E\u5217 (#346)\u201D; \u201Cfix(ui): \u4FEE\u590D\u4E0D\u900F\u660E\u5E95\u8272\u906E\u6321\u6309\u538B\u4E0E\u60AC\u505C\u53CD\u9988 (#344)\u201D; \u201Cfix(ui): \u5168\u5C40\u6ED1\u5757\u7EDF\u4E00\u8BFB\u5C4F\u540D\u79F0\u4E0E\u8BFB\u6570 (#330)\u201D; \u201Cfix(dialog): \u7EDF\u4E00\u684C\u9762\u5F39\u7A97\u5C3A\u5BF8\u4E0E\u5185\u5BB9\u9AD8\u5EA6 (#234)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.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/presentation/screens/vibe_library/widgets/vibe_bundle_import_dialog.dart"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8deef834a8279cfe651edb305087fd3e356f6656378bcbc7b2633d5e828a70"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/prompt/tag_editor_tree.dart: lib/presentation/widgets/prompt/tag_editor_tree.dart changed 7 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 10 (its worst body is _TagEditorTreeState.build at line 145), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ui): \u4FEE\u590D\u4E0D\u900F\u660E\u5E95\u8272\u906E\u6321\u6309\u538B\u4E0E\u60AC\u505C\u53CD\u9988 (#344)\u201D; \u201Cfix(prompt): \u4FEE\u590D\u6807\u7B7E\u91CD\u6392\u65F6\u63D0\u793A\u6D6E\u5C42\u7684\u5E03\u5C40\u5F02\u5E38\u201D; \u201Cfix(ui): \u7EDF\u4E00\u6309\u94AE\u80CC\u666F\u5E76\u4FEE\u590D\u6807\u7B7E\u6743\u91CD\u663E\u793A\u201D; \u201Cfix(prompt): \u652F\u6301\u70B9\u51FB\u7A7A\u767D\u7ED3\u675F\u6807\u7B7E\u7F16\u8F91\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/tag_editor_tree.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/presentation/widgets/prompt/tag_editor_tree.dart"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcfc50827ffef1cce09033251fbc3a946a10d85e6f0cce7658cc3f17c51859e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/online_gallery/gallery_detail_models.dart: lib/presentation/widgets/online_gallery/gallery_detail_models.dart changed 7 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 3 (its worst body is GalleryDetailViewModel.hasCopyableContent at line 154), 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: \u201CAdd agent slash commands and fix context menu, third-party login, and IME rendering (#192)\u201D; \u201Cfix(gallery): \u4FEE\u590D\u5E76\u5B8C\u5584\u590D\u5236\u5168\u90E8 TAG (#183)\u201D; \u201Cfix(online-gallery): \u6839\u636E\u53EF\u7528\u8F93\u51FA\u72B6\u6001\u542F\u7528\u751F\u6210\u64CD\u4F5C\u201D; \u201Cfix(gallery): \u9694\u79BB\u540E\u53F0\u7F51\u7EDC\u6D3B\u52A8\u4E0E\u56FE\u50CF\u751F\u6210 (#141)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/online_gallery/gallery_detail_models.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/presentation/widgets/online_gallery/gallery_detail_models.dart"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d86f36a25c1ef30e8a20115c552b1de4e656a272b9d6fff1b422e1d15aa5f57"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/screens/cloud_sync/cloud_sync_widgets.dart: lib/presentation/screens/cloud_sync/cloud_sync_widgets.dart changed 7 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 3 (its worst body is CloudSyncStatusBanner.build at line 177), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cloud-sync): \u660E\u786E\u63D0\u793A OAuth \u6388\u6743\u5931\u8D25\u201D; \u201Cfix(cloud-sync): \u7CBE\u7B80\u5907\u4EFD\u9009\u62E9\u754C\u9762\u5C42\u7EA7\u201D; \u201Cfix(cloud-sync): \u4FEE\u590D\u914D\u7F6E\u5B57\u6BB5\u6807\u7B7E\u88C1\u526A\u201D; \u201Cfix(cloud-sync): \u4F18\u5316\u540C\u6B65\u4F53\u9A8C\u4E0E\u9519\u8BEF\u63D0\u793A\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/cloud_sync/cloud_sync_widgets.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/presentation/screens/cloud_sync/cloud_sync_widgets.dart"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"344361624b927f63b436433f379bd6d8ddb11fb95bc86ba5c22b855b6b7443b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/network/dio_client.dart: lib/core/network/dio_client.dart changed 6 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 14 (its worst body is ErrorInterceptor._parseResponseError at line 308), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(network): apply proxy settings immediately\u201D; \u201Cfix(network): \u7EDF\u4E00 HTTP/1.1 \u5E76\u4FEE\u590D\u5E76\u53D1 401 \u5237\u65B0 (#427)\u201D; \u201Cfix(auth): \u5237\u65B0 token \u4E0D\u518D\u8986\u76D6\u5DF2\u9000\u51FA\u6216\u5DF2\u5207\u6362\u7684\u4F1A\u8BDD (#341)\u201D; \u201Cfix(network): \u4FDD\u7559\u4EE3\u7406\u670D\u52A1\u9519\u8BEF\u8BE6\u60C5\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/network/dio_client.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/core/network/dio_client.dart"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6297350c41e297adacf53a8eadbb9218119b49df87c5f7480f8f7bb8dc99de6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/prompt/fixed_tags_dialog_controller.dart: lib/presentation/widgets/prompt/fixed_tags_dialog_controller.dart changed 6 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 7 (its worst body is FixedTagsDialogController.collectAnchorCenters at line 150), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(fixed-tags): \u540C\u4E00\u5E27\u5185\u8FDB\u51FA\u641C\u7D22\u65F6\u5B8C\u6574\u5217\u8868\u4E5F\u56DE\u5230\u9876\u90E8\u201D; \u201Cfix(fixed-tags): \u7D27\u51D1\u5E03\u5C40\u4E0B\u4ECE\u641C\u7D22\u6846\u9000\u51FA\u641C\u7D22\u65F6\u56DE\u5230\u5217\u8868\u9876\u90E8\u201D; \u201Cfix(fixed-tags): \u7D27\u51D1\u5E03\u5C40\u4E0B\u56FA\u5B9A\u8BCD\u641C\u7D22\u6846\u8F93\u5165\u9996\u5B57\u540E\u4E0D\u518D\u5931\u7126\u201D; \u201Cfix(fixed-tags): \u91CD\u65B0\u6253\u5F00\u56FA\u5B9A\u8BCD\u5BF9\u8BDD\u6846\u4E0E\u4FA7\u680F\u65F6\u56DE\u5230\u4E0A\u6B21\u6D4F\u89C8\u4F4D\u7F6E\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/fixed_tags_dialog_controller.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/presentation/widgets/prompt/fixed_tags_dialog_controller.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88894085616dca7abf5f317f78ebf2ceaba5ee6dcf2cc12daeaf4ff1d1fd51b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/image_editor/widgets/panels/color_panel.dart: lib/presentation/widgets/image_editor/widgets/panels/color_panel.dart changed 6 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 3 (its worst body is _QuickColorButton.build at line 243), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ui): \u8868\u5355\u9875\u811A\u7EDF\u4E00\u7531 AdaptiveFormFooter \u5448\u73B0\uFF0C\u6309\u94AE\u8D34\u53F3\u4E0D\u518D\u7F29\u5230\u4E2D\u95F4\u201D; \u201Cfix(adaptive): \u5176\u4F59\u8868\u5355\u9762\u677F\u7684\u6807\u9898\u968F\u6B63\u6587\u6EDA\u52A8\uFF0C\u77EE\u89C6\u53E3\u4E0B\u4E0D\u518D\u6324\u538B\u6B63\u6587\u201D; \u201Cfix(ui): \u4FEE\u590D\u77ED\u8868\u5355\u5F39\u7A97\u5F02\u5E38\u6491\u9AD8\u201D; \u201Cfix(dialog): \u7EDF\u4E00\u684C\u9762\u5F39\u7A97\u5C3A\u5BF8\u4E0E\u5185\u5BB9\u9AD8\u5EA6 (#234)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/image_editor/widgets/panels/color_panel.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/presentation/widgets/image_editor/widgets/panels/color_panel.dart"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93c7363412d18fddcb69715f0127e8acd649b7a37e638a5bfc326aee3031459"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/data/services/random_preset_generation_context.dart: lib/data/services/random_preset_generation_context.dart changed 6 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 5 (its worst body is RandomPresetGenerationContext.addCategoryTags at line 31), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(prompt): \u4F9D\u8D56\u6307\u5B9A\u7684\u53D8\u91CF\u6E90\u4E0E\u7C7B\u522B\u6E90\u7ECF\u540C\u4E00\u5165\u53E3\u5339\u914D\u6620\u5C04\u201D; \u201Cfix(prompt): \u6761\u4EF6\u5206\u652F\u53EF\u6307\u5B9A\u8F93\u51FA\u672C\u7C7B\u522B\u7684\u8BCD\u7EC4\u4E0E\u89E6\u53D1\u6761\u4EF6\u5E76\u771F\u6B63\u751F\u6548\u201D; \u201Cfix(prompt): \u4F9D\u8D56\u6309\u6E90\u6C42\u503C\uFF0C\u89D2\u8272\u6570\u91CF\u6E90\u53EF\u7528\u4E8E\u5B58\u5728\u4E0E\u6392\u65A5\u4F9D\u8D56\u201D; \u201Cfix(prompt): DIY \u89C4\u5219\u6309\u7C7B\u522B ID \u5F15\u7528\u5E76\u517C\u5BB9\u6309\u540D\u79F0\u4FDD\u5B58\u7684\u5B58\u91CF\u6570\u636E\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/services/random_preset_generation_context.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/data/services/random_preset_generation_context.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e3c103f445c7947edc46b36ad1fc354863689597396d24709f1a7e0d8aeef0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/cloud_sync/oauth/cloud_drive_oauth_token_provider.dart: lib/core/cloud_sync/oauth/cloud_drive_oauth_token_provider.dart changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is SecureCloudDriveOAuthTokenProvider.connect at line 52), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cloud-sync): \u4FEE\u590D\u684C\u9762 OAuth \u516C\u5171\u5BA2\u6237\u7AEF\u914D\u7F6E\u201D; \u201Cfix(cloud-sync): \u5B8C\u5584\u4E91\u76D8\u6388\u6743\u53D6\u6D88\u4E0E\u684C\u9762\u51ED\u636E\u201D; \u201Cfix(cloud-sync): \u4FEE\u590D\u4E91\u7AEF\u8FDE\u63A5\u4E0E\u6062\u590D\u8FB9\u754C\u201D; \u201Cfix(cloud-sync): \u5B8C\u5584 OneDrive \u8FDE\u63A5\u8BCA\u65AD\u4E0E\u9519\u8BEF\u5904\u7406\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/cloud_sync/oauth/cloud_drive_oauth_token_provider.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/core/cloud_sync/oauth/cloud_drive_oauth_token_provider.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e110df11d36195080ce1fa0a117dbc5cc27a53caaa8569b333402494a52c3704"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/prompt_assistant/providers/web_access_provider.dart: lib/presentation/prompt_assistant/providers/web_access_provider.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is WebAccessConfigNotifier.build at line 52), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(providers): \u4EC5\u5728 await \u524D\u4F1A\u78B0 state \u7684 provider \u4E0A\u63A8\u8FDF\u521D\u59CB\u5316\u201D; \u201Cfix(providers): \u5F02\u6B65\u521D\u59CB\u5316\u63A8\u8FDF\u5230 build \u8FD4\u56DE\u4E4B\u540E\u201D; \u201Cfix(agent): \u56FA\u5316\u8054\u7F51\u8BFB\u53D6\u7684\u5B89\u5168\u4F20\u8F93\u8FB9\u754C\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/prompt_assistant/providers/web_access_provider.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/presentation/prompt_assistant/providers/web_access_provider.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bfa67c2844e6e955dee548b7c8b1ef98941f13a1bf56056fb93ee447598f45c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/image_editor/tools/eraser_tool.dart: lib/presentation/widgets/image_editor/tools/eraser_tool.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is EraserTool.onPointerDown at line 54), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(editor): \u91CD\u7ED8\u7F16\u8F91\u7EC4\u6A61\u76AE\u64E6\u53EA\u64E6\u7B14\u8FF9\u5E76\u6539\u4E3A\u5B9E\u65F6\u64E6\u9664\u201D; \u201Cfix(editor): \u8499\u7248\u5C42\u4E0A\u7684\u6A61\u76AE\u64E6\u56FA\u5B9A\u4E3A\u786C\u8FB9\u201D; \u201Cfix(editor): \u5DE5\u5177\u9762\u677F\u9002\u914D\u5927\u5B57\u53F7\u5E76\u8865\u5168\u6309\u538B\u53CD\u9988\u4E0E\u8BFB\u5C4F\u540D\u79F0 (#325)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/image_editor/tools/eraser_tool.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/presentation/widgets/image_editor/tools/eraser_tool.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ad48ec98f2c4062e0f7164fb283c2a5e358fb310aed555a495b88ebaae720c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/utils/card_resource_drag_factory.dart: lib/presentation/utils/card_resource_drag_factory.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is CardResourceDragFactory.create at line 32), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(agent): QuickTagCloud \u4F5C\u54C1\u5F15\u7528\u6539\u7528\u53EF\u9006\u7F16\u7801\u7684\u4E0D\u900F\u660E id\u201D; \u201Cfix(agent): \u65E0\u56FE\u8BCD\u6761\u7684\u5360\u4F4D\u5C01\u9762\u540C\u6837\u4E0D\u4F5C\u4E3A\u5A92\u4F53 id \u66B4\u9732\u201D; \u201Cfix(agent): \u5728\u7EBF\u753B\u5ECA\u5F15\u7528\u4E0D\u518D\u66B4\u9732 AI TAG \u5217\u8868\u5360\u4F4D\u5A92\u4F53 id\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/utils/card_resource_drag_factory.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/presentation/utils/card_resource_drag_factory.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bba03adce12620de828934879c5435936f896ff86f3f5454a36e2d4acbddbe3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/common/thumbnail_display.dart: lib/presentation/widgets/common/thumbnail_display.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is _ThumbnailDisplayState._decodeCacheExtent at line 221), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(image): EXIF \u65CB\u8F6C\u7684 JPEG \u6309\u89E3\u7801\u540E\u7684\u50CF\u7D20\u5C3A\u5BF8\u53C2\u4E0E\u5BFC\u5165\u3001\u7F16\u8F91\u4E0E\u653E\u5927\u201D; \u201Cfix(ui): \u672C\u5730\u56FE\u7247\u6539\u6309\u6587\u4EF6\u8EAB\u4EFD\u7F13\u5B58\uFF0C\u539F\u5730\u8986\u76D6\u540E\u4E0D\u518D\u663E\u793A\u65E7\u50CF\u7D20\u201D; \u201Cfix(thumbnail): \u6309\u5B9E\u9645\u5BB9\u5668\u6BD4\u4F8B\u94FA\u6EE1\u8BCD\u5E93\u9884\u89C8\u56FE (#78)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/common/thumbnail_display.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/presentation/widgets/common/thumbnail_display.dart"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca086b082f9321b624cac51f8f69ff24755ab6371b575f41d519f93dfc8aace7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/data/services/dlss/dlss_float_frame.dart: lib/data/services/dlss/dlss_float_frame.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is DlssFloatFrame.decode at line 36), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(image): \u4FEE\u590D\u5355\u901A\u9053\u7070\u5EA6\u56FE\u5408\u6210\u540E\u53D8\u7EA2\u201D; \u201Cfix(dlss): \u5220\u9664\u591A\u6B21\u53E0\u52A0\u5E76\u7EDF\u4E00\u5355\u6B21 NR \u5904\u7406\u201D; \u201Cfix(dlss): \u4FDD\u7559\u6A21\u578B\u5386\u53F2\u4EE5\u51CF\u5C11\u591A\u8F6E\u5904\u7406\u7EB9\u7406\u7D2F\u79EF\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/services/dlss/dlss_float_frame.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/data/services/dlss/dlss_float_frame.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4973a3c4412b0d4a70e417f6a2a7c1297845b8146bf1db3adcc3434e1e914c92"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/screens/tag_library_page/widgets/tag_library_drop_menu.dart: lib/presentation/screens/tag_library_page/widgets/tag_library_drop_menu.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is TagLibraryDropMenu.build at line 96), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(adaptive): \u5176\u4F59\u8868\u5355\u9762\u677F\u7684\u6807\u9898\u968F\u6B63\u6587\u6EDA\u52A8\uFF0C\u77EE\u89C6\u53E3\u4E0B\u4E0D\u518D\u6324\u538B\u6B63\u6587\u201D; \u201Cfix(dialog): \u7EDF\u4E00\u77ED\u5F39\u7A97\u5185\u5BB9\u9AD8\u5EA6\u5E76\u8865\u5145\u5E03\u5C40\u56DE\u5F52\u6D4B\u8BD5\u201D; \u201Cfix(dialog): \u7EDF\u4E00\u684C\u9762\u5F39\u7A97\u5C3A\u5BF8\u4E0E\u5185\u5BB9\u9AD8\u5EA6 (#234)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/tag_library_page/widgets/tag_library_drop_menu.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/presentation/screens/tag_library_page/widgets/tag_library_drop_menu.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"3061e9273374fdc9e5b8b5d7c17e1c00a5af5dc7acb7c7ae804cf349b6b4803c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/gallery/zip_export_metadata_dialog.dart: lib/presentation/widgets/gallery/zip_export_metadata_dialog.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is _ZipExportMetadataDialogState.build at line 32), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(adaptive): \u5176\u4F59\u8868\u5355\u9762\u677F\u7684\u6807\u9898\u968F\u6B63\u6587\u6EDA\u52A8\uFF0C\u77EE\u89C6\u53E3\u4E0B\u4E0D\u518D\u6324\u538B\u6B63\u6587\u201D; \u201Cfix(dialog): \u7EDF\u4E00\u77ED\u5F39\u7A97\u5185\u5BB9\u9AD8\u5EA6\u5E76\u8865\u5145\u5E03\u5C40\u56DE\u5F52\u6D4B\u8BD5\u201D; \u201Cfix(dialog): \u7EDF\u4E00\u684C\u9762\u5F39\u7A97\u5C3A\u5BF8\u4E0E\u5185\u5BB9\u9AD8\u5EA6 (#234)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/gallery/zip_export_metadata_dialog.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/presentation/widgets/gallery/zip_export_metadata_dialog.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75beb9daf722cb9db1da04546b1d578b103d603209c7fdc370246b5d19aae11"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/online_gallery/gallery_prompt_copy_dialog.dart: lib/presentation/widgets/online_gallery/gallery_prompt_copy_dialog.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is _GalleryPromptCopyDialogState._options at line 118), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(adaptive): \u5176\u4F59\u8868\u5355\u9762\u677F\u7684\u6807\u9898\u968F\u6B63\u6587\u6EDA\u52A8\uFF0C\u77EE\u89C6\u53E3\u4E0B\u4E0D\u518D\u6324\u538B\u6B63\u6587\u201D; \u201Cfix(dialog): \u7EDF\u4E00\u77ED\u5F39\u7A97\u5185\u5BB9\u9AD8\u5EA6\u5E76\u8865\u5145\u5E03\u5C40\u56DE\u5F52\u6D4B\u8BD5\u201D; \u201Cfix(dialog): \u7EDF\u4E00\u684C\u9762\u5F39\u7A97\u5C3A\u5BF8\u4E0E\u5185\u5BB9\u9AD8\u5EA6 (#234)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/online_gallery/gallery_prompt_copy_dialog.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/presentation/widgets/online_gallery/gallery_prompt_copy_dialog.dart"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed01636d37e47902cd2519ea0635c33d44c179823f82aa35e70a9872872bdbf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/screens/precise_ref_library/widgets/precise_ref_entry_edit_dialog.dart: lib/presentation/screens/precise_ref_library/widgets/precise_ref_entry_edit_dialog.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is _PreciseRefEntryEditDialogState.build at line 112), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ui): \u8865\u5168\u6ED1\u5757\u914D\u5957\u63A7\u4EF6\u8BFB\u5C4F\u540D\u79F0\u5E76\u6309\u5B9E\u6D4B\u5BBD\u5EA6\u5BF9\u9F50\u6807\u7B7E\u5217 (#346)\u201D; \u201Cfix(ui): \u5168\u5C40\u6ED1\u5757\u7EDF\u4E00\u8BFB\u5C4F\u540D\u79F0\u4E0E\u8BFB\u6570 (#330)\u201D; \u201Cfix(dialog): \u7EDF\u4E00\u684C\u9762\u5F39\u7A97\u5C3A\u5BF8\u4E0E\u5185\u5BB9\u9AD8\u5EA6 (#234)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/precise_ref_library/widgets/precise_ref_entry_edit_dialog.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/presentation/screens/precise_ref_library/widgets/precise_ref_entry_edit_dialog.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d6303c9e9faabca8495a42391b1e2d989576244ebe221d69afde4bc4d36e28"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/screens/dlss/dlss_parameter_slider.dart: lib/presentation/screens/dlss/dlss_parameter_slider.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is _DlssParameterSliderState._submit at line 68), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ui): \u5168\u5C40\u6ED1\u5757\u7EDF\u4E00\u8BFB\u5C4F\u540D\u79F0\u4E0E\u8BFB\u6570 (#330)\u201D; \u201Cfix(dlss): \u5220\u9664\u591A\u6B21\u53E0\u52A0\u5E76\u7EDF\u4E00\u5355\u6B21 NR \u5904\u7406\u201D; \u201Cfix(dlss): \u590D\u7528\u6570\u503C\u63A7\u4EF6\u5E76\u7EDF\u4E00\u8F93\u5165\u6846\u5C45\u4E2D\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/dlss/dlss_parameter_slider.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/presentation/screens/dlss/dlss_parameter_slider.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7ae90c479bdf67999b01f57cd289167f002a637e6ae39988cfa47df698a208"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/screens/cloud_sync/cloud_sync_content_selection_dialog.dart: lib/presentation/screens/cloud_sync/cloud_sync_content_selection_dialog.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is _CloudSyncContentSelectionBodyState._selectionGroup at line 203), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ui): \u7EDF\u4E00\u5361\u7247\u5206\u7EC4\u4E0E\u60AC\u6D6E\u9884\u89C8\u5C42\u7EA7 (#243)\u201D; \u201Cfix(cloud-sync): \u4FEE\u6B63\u5907\u4EFD\u9009\u62E9\u64CD\u4F5C\u6309\u94AE\u5BF9\u9F50\u201D; \u201Cfix(cloud-sync): \u7CBE\u7B80\u5907\u4EFD\u9009\u62E9\u754C\u9762\u5C42\u7EA7\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/cloud_sync/cloud_sync_content_selection_dialog.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/presentation/screens/cloud_sync/cloud_sync_content_selection_dialog.dart"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f4045f26c961d9f5ede610c04ca285b983524b827195fc9eea204f526b7eab"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/settings/account_detail_tile.dart: lib/presentation/widgets/settings/account_detail_tile.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is AccountDetailTile._getTierColor at line 234), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(account): \u663E\u793A\u591A\u8BED\u8A00\u4F1A\u5458\u5230\u671F\u65E5\u671F\u5E76\u4FEE\u590D\u8D44\u6599\u5F39\u7A97\u5E03\u5C40\u201D; \u201CAdd agent slash commands and fix context menu, third-party login, and IME rendering (#192)\u201D; \u201Cfix(auth): \u652F\u6301\u533F\u540D\u542F\u52A8\u5E76\u7EDF\u4E00\u4ED8\u8D39\u64CD\u4F5C\u767B\u5F55\u95E8\u7981\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/settings/account_detail_tile.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/presentation/widgets/settings/account_detail_tile.dart"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"991d19c772e06795c61fb7c9c6f563ca26f2c69004f8ee6ea6edebee91785a81"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/online_gallery/progressive_gallery_image.dart: lib/presentation/widgets/online_gallery/progressive_gallery_image.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is _ProgressiveGalleryImageState._requestSample at line 82), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(gallery): \u4FEE\u590D AI TAG \u7F29\u7565\u56FE\u52A0\u8F7D\u505C\u6EDE (#159)\u201D; \u201Cfix(gallery): \u9694\u79BB\u540E\u53F0\u7F51\u7EDC\u6D3B\u52A8\u4E0E\u56FE\u50CF\u751F\u6210 (#141)\u201D; \u201Cfix(online-gallery): \u4F18\u5316\u60AC\u6D6E\u9884\u89C8\u5E03\u5C40\u4E0E\u56FE\u7247\u6BD4\u4F8B\u9002\u914D\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/online_gallery/progressive_gallery_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/presentation/widgets/online_gallery/progressive_gallery_image.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"75847bc7022f2e8f8bd0c60f068773664b6d71dd2b80d992fd1b94e8c3ab2556"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/gallery/gallery_library_toolbar.dart: lib/presentation/widgets/gallery/gallery_library_toolbar.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is GalleryLibrarySearchField.build at line 176), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(prompt): \u7EDF\u4E00\u79FB\u52A8\u7AEF\u52A9\u624B\u5360\u4F4D\u5E76\u590D\u7528\u6EDA\u52A8\u63D0\u793A\u201D; \u201Cfix(input): \u53BB\u9664\u63D0\u793A\u8BCD\u548C\u5185\u5D4C\u8F93\u5165\u6846\u7684\u91CD\u590D\u80CC\u666F\u586B\u5145\u201D; \u201Cfix(library): \u7A81\u51FA\u79FB\u52A8\u7AEF\u4E3B\u64CD\u4F5C\u4E0E\u6EDA\u52A8\u63D0\u793A\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/gallery/gallery_library_toolbar.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/presentation/widgets/gallery/gallery_library_toolbar.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"274a9b27c171db520862d0416fd3c03deb1f53aac2d56b11cb38d5d0db46dfdd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/cloud_sync/oauth/cloud_drive_oauth_config.dart: lib/core/cloud_sync/oauth/cloud_drive_oauth_config.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is CloudDriveOAuthConfig.diagnose at line 136), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cloud-sync): \u4FEE\u590D\u684C\u9762 OAuth \u516C\u5171\u5BA2\u6237\u7AEF\u914D\u7F6E\u201D; \u201Cfix(cloud-sync): \u4FEE\u590D\u5B89\u5353\u4E91\u76D8\u6388\u6743\u4E0E\u5907\u4EFD\u62C9\u53D6\u201D; \u201Cfix(cloud-sync): \u5B8C\u5584\u4E91\u76D8\u6388\u6743\u53D6\u6D88\u4E0E\u684C\u9762\u51ED\u636E\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/cloud_sync/oauth/cloud_drive_oauth_config.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/core/cloud_sync/oauth/cloud_drive_oauth_config.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d736eb25177c66f38b926e861da4456712d4b808c7cf4530043c5f70bbb468"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/screens/generation/widgets/main_workspace.dart: lib/presentation/screens/generation/widgets/main_workspace.dart changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is MainWorkspace.build at line 52), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(generation): \u5C06\u7ECF\u5178\u89D2\u8272\u7F16\u8F91\u79FB\u56DE\u5DE6\u4FA7\u680F\u201D; \u201Cfix(generation): \u6062\u590D\u7ECF\u5178\u6A21\u5F0F\u89D2\u8272\u7F16\u8F91\u5165\u53E3\u201D; \u201Cfix(generation): \u5B8C\u5584 Issue 80 \u754C\u9762\u53CD\u9988 (#170)\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/screens/generation/widgets/main_workspace.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/presentation/screens/generation/widgets/main_workspace.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab357047ac5872c1f2607d5304c7a2b7337831ae576a0062e0a552b9598960e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/core/autocomplete/llm_translation_resolver.dart: lib/core/autocomplete/llm_translation_resolver.dart changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is LlmTranslationResolver.resolve at line 47), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(autocomplete): \u7ACB\u5373\u6062\u590D AI \u7FFB\u8BD1\u7F13\u5B58\u201D; \u201Cfix(autocomplete): isolate translation request scopes\u201D; \u201Cfix(autocomplete): debounce and cancel LLM translations\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/core/autocomplete/llm_translation_resolver.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/core/autocomplete/llm_translation_resolver.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23dba1247cab4c9c25439d94458f84e93a147b6afecf7b8bf4d8b45d83c175b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/prompt_assistant/services/provider_adapters/agent_wire_helpers.dart: lib/presentation/prompt_assistant/services/provider_adapters/agent_wire_helpers.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 9 (its worst body is AgentSseParser._handleLine at line 55), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(agent): \u4FEE\u590D Responses \u63A8\u7406\u6620\u5C04\u4E0E\u5DE5\u5177\u56DE\u653E\u5E76\u91CD\u8BD5\u77AC\u65F6\u8FDE\u63A5\u9519\u8BEF (#302)\u201D; \u201Cfix(agent): \u4FEE\u590D Gemini \u6D41\u5F0F\u54CD\u5E94\u517C\u5BB9\u6027\u201D; \u201Cfix(gemini): \u4FEE\u590D\u6D41\u5F0F\u9519\u8BEF\u4E0E\u5DE5\u5177\u8C03\u7528\u517C\u5BB9\u6027\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/prompt_assistant/services/provider_adapters/agent_wire_helpers.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/presentation/prompt_assistant/services/provider_adapters/agent_wire_helpers.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5dfc863903f71145b8d30d701d1612a4a430d5f6b88049f81f23812348ad68"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/data/services/dlss/dlss_environment_service.dart: lib/data/services/dlss/dlss_environment_service.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 9 (its worst body is DlssEnvironmentService.inspect at line 44), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(dlss): \u5220\u9664\u591A\u6B21\u53E0\u52A0\u5E76\u7EDF\u4E00\u5355\u6B21 NR \u5904\u7406\u201D; \u201Cfix(dlss): \u4FDD\u7559\u6A21\u578B\u5386\u53F2\u4EE5\u51CF\u5C11\u591A\u8F6E\u5904\u7406\u7EB9\u7406\u7D2F\u79EF\u201D; \u201Cfix(dlss): \u6539\u7528\u6D6E\u70B9\u4E09\u5C42\u5904\u7406\u5E76\u5B8C\u5584\u56FE\u50CF\u5BF9\u6BD4\u4E0E\u5361\u7247\u64CD\u4F5C\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/services/dlss/dlss_environment_service.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/data/services/dlss/dlss_environment_service.dart"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd5d229805cf89100faa7fa07fcc4b3124ba4fbe6610ef875cdf9829c7c1dbb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/anlas/opus_usage_chip.dart: lib/presentation/widgets/anlas/opus_usage_chip.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 13 (its worst body is OpusUsageChip.build at line 41), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ui): \u5C06\u8FDB\u5EA6\u53CD\u9988\u79FB\u81F3\u6240\u5C5E\u4EFB\u52A1\u533A\u57DF\u201D; \u201Cfix(anlas): \u6B63\u786E\u4FDD\u7559\u56DE\u5145\u8D85\u989D\u5E76\u5C01\u9876\u8FDB\u5EA6\u6761\u201D; \u201Cfix(anlas): align enhance quota and upscale pricing\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/anlas/opus_usage_chip.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/presentation/widgets/anlas/opus_usage_chip.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24deebfd2b2bad70e7916aba96efdd18a055470be92965512a42f9a7413c12a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/common/user_question_flow.dart: lib/presentation/widgets/common/user_question_flow.dart changed 3 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 8 (its worst body is _UserQuestionFlowState._actions at line 180), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(agent-chat): \u63D0\u95EE\u5361\u7247\u70B9\u5916\u90E8\u6216\u5207\u9898\u540E\u9875\u9762\u5FEB\u6377\u952E\u4E0D\u518D\u5931\u6548\u201D; \u201Cfix(focus): \u5206\u7C7B\u4E0E\u76F8\u7C3F\u6811\u3001\u667A\u80FD\u4F53\u81EA\u5B9A\u4E49\u56DE\u7B54\u7684\u8F93\u5165\u6846\u51FA\u73B0\u540E\u76F4\u63A5\u53EF\u8F93\u5165\u201D; \u201Cfix(agent): \u5C06\u81EA\u5B9A\u4E49\u56DE\u7B54\u8F93\u5165\u6846\u5185\u5D4C\u5230\u9009\u9879\u5361\u7247\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/common/user_question_flow.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/presentation/widgets/common/user_question_flow.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"2309609dbb517e9774dd4c1b1c4a42ca5e40047903a80851bdfeeca9d5c256ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/selection/card_selection_scope.dart: lib/presentation/selection/card_selection_scope.dart changed 3 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 8 (its worst body is _CardSelectionShortcutsState._handleKeyEvent at line 78), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(shortcuts): \u5916\u5C42\u5FEB\u6377\u952E\u4E0D\u518D\u88AB\u5185\u5C42\u541E\u6389\uFF0C\u7F16\u8F91\u952E\u8BA9\u7ED9\u8F93\u5165\u6846\uFF0C\u5931\u7126\u540E\u6536\u56DE\u7126\u70B9\u201D; \u201Cfix(shortcuts): \u672C\u5730\u56FE\u5E93\u4E0E\u8BCD\u5E93\u9875\u5FEB\u6377\u952E\u6536\u4E0D\u5230\u6309\u952E\uFF0C\u6279\u91CF\u64A4\u9500\u8BA9\u4F4D\u8F93\u5165\u6846\u201D; \u201Cfix(selection): \u4FEE\u6B63\u5E73\u53F0\u591A\u9009\u6309\u952E\u5E76\u540C\u6B65\u56DE\u5F52\u6D4B\u8BD5\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/selection/card_selection_scope.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/presentation/selection/card_selection_scope.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcd29ac736e11bab36d829cae7d0032c9e29d1639ed6acb89fce9012a8f8f9b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/presentation/widgets/prompt/diy/diy_category_field.dart: lib/presentation/widgets/prompt/diy/diy_category_field.dart changed 3 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 8 (its worst body is DiyCategoryDropdown.build at line 37), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(prompt): \u5206\u652F\u6761\u4EF6\u4E0E\u9884\u8BBE\u540E\u5904\u7406\u89C4\u5219\u6309\u952E\u540D\u627E\u7C7B\u522B\u65F6\u590D\u7528\u7C7B\u522B\u5F15\u7528\u89E3\u6790\u201D; \u201Cfix(prompt): \u6761\u4EF6\u5206\u652F\u53EF\u6307\u5B9A\u8F93\u51FA\u672C\u7C7B\u522B\u7684\u8BCD\u7EC4\u4E0E\u89E6\u53D1\u6761\u4EF6\u5E76\u771F\u6B63\u751F\u6548\u201D; \u201Cfix(prompt): \u540E\u5904\u7406\u9884\u8BBE\u6309\u952E\u540D\u6307\u5411\u771F\u5B9E\u7C7B\u522B\uFF0C\u8BCD\u7EC4\u540E\u5904\u7406\u4F5C\u7528\u4E8E\u6574\u8F6E\u7ED3\u679C\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/presentation/widgets/prompt/diy/diy_category_field.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/presentation/widgets/prompt/diy/diy_category_field.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"460f730437b5d9ab3aaa63d4f9b68bdff2ccb1eda41dfc828e4302044f3dc7bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/data/models/prompt/diy_category_references.dart: lib/data/models/prompt/diy_category_references.dart changed 3 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 5 (its worst body is DiyCategoryReferenceResolver.canonicalConditionKey at line 53), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(prompt): \u5206\u652F\u6761\u4EF6\u91CC\u6309\u952E\u540D\u6216\u540D\u79F0\u4FDD\u5B58\u7684\u5B58\u91CF\u53D8\u91CF\u7EDF\u4E00\u89E3\u6790\u4E3A ID\u201D; \u201Cfix(prompt): \u590D\u5236\u9884\u8BBE\u540E\u5206\u652F\u6761\u4EF6\u5F15\u7528\u7684\u7C7B\u522B\u4E0E\u8BCD\u7EC4\u6307\u5411\u526F\u672C\u201D; \u201Cfix(prompt): \u6761\u4EF6\u5206\u652F\u53EF\u6307\u5B9A\u8F93\u51FA\u672C\u7C7B\u522B\u7684\u8BCD\u7EC4\u4E0E\u89E6\u53D1\u6761\u4EF6\u5E76\u771F\u6B63\u751F\u6548\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 23:49:33 -08:00\u0027 --until=\u00272026-11-14 23:49:33 -08:00\u0027 --full-history --no-merges -- lib/data/models/prompt/diy_category_references.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/data/models/prompt/diy_category_references.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8214c8ae864baa17439cf307f5f656f4e301f6fecde5b210e6d1bb37886f2c74"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 173 significant file(s) lose their only recent owner: lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_feature.dart, lib/presentation/widgets/prompt/tag_editor_view.dart, lib/presentation/widgets/online_gallery/quick_tag_cloud_toolbar.dart, lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart, lib/data/cloud_sync/app_cloud_sync_data_source.dart, lib/presentation/widgets/common/pagination_bar.dart, lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_source_controls.dart, lib/core/database/providers/data_source_cache_provider.dart (\u002B165 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"33124c55a406b196dade307b4c46db89e337cad94f7f6fe023a8e278153b51ac"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 142 significant file(s) lose their only recent owner: tool/ole_drag_inspector/windows/Program.cs, lib/core/database/datasources/gallery_query.dart, lib/data/services/official_random_prompt_generator.dart, lib/core/utils/inpaint_outpaint_utils.dart, krita_plugin/nai_launcher_bridge/ui.py, lib/presentation/widgets/image_editor/widgets/outpaint_edge_drag_overlay.dart, tool/ole_drag_inspector/validate_ole_dump.dart, lib/presentation/utils/dropped_file_reader.dart (\u002B134 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce0f774ed62c69e41b16285b3715028f99bf2c83f5c6b35c32cb4e2313dd722a"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 6 significant file(s) lose their only recent owner: lib/core/agent/harness/skills.dart, lib/core/network/web_access/safe_web_reader.dart, lib/core/agent/harness/tools/read.dart, lib/presentation/agent_chat/services/web_access_toolbox.dart, lib/core/network/web_access/web_access_http_transport.dart, lib/core/network/web_access/web_access_utils.dart. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"73dcc4bcb3609053f7111868e590336830641508d824d612c3f5fa4b2828a2b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(\u7528\u6237\u5B9E\u73B0)\uFF1A\u89C1\u4E0B\u65B9\u8BF4\u660E\uFF0C\u53EF\u9009\u62E9\u4FDD\u6301\u539F\u6837\u3001\u6536\u655B\u7A7A\u6807\u7B7E\uFF0C\u6216\u6574\u4F53\u683C\u5F0F\u5316\u3002 \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/presentation/widgets/prompt/unified/prompt_search_utils.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0070bf3ffbc6174a4388c0a2760444cb925b28d686797654a1550ab3421b14cf"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060macos/Runner.xcodeproj/project.pbxproj\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"macos/Runner.xcodeproj/project.pbxproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f0bd4325cb484fa699f9766497db05ed665b24b57923e0afe7629a5ed95be7"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060testNovelAIConnection\u0060 spells \u0060AI\u0060 where 20 names in the project spell it \u0060Ai\u0060: 20 of 21 names in project repository.core spell the token \u0060Ai\u0060 (20 of 21; unit: names in project repository.core containing \u0060Ai\u0060). Peers: AutocompleteCacheDatabase.getAiTranslations (lib/core/autocomplete/autocomplete_cache_database.dart:91); AutocompleteCacheDatabase.putAiTranslations (lib/core/autocomplete/autocomplete_cache_database.dart:118); AutocompleteCacheDatabase.clearAiTranslationCache (lib/core/autocomplete/autocomplete_cache_database.dart:146); AnlasCalculator.novelAiUpscaleOpusFreeMaxInputPixels (lib/core/services/anlas_calculator.dart:19); AnlasCalculator.novelAiUpscaleMaxInputPixels (lib/core/services/anlas_calculator.dart:21). Rename to \u0060testNovelAiConnection\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/proxy_service.dart"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd4ed4ce9bee5111468deb0cb2ff4097b4f18bfe1de20f908742e023765a57a"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060hasNAISyntax\u0060 spells \u0060NAI\u0060 where 18 names in the project spell it \u0060Nai\u0060: 18 of 19 names in project repository.core spell the token \u0060Nai\u0060 (18 of 19; unit: names in project repository.core containing \u0060Nai\u0060). Peers: StorageKeys.qualityPresetNaiTier (lib/core/constants/storage_keys.dart:157); StorageKeys.comfyuiSeedvr2EmbedNaiMetadata (lib/core/constants/storage_keys.dart:404); LocalStorageService.getQualityPresetNaiTier (lib/core/storage/local_storage_service.dart:360); LocalStorageService.setQualityPresetNaiTier (lib/core/storage/local_storage_service.dart:369); ComfyuiPromptParser.toNaiCharacters (lib/core/utils/comfyui_prompt_parser.dart:59). Rename to \u0060hasNaiSyntax\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/sd_to_nai_converter.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b06d3b891ca69fd9c0a4d65ab1ad339d59b8849ddc3fcedd3e9894815de4b4"}},{"ruleId":"D28","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":"e331607ec71b1ba4f5fa755cc74bf30b9fedbc78a6c9fa66ff56c7c42e11e4ff"},"properties":{"commitSha":"6110f24297a6d13298cb0b4aca46595b450233b5"}},{"ruleId":"D28","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":"ce4e3574defd141853f3f8edf01701bdc450b2599db278df3778a1be400e6f4e"},"properties":{"commitSha":"450105cbd2f579d231501a93536c1ac0da50d6e0"}},{"ruleId":"D28","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":"d434e6f1dcb8b0b5dbaade2e894a2389a390b8234d0d973fb605182cce984b52"},"properties":{"commitSha":"0d90d46fda93f78e3c9c2da3e768c6aef977bfa7"}},{"ruleId":"D28","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":"a5504a25ad2d5878323b0b02ab6ba3437a64af8fece06cf64a578ad01e8b91cc"},"properties":{"commitSha":"6110f24297a6d13298cb0b4aca46595b450233b5"}},{"ruleId":"D28","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":"ebdd01663f8aef3162647bd02ac19ba855ba9d9c1895bbc2f0be044fdd30ae55"},"properties":{"commitSha":"450105cbd2f579d231501a93536c1ac0da50d6e0"}},{"ruleId":"D28","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":"30cb42844761631272e8d5f2e0dbbbf5d23113463dd2cee3ae16fdd582c9f70d"},"properties":{"commitSha":"0d90d46fda93f78e3c9c2da3e768c6aef977bfa7"}},{"ruleId":"D28","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":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"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":"993dd5ac2d8a991a166c8db234d4c9fd67c4e7e67405defa7d8439a35e336391"},"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":"270db3c1504b3b4b37eabd547026e3f651a7d72d185eafda863042c3298f4ac1"},"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":"68cf9755ca64a096156d32aaf0b2fab4ead6fe676c7491470308aee52d6b5cd3"},"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":"cf1e7cf35707ba8705003ca6a8eaf89a96dca6f7a744eb34629f30a48571490d"},"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":"d1baaf3f0ed1a8298eb4a008530426985464fb87233f7f728645cd7699bb5aed"},"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":"3ad3e736716b5db6129d4b6c18ac17ed1134e68e40211770df979f1b558a3f66"},"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":"b5ca4af9037d73424ccd3c35ae98cd34f23a32c483d3816335ec452173a14fdb"},"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":"7ac1f7b009ee1174de1dcbbd7795ec80d671d79465cd1a8bc0838c699646d81d"},"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":"6c114a325607208e66c8bd128381b24217fc3fb3e15990a7a6f1184fb46089b2"},"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":"f8555ea0d6d8b10b69058c4a182f2eb3075aacfc09c9444f8f8930b2e207f033"},"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":"d5fb26e8e9b30c1dda93f8b89842c4eb95bc88932ce4161a640a0a5ba15086e4"},"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":"0b728457d23efd0e966b4cb14ef5cc76a6d39cd55d0c5b2bf81a2d75a68d3e96"},"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":"98d93d7a057494b7e297e95716e95220647a358e69490c7bf8a7ea2bdc27c1db"},"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":"1cb111b84fbdb917d0dcf0fed8d24b27858789781a7e5e90a5ef78ab49d0bf8a"},"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":"d63652ad60e6798e45b227ca3a871fbbf7846b73fb8d31affbaf3903885337b3"},"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":"c0a5af72d258c10a54e0794411533431aaed512ec91e7f2308edb2307f27afae"},"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":"51b543842a1af8dcde756e25a847682c67241ccd833f89164142157680ed1719"},"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":"0907a3b5a0195775ff09dfbb7ad5037715d60fdae1da41ed1569032c519c961f"},"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":"1e2e537a2afa47a8abc91e8821ab1f40a0839749b292f1092cefa88611cbe72a"},"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":"4b314f4b402cbf3c2864b343e6fd068c063d534f63c1ac2ab31f4db5e653e832"},"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":"337860e46563abc1315c376966f76ec54c65761430438a889b10cb449537dbe8"},"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":"740f6117a85b2ae86f4ca1a816ffd0429f85d7012194b1261d862d8d7849e9e2"},"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":"553ac1b872e528a874614cfe91ed2133bae0e711a52f8c322ff57dc6687c59be"},"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":"d7b4773272eeaa93531bdb8d0c9418cc59ff4158bfa602b1cc86615035491491"},"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":"5be03ab325ce0dd57044d4e411f1428508ecf7870bea56774afff406be2e7ce3"},"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":"75369c09bb288495c1ec96550eb2aa9585bb73f2d0abcdd876376a94900b52cc"},"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":"50749de212a3370470477e4fe71bd326cc15563fe164b5d6fd17ed92b53d4c80"},"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":"4f92241376401502a76b0521c8325ec5ac4b2679a6c13f66166ec884cf715b80"},"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":"858eb7f80b7507dfba0c3f1f3da34922e68eec00c263f8d42558fd15e99292b9"},"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":"8606f05c0070a56b032a5446b3c57cf915c3ad0e7a8bb6732b9135b4c0bcf846"},"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":"6819b36024d45f5f0e1d43e74427f1e72c7d8dae5d09101e0f966a51bf6829ab"},"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":"3643ff687baaf09e4fa86f24721b381bb8ec583e4fb1bc9174a893ca376bdfb1"},"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":"3e69bb65e931d4477b3d0a19b63d603daa43996f51cd5c55b32fdf3dd471ae7f"},"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":"ae59d5e9dd2c30e110a21be3f2f3e4339df91ffb4154cfcf5f17bedb858ec684"},"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":"24bcc8189b69961073a2a81a26475bc0ac4b4627119c2067a001ba82a978dc0a"},"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":"0a25692745ad0ed3ca68036746171ef1bfebcc093c4887320630d8afff98acf8"},"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":"13b585bb5476145fb84e2340e75324151c67d8d8c2af773ee7b6768ce44075d9"},"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":"64478662fa5e1544368a8d37a73d78bfc90ea789fe52460bc2794d70b8e273b3"},"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":"620f44f7d0814af2bb598a515423618ad407110d7f6058f12541a5a3763e870d"},"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":"64aee044c1f4dd4bb7a77441c8cfb2ad1960dbe2c5bbb6dcc4a3af1fa08e7b62"},"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":"957b150e90b8de065e3fab913d6db8aa84cc38085b4826b482eaabde0c4cf347"},"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":"ecec37d0fc0115155450f8d04a7981c09e1f20c89fabd273aec44ce7202ffaa4"},"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":"60bc005e0040d628d6efe22bc328345b4107554ae2a70981d00671519ab34ff0"},"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":"f6e084f470836bfbdf888d6c62208f1a4b62f93036198979f92f78fb61f56142"},"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":"fe96620b28dd22e00a13d0a3e62e0f0db40d3433a110c5769a74450a5007cd34"},"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":"909e5d5a2e7e0be4a92e0da4f7aac787f9f6e77126fa016c82fe8608b93195d3"},"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":"79528a8d910bf2c0f85e68e83429da9e80cc844b353df264d85d4d086e89cc5b"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","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-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"b80643f7ec40313d0b37e5a5dad12bf494b9860695a64240f68cd06c0b12d367"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","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-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"e31915ae4cd850add14593d1bba14cd6b635166de420ff57e3c8336a5a43d518"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","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-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"06c43ccb754b6acd7c07b8b03d544017d86cef6f4f99adbeede30f6bf4928e10"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","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-3","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: 10 of 1565 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; 1565 of the 2118 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: tool/metadata/check_metadata_extraction.dart, lib/presentation/screens/settings/widgets/gallery_cache_actions.dart, lib/domain/entities/gallery_image_entity.dart, lib/presentation/providers/gallery_scan_progress_provider.dart, lib/domain/entities/gallery_entity_mapper.dart, tool/metadata/check_metadata_simple.dart, lib/core/exceptions/gallery_exceptions.dart, lib/data/services/gallery/scan_config.dart (and 2 more). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/metadata/check_metadata_extraction.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1023f3514870e134a2b39c67a4e976054b9714eea39b560aaafc9c0c2acd95"}},{"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/presentation/screens/settings/widgets/gallery_cache_actions.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"911460775c99bff4f4e168d38e0451e53ae77e5f8f598d602db2209a0cfb5371"}},{"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/data/services/gallery/scan_config.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0ab55bc1634c01d7621acb46feef6b2df69320923710777ffc789d2118b18d"}},{"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/presentation/providers/gallery_scan_progress_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24368db26665340f6df964121f2e7483e95adff6466470051b201138ed60b16b"}},{"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":"tool/metadata/check_metadata_simple.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4adde116b99da56740b7e65ea8fb9387b386397c98d9ee179391ae86404a740"}},{"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/domain/entities/gallery_image_entity.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cd1fd1c916b859c0e2e281182be18152a9ad5ab405e8f47565faea6c349c5e"}},{"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/core/exceptions/gallery_exceptions.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44db277fb6ae162312f4955d0deb87d5a89f57788700c350088fbe63532ea6ca"}},{"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/domain/entities/gallery_entity_mapper.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f6a46dc40a8cc2c8358d97b12a379a37049d1419f072927581a032a374444d"}},{"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":"tool/diagnostics/diagnose_sync.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d690d78317c09905326b9f38df42c98430d0f00c5b40992c4783f0c2cf87f3"}},{"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":"tool/macos_icon/make_macos_icons.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3bda91548e1ece92c6915316db1b1c9ee8d9767b877e275f26d87ae1f3a0fa"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: gallery_album_tree_view.dart \u2194 gallery_category_tree_view.dart: \u0060lib/presentation/widgets/gallery/gallery_album_tree_view.dart\u0060 and \u0060lib/presentation/widgets/gallery/gallery_category_tree_view.dart\u0060 change together 80% of the time (8 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 8 shared commits counted here, the most recent 3 are \u00603c7e67ee\u0060 fix(menu): \u5F39\u51FA\u83DC\u5355\u9879\u7EDF\u4E00\u6539\u7528 MenuActionLabel\uFF0C\u957F\u6587\u6848\u4E0E\u5927\u5B57\u53F7\u4E0B\u6362\u884C; \u00600ad7903d\u0060 fix(rename): \u5206\u7C7B\u6811\u3001\u76F8\u7C3F\u6811\u4E0E\u56FE\u5C42\u7684\u5C31\u5730\u91CD\u547D\u540D\u7EDF\u4E00\u53D6\u6D88\u884C\u4E3A; \u0060567c9d36\u0060 fix(drop): \u62D6\u653E\u56DE\u8C03\u53EA\u53D1\u8D77\u8BFB\u53D6\u540E\u7ACB\u5373\u8FD4\u56DE\uFF0C\u5927\u56FE\u62D6\u5165\u4E0D\u518D\u672A\u54CD\u5E94 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/gallery/gallery_album_tree_view.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05e89ed70cf6133b7a151d1b92094cff9e647fc9ecba65100cd7fd6ca42513b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: data_source_cache_provider.dart \u2194 data_source_cache_settings.dart: \u0060lib/core/database/providers/data_source_cache_provider.dart\u0060 and \u0060lib/presentation/screens/settings/widgets/data_source_cache_settings.dart\u0060 change together 71% of the time (10 of the 14 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060574b3ee8\u0060 feat(tags): \u652F\u6301\u4E94\u4E2A\u7C7B\u522B\u7684\u72EC\u7ACB\u70ED\u5EA6\u9608\u503C\u914D\u7F6E\u4E0E\u5206\u5C42\u62C9\u53D6 (at that commit the file was still \u0060lib/presentation/providers/data_source_cache_provider.dart\u0060); \u0060cf8945fb\u0060 feat(tags): \u6DFB\u52A0\u6807\u7B7E\u5206\u7C7B\u7EDF\u8BA1\u53CA\u5C55\u793A\u529F\u80FD (at that commit the file was still \u0060lib/presentation/providers/data_source_cache_provider.dart\u0060); \u006022aef414\u0060 perf(database): \u652F\u6301\u589E\u91CF\u5BFC\u5165\u53CA\u9884\u6784\u5EFA\u6570\u636E\u5E93gzip\u89E3\u538B (at that commit the file was still \u0060lib/presentation/providers/data_source_cache_provider.dart\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/providers/data_source_cache_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74326a01e47e2c41c68dfc2cf36fae2900ee4e6f713489bcc19accdaf7054f56"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: global_drop_handler.dart \u2194 image_destination_dialog.dart: \u0060lib/presentation/widgets/drop/global_drop_handler.dart\u0060 and \u0060lib/presentation/widgets/drop/image_destination_dialog.dart\u0060 change together 69% of the time (11 of the 16 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 11 shared commits counted here, the most recent 3 are \u0060b1a26419\u0060 feat(metadata): \u652F\u6301\u9009\u53D6\u63D0\u793A\u8BCD\u52A0\u5165\u8BCD\u5E93 (#112); \u0060b93e80fb\u0060 feat(generation): add reverse prompt drop destination; \u0060ab617d2c\u0060 feat(core): \u652F\u6301\u4ECE PNG \u56FE\u7247\u63D0\u53D6\u591A\u4E2A Vibe \u6570\u636E\uFF08Bundle\uFF09 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/drop/global_drop_handler.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aea33d0c551a651aea7db0700146aed41b0e376d8f4516b00095fc3bf57bf0b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: layer_painter.dart \u2194 layer_manager.dart: \u0060lib/presentation/widgets/image_editor/canvas/layer_painter.dart\u0060 and \u0060lib/presentation/widgets/image_editor/layers/layer_manager.dart\u0060 change together 67% of the time (8 of the 12 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060687817f2\u0060 fix(editor): \u91CD\u7ED8\u7F16\u8F91\u7EC4\u6A61\u76AE\u64E6\u53EA\u64E6\u7B14\u8FF9\u5E76\u6539\u4E3A\u5B9E\u65F6\u64E6\u9664; \u0060dea0877f\u0060 fix(editor): \u4FEE\u590D\u91CD\u7ED8\u754C\u9762\u653E\u5927\u540E\u5361\u987F\uFF0C\u8499\u7248\u91CD\u53E0\u5904\u4E0D\u518D\u52A0\u6DF1; \u0060a6a9c0aa\u0060 fix(editor): smooth scaled bitmap layers \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/image_editor/canvas/layer_painter.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc381ecedfbd686432148f45cbd7ee6e51e9f6f389b13ee46f07dab4ad788e2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: data_source_cache_provider.dart \u2194 warmup_provider.dart: \u0060lib/core/database/providers/data_source_cache_provider.dart\u0060 and \u0060lib/presentation/providers/warmup_provider.dart\u0060 change together 64% of the time (9 of the 14 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060574b3ee8\u0060 feat(tags): \u652F\u6301\u4E94\u4E2A\u7C7B\u522B\u7684\u72EC\u7ACB\u70ED\u5EA6\u9608\u503C\u914D\u7F6E\u4E0E\u5206\u5C42\u62C9\u53D6 (at that commit the file was still \u0060lib/presentation/providers/data_source_cache_provider.dart\u0060); \u0060cf8945fb\u0060 feat(tags): \u6DFB\u52A0\u6807\u7B7E\u5206\u7C7B\u7EDF\u8BA1\u53CA\u5C55\u793A\u529F\u80FD (at that commit the file was still \u0060lib/presentation/providers/data_source_cache_provider.dart\u0060); \u0060ce1dea88\u0060 refactor(danbooru): \u5347\u7EA7 Danbooru \u6807\u7B7E\u61D2\u52A0\u8F7D\u670D\u52A1\u5230 V3 \u67B6\u6784 (at that commit the file was still \u0060lib/presentation/providers/data_source_cache_provider.dart\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/providers/data_source_cache_provider.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5650df856dc84a01967d6a3667e47cd3578dbf89f6e9a23e96836f8197d07db8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: storage_keys.dart \u2194 generation_settings_notifiers.dart: \u0060lib/core/constants/storage_keys.dart\u0060 and \u0060lib/presentation/providers/generation/generation_settings_notifiers.dart\u0060 change together 64% of the time (7 of the 11 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, 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 \u0060e5f34835\u0060 feat(prompt): \u63D0\u793A\u8BCD\u8BBE\u7F6E\u6DFB\u52A0\u7C98\u8D34\u65F6\u8BC6\u522B\u591A\u89D2\u8272\u5F00\u5173; \u00607bc3dcf6\u0060 feat(generation): \u6DFB\u52A0\u6D41\u5F0F\u9884\u89C8\u5F00\u5173 (#151); \u0060d165d215\u0060 fix(prompt): \u6062\u590D\u9F20\u6807\u6EDA\u8F6E\u8C03\u6743\u529F\u80FD \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/constants/storage_keys.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed51820593b202b7fd907a17fed5926696739cae8a6e02304dd0b6f68e7709e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: prompt_assistant_overlay.dart \u2194 inline_character_editor.dart: \u0060lib/presentation/prompt_assistant/widgets/prompt_assistant_overlay.dart\u0060 and \u0060lib/presentation/widgets/character/inline_character_editor.dart\u0060 change together 64% of the time (7 of the 11 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, 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 \u006061d98b66\u0060 fix(prompt): \u9694\u79BB\u8F93\u5165\u6846\u6807\u7B7E\u6A21\u5F0F\u5E76\u7EDF\u4E00\u5171\u4EAB\u63A7\u4EF6; \u0060a5a06671\u0060 refactor(prompt): \u7EDF\u4E00\u63D0\u793A\u8BCD\u52A9\u624B\u5916\u58F3\u4E0E\u6302\u8F7D\u7EC4\u4EF6; \u00605a0cad8b\u0060 feat(prompt): \u652F\u6301\u52A9\u624B\u6807\u7B7E\u7FFB\u8BD1\u4E0E\u591A\u9009\u6210\u7EC4\u8C03\u6743 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/widgets/prompt_assistant_overlay.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8ab2e811478100d9a946d07429bde5ea4f31cb520eea90fb8b8ecb5836e782"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: vibe_file_storage_service.dart \u2194 vibe_library_screen.dart: \u0060lib/data/services/vibe_file_storage_service.dart\u0060 and \u0060lib/presentation/screens/vibe_library/vibe_library_screen.dart\u0060 change together 60% of the time (6 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060e7b6ba8c\u0060 fix(vibe): preserve library data during updates; \u0060a7f5b056\u0060 fix(vibe): \u4FEE\u6B63\u5DF2\u7F16\u7801 Vibe \u7684\u91CD\u590D\u7F16\u7801\u4E0E\u8BA1\u8D39\u663E\u793A; \u00602f92124d\u0060 fix(vibe): export website-compatible files \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/vibe_file_storage_service.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78498a10adc1944f5f66a8e1343fb59f648f5852f8de60fea3ccb947559751c2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: weight_adjust_toolbar.dart \u2194 unified_prompt_input.dart: \u0060lib/presentation/widgets/common/weight_adjust_toolbar.dart\u0060 and \u0060lib/presentation/widgets/prompt/unified/unified_prompt_input.dart\u0060 change together 58% of the time (7 of the 12 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, 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 \u00606a1074f9\u0060 fix(prompt): \u6309\u4F4F\u9F20\u6807\u62D6\u9009\u65F6\u6EDA\u8F6E\u53EA\u6EDA\u52A8\u63D0\u793A\u8BCD\uFF0C\u4E0D\u518D\u8C03\u6574\u6743\u91CD; \u0060b41b9113\u0060 fix(prompt): \u8865\u9F50\u6587\u672C\u6A21\u5F0F\u6279\u91CF\u7981\u7528\u4E0E\u542F\u7528\u5165\u53E3; \u0060d165d215\u0060 fix(prompt): \u6062\u590D\u9F20\u6807\u6EDA\u8F6E\u8C03\u6743\u529F\u80FD \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/widgets/common/weight_adjust_toolbar.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4432bed43b721118f65b387ad59b37278698cfd4dd327542dae4cc72d7d4651b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: vibe_export_utils.dart \u2194 vibe_library_screen.dart: \u0060lib/core/utils/vibe_export_utils.dart\u0060 and \u0060lib/presentation/screens/vibe_library/vibe_library_screen.dart\u0060 change together 50% of the time (5 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 \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u00602f92124d\u0060 fix(vibe): export website-compatible files; \u0060145490ed\u0060 feat(vibe): add zip export and speed up export dialog; \u00604d3f84ce\u0060 feat(vibe): preserve bundle parameters and raw sources \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/vibe_export_utils.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff059d5216bd79bd15578dccd60d9118b13eae900a95bc9d3f4749c28c8e6cb"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6eb5a94052c328a9f9d4f3228923a5f2d4d56700f96d3ddbb1b358415402983"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","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":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider derivativeCopySaverProvider captures autoDispose systemGalleryPublisherProvider: \u0060derivativeCopySaverProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(systemGalleryPublisherProvider\u2026)\u0060, which is declared auto-dispose (lib/presentation/providers/image_save_settings_provider.dart:113). Read in build, \u0060systemGalleryPublisherProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060derivativeCopySaverProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060systemGalleryPublisherProvider\u0060 keepAlive too, make \u0060derivativeCopySaverProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/derivatives/derivative_copy_saver.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81e31a5663480969ba2c59c796434aafcf40ded1d37561bd9f86da4d2e68f14"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider derivativeCopySaverProvider captures autoDispose localStorageServiceProvider: \u0060derivativeCopySaverProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). Read in build, \u0060localStorageServiceProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060derivativeCopySaverProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060derivativeCopySaverProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/screens/derivatives/derivative_copy_saver.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fea5e27e1032b62daad7472ca16410009ce849472fb8b5f4f908d91da155d5e"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider bulkOperationNotifierProvider captures autoDispose bulkOperationServiceProvider: \u0060bulkOperationNotifierProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(bulkOperationServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/presentation/providers/bulk_operation_provider.dart:185). Read in build, \u0060bulkOperationServiceProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060bulkOperationNotifierProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060bulkOperationServiceProvider\u0060 keepAlive too, make \u0060bulkOperationNotifierProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/bulk_operation_provider.dart"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"923dff04bb5291f8fd68b5dd384e0199e4910c5f770e79c6dc6f5e3c6ffd2adf"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider characterPromptNotifierProvider captures autoDispose characterPromptRepositoryProvider: \u0060characterPromptNotifierProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(characterPromptRepositoryProvider\u2026)\u0060, which is declared auto-dispose (lib/data/repositories/character_prompt_repository.dart:83). Read in build, \u0060characterPromptRepositoryProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060characterPromptNotifierProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060characterPromptRepositoryProvider\u0060 keepAlive too, make \u0060characterPromptNotifierProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/character_prompt_provider.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c158f3d962d56cfd758ba139592c5fcd7f8b4a3a8a7a82d690493d7712558f"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider compositionGuideNotifierProvider captures autoDispose localStorageServiceProvider: \u0060compositionGuideNotifierProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). Read in build, \u0060localStorageServiceProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060compositionGuideNotifierProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060compositionGuideNotifierProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/composition_guide_provider.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb0c198fb997e601dabee17fee6e35b1824eaa5deb3f513d9347c7f76b81428"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider dlssProvider captures autoDispose localStorageServiceProvider: \u0060dlssProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). Read in build, \u0060localStorageServiceProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060dlssProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060dlssProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/dlss_provider.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"070c9bc3861134b8a56b8bb8d2211f32b68d8fe351f5fedc4b31f31a75c7ec97"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider fixedTagsNotifierProvider captures autoDispose localStorageServiceProvider: \u0060fixedTagsNotifierProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060localStorageServiceProvider\u0060 is never disposed \u2014 the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060fixedTagsNotifierProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/fixed_tags_provider.dart"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7eaf8d359a4866e7802eed064283d3d8b27e078ec5a629b098faaf086bb7841"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider historyClickBehaviorNotifierProvider captures autoDispose localStorageServiceProvider: \u0060historyClickBehaviorNotifierProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). Read in build, \u0060localStorageServiceProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060historyClickBehaviorNotifierProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060historyClickBehaviorNotifierProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/history_click_behavior_provider.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8ee2a79cc66693f7ca8817abe8a037cbf5911c1030abf8e59796e05c678c0a"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider imageComparisonFollowMouseProvider captures autoDispose localStorageServiceProvider: \u0060imageComparisonFollowMouseProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060localStorageServiceProvider\u0060 is never disposed \u2014 the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060imageComparisonFollowMouseProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/image_comparison_preferences_provider.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e94aabb12a86ef140e8baece8b3c4d834b465f15411679b28bb1e6d5f4903d"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider imageSaveSettingsNotifierProvider captures autoDispose localStorageServiceProvider: \u0060imageSaveSettingsNotifierProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). Read in build, \u0060localStorageServiceProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060imageSaveSettingsNotifierProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060imageSaveSettingsNotifierProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/image_save_settings_provider.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8461cf5c8bc5880e5270f7ab9d061de708f0938b796efc8af0e4f6f98270eb86"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider notificationSettingsNotifierProvider captures autoDispose localStorageServiceProvider: \u0060notificationSettingsNotifierProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). Read in build, \u0060localStorageServiceProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060notificationSettingsNotifierProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060notificationSettingsNotifierProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/notification_settings_provider.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d425f3346589b4e688d4a59c3bc0aac64cb62ae6ff6cb58d4f897976fcbf385"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider onlineGalleryLocalFavoritesRepositoryProvider captures autoDispose localStorageServiceProvider: \u0060onlineGalleryLocalFavoritesRepositoryProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060localStorageServiceProvider\u0060 is never disposed \u2014 the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060onlineGalleryLocalFavoritesRepositoryProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/online_gallery_local_favorites_provider.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ee416b9f47827dba3f67ff301c901c422938ed6cce5e56ee07706441426b39"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider previewTransparencyNotifierProvider captures autoDispose localStorageServiceProvider: \u0060previewTransparencyNotifierProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). Read in build, \u0060localStorageServiceProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060previewTransparencyNotifierProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060previewTransparencyNotifierProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/preview_transparency_provider.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"637e1358742b9b1275164a60afd6d4c09d5d6d0b04d49c5b4afc8f013fda0eb4"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider promptTokenUsageProvider captures autoDispose currentQualityEntryProvider: \u0060promptTokenUsageProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(currentQualityEntryProvider\u2026)\u0060, which is declared auto-dispose (lib/presentation/providers/quality_preset_provider.dart:214). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060currentQualityEntryProvider\u0060 is never disposed \u2014 the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark \u0060currentQualityEntryProvider\u0060 keepAlive too, make \u0060promptTokenUsageProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/prompt_token_counter_provider.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"783e129d60ffaf6c1656adda25442535f9f2b1a2424f6e8f6974cf7f25dc5c65"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider promptTokenUsageProvider captures autoDispose currentUcEntryProvider: \u0060promptTokenUsageProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(currentUcEntryProvider\u2026)\u0060, which is declared auto-dispose (lib/presentation/providers/uc_preset_provider.dart:159). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060currentUcEntryProvider\u0060 is never disposed \u2014 the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark \u0060currentUcEntryProvider\u0060 keepAlive too, make \u0060promptTokenUsageProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/prompt_token_counter_provider.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1e1eaf9d1d24fcb6339727675c0750f21983fd82dbc0afa040f20a65a3a0a6"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider queueExecutionNotifierProvider captures autoDispose queueStateStorageProvider: \u0060queueExecutionNotifierProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(queueStateStorageProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/queue_state_storage.dart:150). Read in build, \u0060queueStateStorageProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060queueExecutionNotifierProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060queueStateStorageProvider\u0060 keepAlive too, make \u0060queueExecutionNotifierProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/queue_execution_provider.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"c366eaf239b61ca0529081bd6eaa15cedea6082def42b1da1774f031a5a2468c"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider quickTagCloudUserServiceProvider captures autoDispose localStorageServiceProvider: \u0060quickTagCloudUserServiceProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060localStorageServiceProvider\u0060 is never disposed \u2014 the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060quickTagCloudUserServiceProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/quick_tag_cloud_gallery_provider.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"489f7c8e25ab576faaac994f42f5b00de9b6c4bc84ab056e704d43db2a4b6ac6"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider replicationQueueNotifierProvider captures autoDispose replicationQueueStorageProvider: \u0060replicationQueueNotifierProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(replicationQueueStorageProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/replication_queue_storage.dart:61). Read in build, \u0060replicationQueueStorageProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060replicationQueueNotifierProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060replicationQueueStorageProvider\u0060 keepAlive too, make \u0060replicationQueueNotifierProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/replication_queue_provider.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d47ee3e3ad9c0343cc3d756f88bb7fa25bf1c108a8f2c4fde1a0151c11714fb"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider replicationQueueNotifierProvider captures autoDispose queueStateStorageProvider: \u0060replicationQueueNotifierProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(queueStateStorageProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/queue_state_storage.dart:150). Read in build, \u0060queueStateStorageProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060replicationQueueNotifierProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060queueStateStorageProvider\u0060 keepAlive too, make \u0060replicationQueueNotifierProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/replication_queue_provider.dart"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"402908528df73d98dc8c15a1418aa5443d3eb29bbf2d395d2c64681362d2d7f0"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider startupInitializationTasksProvider captures autoDispose localStorageServiceProvider: \u0060startupInitializationTasksProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). Read in build, \u0060localStorageServiceProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060startupInitializationTasksProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060startupInitializationTasksProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/startup_initialization_provider.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa3104cb9618f31fb5a7d9dc3124b94f20cb40d6c85bdc56e065f7e898a983b"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider startupInitializationTasksProvider captures autoDispose layoutStateNotifierProvider: \u0060startupInitializationTasksProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(layoutStateNotifierProvider\u2026)\u0060, which is declared auto-dispose (lib/presentation/providers/layout_state_provider.dart:81). Read in build, \u0060layoutStateNotifierProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060startupInitializationTasksProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060layoutStateNotifierProvider\u0060 keepAlive too, make \u0060startupInitializationTasksProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/startup_initialization_provider.dart"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b7f11e24041bf982915e57db6900d88a89dbf50b6c31ad95e3b04f75aa063c"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider anlasBalanceWatcherProvider captures autoDispose anlasBalanceProvider: \u0060anlasBalanceWatcherProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(anlasBalanceProvider\u2026)\u0060, which is declared auto-dispose (lib/presentation/providers/subscription_provider.dart:600). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060anlasBalanceProvider\u0060 is never disposed \u2014 the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark \u0060anlasBalanceProvider\u0060 keepAlive too, make \u0060anlasBalanceWatcherProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/subscription_provider.dart"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2e8f930d9f4f535a3eb7b098123cc5c54f5e1bc77e725aab8656a7c7a01801"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider tagLibraryPageNotifierProvider captures autoDispose localStorageServiceProvider: \u0060tagLibraryPageNotifierProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060localStorageServiceProvider\u0060 is never disposed \u2014 the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060tagLibraryPageNotifierProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/tag_library_page_provider.dart"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"63617887391339bf6b6e9bbfbfca2c36d15098b0c146b9df1ed081f5af94f5cd"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider kritaBridgeNotifierProvider captures autoDispose localStorageServiceProvider: \u0060kritaBridgeNotifierProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). Read in build, \u0060localStorageServiceProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060kritaBridgeNotifierProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060kritaBridgeNotifierProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/krita/krita_bridge_notifier.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"da953f3c1fd0e1e3a7cf22441d8a7fc22b0fbb1529b8ad48b3b07fba9af91f79"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider generationParamsNotifierProvider captures autoDispose localStorageServiceProvider: \u0060generationParamsNotifierProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). Read in build, \u0060localStorageServiceProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060generationParamsNotifierProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060generationParamsNotifierProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/generation/generation_params_notifier.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c153ef9861a3f0ee9fef3ed6317a100bd769c74576b560055c68ca52dc52a3"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider comfyUISettingsProvider captures autoDispose localStorageServiceProvider: \u0060comfyUISettingsProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). Read in build, \u0060localStorageServiceProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060comfyUISettingsProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060comfyUISettingsProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/comfyui/comfyui_provider.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26bec59cd9fa5b5250d1ca34923d4f60aa6003adb4a11430548fc92e897d2f2"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider cloudSyncApplicationServiceProvider captures autoDispose localStorageServiceProvider: \u0060cloudSyncApplicationServiceProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060localStorageServiceProvider\u0060 is never disposed \u2014 the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060cloudSyncApplicationServiceProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/providers/cloud_sync/cloud_sync_provider_wiring.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb16f625367f8da23f7f2305807196875a8fd7f9def4ba846de3f73b021250d"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider promptAssistantDioProvider captures autoDispose currentProxyAddressProvider: \u0060promptAssistantDioProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(currentProxyAddressProvider\u2026)\u0060, which is declared auto-dispose (lib/core/network/proxy_settings_provider.dart:92). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060currentProxyAddressProvider\u0060 is never disposed \u2014 the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark \u0060currentProxyAddressProvider\u0060 keepAlive too, make \u0060promptAssistantDioProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/services/prompt_assistant_service.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56fd69c1bdf8df0d7050c7302dc0df0947fe50a0ea677a213392b3f642ae70c"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider webAccessDioProvider captures autoDispose currentProxyAddressProvider: \u0060webAccessDioProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(currentProxyAddressProvider\u2026)\u0060, which is declared auto-dispose (lib/core/network/proxy_settings_provider.dart:92). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060currentProxyAddressProvider\u0060 is never disposed \u2014 the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark \u0060currentProxyAddressProvider\u0060 keepAlive too, make \u0060webAccessDioProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/providers/web_access_provider.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adc1561f994fd3edc581d3f6d2b366c2b23559aec8878918e0cb6d714eb6b92"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider webReaderDioProvider captures autoDispose currentProxyAddressProvider: \u0060webReaderDioProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(currentProxyAddressProvider\u2026)\u0060, which is declared auto-dispose (lib/core/network/proxy_settings_provider.dart:92). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060currentProxyAddressProvider\u0060 is never disposed \u2014 the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark \u0060currentProxyAddressProvider\u0060 keepAlive too, make \u0060webReaderDioProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/providers/web_access_provider.dart"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3ce2c14c7f613f7e44eddc09a8a9695f58d0b7fd9914d474b3465dd1c56601"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider webAccessGatewayProvider captures autoDispose currentProxyAddressProvider: \u0060webAccessGatewayProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(currentProxyAddressProvider\u2026)\u0060, which is declared auto-dispose (lib/core/network/proxy_settings_provider.dart:92). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060currentProxyAddressProvider\u0060 is never disposed \u2014 the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark \u0060currentProxyAddressProvider\u0060 keepAlive too, make \u0060webAccessGatewayProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/prompt_assistant/providers/web_access_provider.dart"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3c3529edc0db557734176a18a61590c30b28b2f55ac5a3925a5d0941e9e23e"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider mcpServerNotifierProvider captures autoDispose localStorageServiceProvider: \u0060mcpServerNotifierProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). Read in build, \u0060localStorageServiceProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060mcpServerNotifierProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060mcpServerNotifierProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/mcp/providers/mcp_server_notifier.dart"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f623400f4768d1a46e4074efea96be1dbc4d689656767f899cb5c0fdce800d38"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider agentChatDockProvider captures autoDispose localStorageServiceProvider: \u0060agentChatDockProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). Read in build, \u0060localStorageServiceProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060agentChatDockProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060agentChatDockProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/presentation/agent_chat/providers/agent_chat_dock_provider.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0daf018b90cfa0451f3efcf6eebd11bbe501ab9ef3dbcfd844196d7fa7cd48"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider discordShareServiceProvider captures autoDispose localStorageServiceProvider: \u0060discordShareServiceProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060localStorageServiceProvider\u0060 is never disposed \u2014 the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060discordShareServiceProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/discord_share_service.dart"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61a0614d309927004d258be7f69db5264f2a418d7c01d4028b90b4f193e3d49"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider localOnnxModelServiceProvider captures autoDispose localStorageServiceProvider: \u0060localOnnxModelServiceProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). Read in build, \u0060localStorageServiceProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060localOnnxModelServiceProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060localOnnxModelServiceProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/local_onnx_model_service.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"faccbcf49985835a3354076b2921edf55b7154cca2382dcc78286321fd1e2d97"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider metadataImportSelectionStoreProvider captures autoDispose localStorageServiceProvider: \u0060metadataImportSelectionStoreProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060localStorageServiceProvider\u0060 is never disposed \u2014 the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060metadataImportSelectionStoreProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/services/metadata_import_selection_store.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"58db117751e7d3c6978afe3a65e4ee2620649ce45fb5df87f83fde271953539d"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider onlineGalleryBlacklistRepositoryProvider captures autoDispose localStorageServiceProvider: \u0060onlineGalleryBlacklistRepositoryProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). Read in build, \u0060localStorageServiceProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060onlineGalleryBlacklistRepositoryProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060onlineGalleryBlacklistRepositoryProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/repositories/online_gallery_blacklist_repository.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"912a4fd8240b12c1bb4a078c085b67069d44005e59477ee3c5686067c10d3095"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider naiImageGenerationApiServiceProvider captures autoDispose naiImageEnhancementApiServiceProvider: \u0060naiImageGenerationApiServiceProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(naiImageEnhancementApiServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/data/datasources/remote/nai_image_enhancement_api_service.dart:374). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060naiImageEnhancementApiServiceProvider\u0060 is never disposed \u2014 the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark \u0060naiImageEnhancementApiServiceProvider\u0060 keepAlive too, make \u0060naiImageGenerationApiServiceProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/data/datasources/remote/nai_image_generation_api_service.dart"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7793ea2501428fce9e0f54edba46c6f08f8a46a39909d92b623107464c29690"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider _updateCheckServiceFutureProvider captures autoDispose gitHubApiServiceProvider: \u0060_updateCheckServiceFutureProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(gitHubApiServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/data/datasources/remote/github_api_service.dart:442). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060gitHubApiServiceProvider\u0060 is never disposed \u2014 the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark \u0060gitHubApiServiceProvider\u0060 keepAlive too, make \u0060_updateCheckServiceFutureProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/services/update_check_service.dart"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"43639cf8988fe28fd8596044337285d8786106b7fc68ed9969541afa3b9dfd44"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider _updateCheckServiceFutureProvider captures autoDispose localStorageServiceProvider: \u0060_updateCheckServiceFutureProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060localStorageServiceProvider\u0060 is never disposed \u2014 the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060_updateCheckServiceFutureProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/services/update_check_service.dart"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2eeb57a29fdbbf42c23342540e39e39822c35b6ef326b06ef40d2063013a3c0"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider _updateCheckServiceFutureProvider captures autoDispose appInstallationServiceProvider: \u0060_updateCheckServiceFutureProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(appInstallationServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/services/app_installation_service.dart:148). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060appInstallationServiceProvider\u0060 is never disposed \u2014 the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark \u0060appInstallationServiceProvider\u0060 keepAlive too, make \u0060_updateCheckServiceFutureProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/services/update_check_service.dart"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2a51d24c79c4f230c16654c5545351bc110112843db4c33db1abd5b5bd5d5c"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider dioClientProvider captures autoDispose currentProxyAddressProvider: \u0060dioClientProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.watch(currentProxyAddressProvider\u2026)\u0060, which is declared auto-dispose (lib/core/network/proxy_settings_provider.dart:92). The keep-alive provider listens to it for the life of the ProviderContainer, so \u0060currentProxyAddressProvider\u0060 is never disposed \u2014 the auto-dispose lifetime it declares never happens, and whatever it holds (a socket, a controller, a stale value) is kept for every later reader. Mark \u0060currentProxyAddressProvider\u0060 keepAlive too, make \u0060dioClientProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/network/dio_client.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a573ada6969bb3030d94a72b23b5b824990821f893e00c4a91bedb889356465c"}},{"ruleId":"AX1","level":"error","message":{"text":"Captive dependency: keepAlive provider autocompleteSettingsProvider captures autoDispose localStorageServiceProvider: \u0060autocompleteSettingsProvider\u0060 is a keep-alive Riverpod provider and calls \u0060ref.read(localStorageServiceProvider\u2026)\u0060, which is declared auto-dispose (lib/core/storage/local_storage_service.dart:1233). Read in build, \u0060localStorageServiceProvider\u0060 has no listener once the read returns, so it is disposed at once \u2014 its ref.onDispose closes what it handed out \u2014 while \u0060autocompleteSettingsProvider\u0060 keeps that value for the life of the ProviderContainer. Mark \u0060localStorageServiceProvider\u0060 keepAlive too, make \u0060autocompleteSettingsProvider\u0060 auto-dispose, or read it per use outside build."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/autocomplete/autocomplete_settings.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6205dc9d19f9400fffcf7d1a3a2bb6708016065af3cb2af8f676e6d2806aba38"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: FileSystem (18 abstract methods): \u0060FileSystem\u0060 declares 18 abstract methods: \u0060cwd\u0060, \u0060absolutePath\u0060, \u0060joinPath\u0060, \u0060readTextFile\u0060, \u0060readTextLines\u0060, \u0060readBinaryFile\u0060, \u0060writeFile\u0060, \u0060appendFile\u0060, \u0060renameFile\u0060, \u0060fileInfo\u0060, \u0060listDir\u0060, \u0060canonicalPath\u0060, \u0060exists\u0060, \u0060createDir\u0060, \u0060remove\u0060, \u0060createTempDir\u0060, \u0060createTempFile\u0060, \u0060cleanup\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/core/agent/harness/harness_types.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ab68851b0de4c620e5af037bca994795192af6cb50f83c53a3a026fab18e11"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: SessionStorage (17 abstract methods): \u0060SessionStorage\u0060 declares 17 abstract methods: \u0060getMetadata\u0060, \u0060getLanes\u0060, \u0060createLane\u0060, \u0060moveLane\u0060, \u0060appendEntry\u0060, \u0060appendRecord\u0060, \u0060getEntry\u0060, \u0060findEntries\u0060, \u0060findEntriesOnBranch\u0060, \u0060findRecords\u0060, \u0060findOpenOperations\u0060, \u0060getLog\u0060, \u0060getName\u0060, \u0060setName\u0060, \u0060getLabel\u0060, \u0060setLabel\u0060, \u0060getStats\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/core/agent/harness/session/session_types.dart"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"539afaccd098cdf2a59124ee06bf9a2f37c690a9a93081762be16255f55fd7e3"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: GalleryAlbumRepository (17 abstract methods): \u0060GalleryAlbumRepository\u0060 declares 17 abstract methods: \u0060createAlbum\u0060, \u0060renameAlbum\u0060, \u0060updateAlbumDescription\u0060, \u0060moveAlbum\u0060, \u0060updateAlbumCover\u0060, \u0060deleteAlbum\u0060, \u0060getAlbums\u0060, \u0060addImagesToAlbum\u0060, \u0060removeImagesFromAlbum\u0060, \u0060getAlbumImageIdsWithDescendants\u0060, \u0060getAlbumFilePathsWithDescendants\u0060, \u0060getAllAlbumMemberPaths\u0060, \u0060clearAllAlbums\u0060, \u0060importAlbums\u0060, \u0060applyCloudSyncAlbums\u0060, \u0060rebindPendingPaths\u0060, \u0060moveAlbumToSlot\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/core/database/datasources/gallery_album_repository.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5421527a37222264d402056c45e6b5f06a0e7d8ae595d98a37d340225abc511c"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: LocalGalleryService (24 abstract methods): \u0060LocalGalleryService\u0060 declares 24 abstract methods: \u0060isInitialized\u0060, \u0060initialize\u0060, \u0060getPage\u0060, \u0060queryPage\u0060, \u0060getImageIdByPath\u0060, \u0060applyFilter\u0060, \u0060toggleFavorite\u0060, \u0060isFavorite\u0060, \u0060getFavoriteCount\u0060, \u0060getMetadata\u0060, \u0060refresh\u0060, \u0060addNewImageImmediately\u0060, \u0060removeDeletedImagesImmediately\u0060, \u0060filteredCount\u0060, \u0060totalCount\u0060, \u0060currentFilter\u0060, \u0060setSearchQuery\u0060, \u0060setDateRange\u0060, \u0060setShowFavoritesOnly\u0060, \u0060setPageSize\u0060, \u0060clearFilters\u0060, \u0060dispose\u0060, \u0060getRecordsByPaths\u0060, \u0060getFilteredImagePaths\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/data/services/gallery/local_gallery_service.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba80cd66c25331b4eefef9b44ddb8d27eb580cf5ae8aeeac4a59765a281a3918"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: VibeLibraryRepositoryProtocol (27 abstract methods): \u0060VibeLibraryRepositoryProtocol\u0060 declares 27 abstract methods: \u0060init\u0060, \u0060ensureInit\u0060, \u0060readEntry\u0060, \u0060putEntry\u0060, \u0060deleteEntry\u0060, \u0060clearEntries\u0060, \u0060readAllEntries\u0060, \u0060forEachEntry\u0060, \u0060firstEntryWhere\u0060, \u0060containsEntry\u0060, \u0060readDisplayEntries\u0060, \u0060replaceDisplayEntries\u0060, \u0060upsertDisplayEntryIfReady\u0060, \u0060deleteDisplayEntryIfReady\u0060, \u0060readThumbnail\u0060, \u0060putThumbnail\u0060, \u0060deleteThumbnail\u0060, \u0060clearThumbnails\u0060, \u0060isDisplayCacheReady\u0060, \u0060setDisplayCacheReady\u0060, \u0060readCategories\u0060, \u0060readCategory\u0060, \u0060putCategory\u0060, \u0060putCategories\u0060, \u0060deleteCategory\u0060, \u0060clearCategories\u0060, \u0060close\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/data/services/vibe_library_storage_protocol.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe353b56c681d987067ab54bac6ff6dac90845cfbecb1e16f06223c1c34fd84"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: AppLocalizations (4672 abstract methods): \u0060AppLocalizations\u0060 declares 4672 abstract methods: \u0060sidebarSort_title\u0060, \u0060sidebarSort_saveAfterMoveFailed\u0060, \u0060sidebarSort_original\u0060, \u0060sidebarSort_nameAscending\u0060, \u0060sidebarSort_nameDescending\u0060, \u0060sidebarSort_countDescending\u0060, \u0060sidebarSort_countAscending\u0060, \u0060gallery_resizeSidebar\u0060, \u0060cardAction_singleScope\u0060, \u0060cardDrag_preparingCount\u0060, \u0060cardDrop_unsupported\u0060, \u0060cardAction_batchFailed\u0060, \u0060generation_enhancementFailed\u0060, \u0060generation_enhancementRetryHint\u0060, \u0060generation_enhancementPreparing\u0060, \u0060generation_enhancementRunning\u0060, \u0060generation_enhancementFinalizing\u0060, \u0060app_title\u0060, \u0060app_subtitle\u0060, \u0060desktopWindow_minimize\u0060, \u0060desktopWindow_maximize\u0060, \u0060desktopWindow_restore\u0060, \u0060desktopWindow_close\u0060, \u0060common_cancel\u0060, \u0060common_confirm\u0060, \u0060common_continue\u0060, \u0060common_selectAll\u0060, \u0060common_deselectAll\u0060, \u0060common_save\u0060, \u0060common_delete\u0060, \u0060common_edit\u0060, \u0060common_close\u0060, \u0060common_clear\u0060, \u0060common_copy\u0060, \u0060common_copied\u0060, \u0060common_export\u0060, \u0060common_import\u0060, \u0060common_loading\u0060, \u0060common_error\u0060, \u0060common_secureStorageUnavailable\u0060, and 4632 more. 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/l10n/app_localizations.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fe7ecfd7d0347f61e13639799b7efef931a53b69580a81c3951e891578014f"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: CloudSyncUiPort (22 abstract methods): \u0060CloudSyncUiPort\u0060 declares 22 abstract methods: \u0060testConnection\u0060, \u0060detectRemote\u0060, \u0060connect\u0060, \u0060authorizeCloudDrive\u0060, \u0060cancelCloudDriveAuthorization\u0060, \u0060discardCloudDriveAuthorization\u0060, \u0060pushNow\u0060, \u0060pullNow\u0060, \u0060applyPendingPreview\u0060, \u0060pause\u0060, \u0060resume\u0060, \u0060cancel\u0060, \u0060previewRestoreSnapshot\u0060, \u0060confirmRestoreSnapshot\u0060, \u0060refreshHistory\u0060, \u0060deleteRemoteNamespace\u0060, \u0060updateContentSelection\u0060, \u0060rebuildCompactBackup\u0060, \u0060disconnect\u0060, \u0060resolveConflict\u0060, \u0060resolveAllConflicts\u0060, \u0060respondToFfdkjInstallIntent\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/presentation/providers/cloud_sync/cloud_sync_ui_provider.dart"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bce6b647c215dc6415acad317840219a671dc395b3f202dfc3643dd72ff0be4"}},{"ruleId":"ED4","level":"error","message":{"text":"Dual write (no outbox): ConnectionPool.release: \u0060ConnectionPool.release\u0060 performs two independent DURABLE writes \u2014 \u0060_evictingConnections\u0060 (a durable store) and \u0060_evictingStartTimes\u0060 (a second durable store) \u2014 in one command path with no shared transaction or outbox. A crash between the two leaves the stores diverged (one write committed, the other lost) or emits a phantom record. Wrap both in one transaction, or record the second write in the same store and dispatch it afterwards (a transactional outbox)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/connection_pool.dart"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8fe47f59ce17c091a81a9a49baeaf5d5c79c34baddebea5d8f6eace96725f8"}},{"ruleId":"ED4","level":"error","message":{"text":"Dual write (no outbox): ConnectionPool._startEvictionTimer: \u0060ConnectionPool._startEvictionTimer\u0060 performs two independent DURABLE writes \u2014 \u0060_evictingConnections\u0060 (a durable store) and \u0060_evictingStartTimes\u0060 (a second durable store) \u2014 in one command path with no shared transaction or outbox. A crash between the two leaves the stores diverged (one write committed, the other lost) or emits a phantom record. Wrap both in one transaction, or record the second write in the same store and dispatch it afterwards (a transactional outbox)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/database/connection_pool.dart"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80869f2d0493c3122d8c44433b9ccd0c21bce7d13c5e87ecbdff43cae82f9ee"}},{"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":"note","message":{"text":"Logging is not universal: Only 1/4 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060macos\u0060, \u0060packages/nai_png_codec\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add 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 6 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/pull-request-validation.yml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060android/app/build.gradle\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/build.gradle"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad662af1302d0b0cd9c8eb340e0467f381e386c855803db76d90d42612ff59e6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060_listAll\u0060 is async and calls listSync \u2014 a blocking call inside async code stalls the isolate\u0027s event loop \u2014 every other event, on Flutter the next frame, waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/harness/session/jsonl/session_jsonl_repository.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6312dc920cd9878e175cb73aff3a6c43c2cf5d2a53f21b75379ac7bfb109631d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060delete\u0060 is async and calls deleteSync \u2014 a blocking call inside async code stalls the isolate\u0027s event loop \u2014 every other event, on Flutter the next frame, waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/agent/harness/session/jsonl/session_jsonl_repository.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca62365f5fcd390ea1254c4f4ccf9dd4ac6893ab61b711243ef7dda3468e93a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060_loadCustomTemplates\u0060 is async and calls listSync \u2014 a blocking call inside async code stalls the isolate\u0027s event loop \u2014 every other event, on Flutter the next frame, waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/comfyui/workflow_template_manager.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5009006108f5e1fcf1d7d726aa5f29761173296411d94565f78302cc2fc5e76"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060cleanupOrphanedAvatars\u0060 is async and calls listSync \u2014 a blocking call inside async code stalls the isolate\u0027s event loop \u2014 every other event, on Flutter the next frame, waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/services/avatar_service.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61624b73875e7068c17e5c1eaba1321eaa76aaf2b86168049cc7c43a063133c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fromNaiV4VibeFile\u0060 is async and calls readAsBytesSync \u2014 a blocking call inside async code stalls the isolate\u0027s event loop \u2014 every other event, on Flutter the next frame, waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/vibe_file_parser.dart"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06b360691aebe45397550b92ee5cb0ea63364baee785b13172ddebd769a47a5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fromBundleFile\u0060 is async and calls readAsBytesSync \u2014 a blocking call inside async code stalls the isolate\u0027s event loop \u2014 every other event, on Flutter the next frame, waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/core/utils/vibe_file_parser.dart"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c96cdfec2e1f914fa31f367d362933de8c7f741a380455784ab1708b2dd79d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!RegExp(r\u0027^[a-z0-9](?:[a-z0-9-]{0,62}[a-z0-9])?$\u0027).hasMatch(name) || name.contains(\u0027--\u0027)\u0060 appears character-identically in 2 files \u2014 lib/core/agent/skill_archive_extractor.dart, lib/core/agent/skill_catalog.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/core/agent/skill_archive_extractor.dart"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0d58902fbd31c89260015dea80f0c135673b4c060a6dc4f325a2cc959f7b66"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!_isBusy \u0026\u0026 !ref.read(generationCooldownProvider).isActive\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/generation/desktop_layout.dart, lib/presentation/screens/generation/web_style_layout.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/presentation/screens/generation/desktop_layout.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5aead93813509025b35b51d0eb77b1e2dd01496d092b9b1e98fb32e25bc465c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!_isInitialized || _box == null || !_box!.isOpen\u0060 appears character-identically in 2 files \u2014 lib/data/datasources/local/pool_cache_service.dart, lib/data/datasources/local/tag_group_cache_service.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/data/datasources/local/pool_cache_service.dart"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"9622ce96743d0a99bfb3c274488cf2444c3d8e283d69493c921aff36be1ef149"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!await target.exists() \u0026\u0026 await backup.exists()\u0060 appears character-identically in 2 files \u2014 lib/core/autocomplete/cooccurrence_pack_repository.dart, lib/data/services/inpaint_draft_file_store.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/core/autocomplete/cooccurrence_pack_repository.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd20e6848716d3523b512123267142aa399ee11aada5f99a3227b75f63ac840d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!context.mounted || !session.accepts(epoch)\u0060 appears character-identically in 2 files \u2014 lib/presentation/widgets/image_editor/controllers/magic_wand_controller.dart, lib/presentation/widgets/image_editor/effects/image_editor_effects_controller.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/presentation/widgets/image_editor/controllers/magic_wand_controller.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7254a7645ecf41f45c5841c2dfabb088eca06e815aa0c416a02aa3b6be32b54"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!coordinate.isFinite || coordinate \u003C 0 || coordinate \u003E 1\u0060 appears character-identically in 2 files \u2014 lib/presentation/agent_chat/services/generation_character_orchestration.dart, lib/presentation/agent_chat/services/prompt_toolbox.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/presentation/agent_chat/services/generation_character_orchestration.dart"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33a8c0d21d318c25bf07c69be7f7de9ed472bbdb41b115411a95822cfd6b98d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!e.enabled \u0026\u0026 e.promptType == FixedTagPromptType.positive\u0060 appears character-identically in 2 files \u2014 lib/data/models/fixed_tag/fixed_tag_entry.dart, lib/presentation/providers/fixed_tags_provider.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/data/models/fixed_tag/fixed_tag_entry.dart"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2378f94920a9de897ef092d2b9e4b9b561f87eda2eceff2f772d1e70e1b0d15"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!genderRestrictionEnabled || applicableGenders.isEmpty\u0060 appears character-identically in 2 files \u2014 lib/data/models/prompt/random_category.dart, lib/data/models/prompt/random_tag_group.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/data/models/prompt/random_category.dart"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"874df2e6029cef54d723c792e2dc86a6dc81620de501c676672608e988a602ee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!keyboard.isControlPressed \u0026\u0026 !keyboard.isMetaPressed\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/tag_library_page/widgets/tag_library_toolbar.dart, lib/presentation/widgets/gallery/local_gallery_toolbar.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/presentation/screens/tag_library_page/widgets/tag_library_toolbar.dart"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff8aff438ed8dc4026479c14220eb410cfc7553a1e33b66a9dcad29b76141cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!locale.toLowerCase().startsWith(\u0027zh\u0027) || canonicalTags.isEmpty\u0060 appears character-identically in 2 files \u2014 lib/core/autocomplete/fast_tag_service.dart, lib/core/autocomplete/zh_dictionary_service.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/core/autocomplete/fast_tag_service.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f26a0295ca2ec17c4641a048311db8ecccebaa01ebbd75ee97ea878fabc881"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!payloadVerified \u0026\u0026 _hashBytes(bytes) != expectedHash\u0060 appears character-identically in 2 files \u2014 lib/core/cloud_sync/backend/github_cloud_sync_backend.dart, lib/core/cloud_sync/backend/google_drive_cloud_sync_backend.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/core/cloud_sync/backend/github_cloud_sync_backend.dart"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"111b213c8b9dacef767260d436f6991dd6e4d92793f6e9e00fd79e3d76165920"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!selection.isValid || selection.isCollapsed\u0060 appears character-identically in 5 files \u2014 lib/presentation/utils/text_selection_utils.dart, lib/presentation/widgets/prompt/prompt_display_controller.dart, lib/presentation/widgets/prompt/prompt_weight_editing.dart, lib/presentation/widgets/prompt/unified/prompt_search_session.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/presentation/utils/text_selection_utils.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd90c7c5a93105973a8009f4f4fc1a33660fe4ae13eab7e351940a5adf3a35e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!state.isBusy \u0026\u0026 !state.needsPreviewConfirmation\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/cloud_sync/cloud_sync_dashboard.dart, lib/presentation/screens/cloud_sync/cloud_sync_security_section.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/presentation/screens/cloud_sync/cloud_sync_dashboard.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d577ac19d56c3898547a87bc11c6e0fbaca71dfc8e32eb98204c7a3f37f76e3b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!workspaceWidth.isFinite || workspaceWidth \u003C= 0\u0060 appears character-identically in 2 files \u2014 lib/core/windowing/agent_chat_dock_contract.dart, lib/core/windowing/workspace_side_panel_contract.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/core/windowing/agent_chat_dock_contract.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca750823622670affd4d7e6c608c18ed21d713a525eb9af77f7a8059bbbe79f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(first == \u0027\u0022\u0027 \u0026\u0026 last == \u0027\u0022\u0027) || (first == \u0027\\\u0027\u0027 \u0026\u0026 last == \u0027\\\u0027\u0027)\u0060 appears character-identically in 3 files \u2014 lib/core/network/dio_client.dart, lib/core/storage/secure_storage_service.dart, lib/data/datasources/remote/nai_auth_api_service.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/core/network/dio_client.dart"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f1f3906cf96df34372a1b30e9cf5aa9c147f35cb06138180d0158192684cbd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(previousStatus == \u0027error\u0027 || previousStatus == \u0027failure\u0027) \u0026\u0026 currentStatus == \u0027success\u0027\u0060 appears character-identically in 2 files \u2014 tool/testing/verify_regression_detection.dart, tool/testing/verify_regression_simple.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":"tool/testing/verify_regression_detection.dart"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"44291ee758ec86490924d49834a2bac19ed1c9bc07e895dfbc046b5cefa44844"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060CloudSyncBackendKind.googleDrive || CloudSyncBackendKind.oneDrive\u0060 appears character-identically in 2 files \u2014 lib/presentation/providers/cloud_sync/cloud_sync_provider_wiring.dart, lib/presentation/screens/cloud_sync/cloud_sync_setup_draft.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/presentation/providers/cloud_sync/cloud_sync_provider_wiring.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"652037bbf7c7938d413080bb70086eedbe0b4942e637a0fb72c3434ac5925806"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060DioExceptionType.connectionTimeout || DioExceptionType.sendTimeout || DioExceptionType.receiveTimeout\u0060 appears character-identically in 2 files \u2014 lib/core/cloud_sync/backend/backend_http.dart, lib/core/network/error_mappers/api_error_mapper.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/core/cloud_sync/backend/backend_http.dart"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d2c02fc6b996ea97f240d522791878e0a98157d9f7199f99b516eefea7c7c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060GallerySourceId.danbooru || GallerySourceId.safebooru\u0060 appears character-identically in 2 files \u2014 lib/data/models/online_gallery/gallery_source.dart, lib/presentation/services/gallery_prompt_projection_service.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/data/models/online_gallery/gallery_source.dart"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a197b923855cd19e8f73e80b7fa78adfd9aed1e83dd4d3d0b03a19c0a303e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060GelbooruApiErrorType.cancelled || GelbooruApiErrorType.unknown\u0060 appears character-identically in 2 files \u2014 lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart, lib/data/services/online_gallery/online_gallery_error_mapper.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/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.dart"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aec62080c81e146a8023a316a2ce02e8b40de62bf8630c3d9b4451c8511549d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ImageUpscaleFailure.engineUnavailable || ImageUpscaleFailure.nativeVaeUnavailable\u0060 appears character-identically in 2 files \u2014 lib/presentation/agent_chat/services/image_upscale_service.dart, lib/presentation/screens/generation/widgets/img2img_upscale_section.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/presentation/agent_chat/services/image_upscale_service.dart"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e24f2cf264017a108c04d21855f85524c881377b97e5709154a7c5c260b074b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Platform.isWindows || Platform.isLinux || Platform.isMacOS\u0060 appears character-identically in 2 files \u2014 lib/core/services/sqflite_bootstrap_service.dart, lib/main.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/core/services/sqflite_bootstrap_service.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"350f4f21214aaa833c23b8b6f88be99c443da759dfc6843155f9e6e40953351e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060PlatformCapabilities.current.supportsKritaBridge \u0026\u0026 ref.read(kritaBridgeNotifierProvider).isBridgeGenerating\u0060 appears character-identically in 6 files \u2014 lib/presentation/providers/queue_execution_provider.dart, lib/presentation/screens/generation/desktop_layout.dart, lib/presentation/screens/generation/handlers/generation_action_handlers.dart, lib/presentation/screens/generation/mobile_generation_controller.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/presentation/providers/queue_execution_provider.dart"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"da41822fb0693502820607f95d7a6e2b11e9183f3488346efea98ab566add826"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060PointerDeviceKind.touch || PointerDeviceKind.stylus || PointerDeviceKind.invertedStylus\u0060 appears character-identically in 2 files \u2014 lib/presentation/adaptive/interaction_policy.dart, lib/presentation/widgets/image_editor/core/layer_transform_controller.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/presentation/adaptive/interaction_policy.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ee0fc8d1160ab8fa4ffa440b923c9b5a023f39b95511da9a46197e52cf8643"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060TagEditorAction.previous || TagEditorAction.next || TagEditorAction.first || TagEditorAction.last\u0060 appears character-identically in 2 files \u2014 lib/presentation/widgets/prompt/tag_editor_commands.dart, lib/presentation/widgets/prompt/tag_editor_view.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/presentation/widgets/prompt/tag_editor_commands.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a575f0c0824f0f4029aadb3d91393b29825a4c20f57f9bd6a143118dce11f8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060TargetPlatform.windows || TargetPlatform.macOS || TargetPlatform.linux\u0060 appears character-identically in 2 files \u2014 lib/presentation/agent_chat/services/application_context_toolbox.dart, lib/presentation/agent_chat/widgets/agent_chat_panel.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/presentation/agent_chat/services/application_context_toolbox.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a1552d89db8cb43ce7109695145b5b0a2852a6684a7eacf462e47f22f4c598"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_focused \u0026\u0026 policy.keyboardNavigationActive\u0060 appears character-identically in 2 files \u2014 lib/presentation/widgets/common/resizable_split.dart, lib/presentation/widgets/gallery/resizable_gallery_sidebar.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/presentation/widgets/common/resizable_split.dart"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5eea24bff643b4ec2d45d8432eec327eb99b86bd9f24f2922557ece647a9db7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_isFocused \u0026\u0026 context.interactionPolicy.keyboardNavigationActive\u0060 appears character-identically in 2 files \u2014 lib/presentation/widgets/common/elevated_card.dart, lib/presentation/widgets/tag_library/tag_library_picker_dialog.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/presentation/widgets/common/elevated_card.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb184133a498ea80f85d00b069238854faefd605b767aad7b9dfb216a6113cd4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_isInitialized \u0026\u0026 _box != null \u0026\u0026 _box!.isOpen\u0060 appears character-identically in 2 files \u2014 lib/data/datasources/local/pool_cache_service.dart, lib/data/datasources/local/tag_group_cache_service.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/data/datasources/local/pool_cache_service.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"189e70d70859603dda4579d76b5233da87780c5d65171d086488a4b388dfddbd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_loadError != null || _sourceImage == null\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/mosaic/mosaic_editor_screen.dart, lib/presentation/screens/watermark/watermark_editor_screen.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/presentation/screens/mosaic/mosaic_editor_screen.dart"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"505c7c3b32ebdc251855528a9132cc7a1a124c3d8152ee23f437d7ebbe576e5b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060activeLayer != null \u0026\u0026 !activeLayer.locked\u0060 appears character-identically in 2 files \u2014 lib/presentation/widgets/image_editor/tools/brush_tool.dart, lib/presentation/widgets/image_editor/tools/eraser_tool.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/presentation/widgets/image_editor/tools/brush_tool.dart"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c91907ec44a7388fbc7a64d4c94f2f51fafcc5ea4a3fd92261dfda87d569751"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060album.coverPath == null || rootPath == null || rootPath.isEmpty\u0060 appears character-identically in 2 files \u2014 lib/data/cloud_sync/app_cloud_sync_adapters.dart, lib/data/cloud_sync/gallery_album_cloud_sync_adapter.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/data/cloud_sync/app_cloud_sync_adapters.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9210062bdbca56d05e2e06c0ca917de9248a2a6a21c0ef6a1b4aa6fdb7aa6f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060apiKey != null \u0026\u0026 apiKey.trim().isNotEmpty\u0060 appears character-identically in 5 files \u2014 lib/presentation/prompt_assistant/providers/web_access_provider.dart, lib/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart, lib/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.dart, lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.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/presentation/prompt_assistant/providers/web_access_provider.dart"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b506354ce1055377f647afe51160011862124e414f21818942dd76a671373ad4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060authState.isAuthenticated \u0026\u0026 authState.accountId != null\u0060 appears character-identically in 3 files \u2014 lib/presentation/router/mobile_more_panel.dart, lib/presentation/widgets/navigation/nav_rail_account_button.dart, lib/presentation/widgets/settings/account_detail_tile.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/presentation/router/mobile_more_panel.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2519848799156982fe3cfc6912673c4de67e133c7fd6af97e6feef221d91f71a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060availableSlots \u003C= 0 || entry.filePath == null\u0060 appears character-identically in 2 files \u2014 lib/presentation/providers/generation/reference_panel_notifier.dart, lib/presentation/screens/generation/handlers/vibe_import_handler.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/presentation/providers/generation/reference_panel_notifier.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b14cf2f91c0c1a7a8bc2e3dd013aaaf92fe5a0d6020f8e8829e0a591cbfae26"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes.length \u003C 8 || bytes[0] != 0x89 || bytes[1] != 0x50 || bytes[2] != 0x4E || bytes[3] != 0x47\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_advanced_executor.dart, tool/metadata/check_metadata_simple.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/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_advanced_executor.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b3999d33d6c71cb5cc96d0c79e3786aeced06e596153746baee64973deee30"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes.length \u003E= 12 \u0026\u0026 bytes[0] == 0x52 \u0026\u0026 bytes[1] == 0x49 \u0026\u0026 bytes[2] == 0x46 \u0026\u0026 bytes[3] == 0x46 \u0026\u0026 bytes[8] == 0x57 \u0026\u0026 bytes[9] == 0x45 \u0026\u2026\u0060 appears character-identically in 5 files \u2014 lib/core/watermark/watermark_logo_service.dart, lib/data/services/precise_ref_portable_importer.dart, lib/presentation/agent_chat/services/generation_interrogation_service.dart, lib/presentation/prompt_assistant/services/prompt_assistant_service.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/core/watermark/watermark_logo_service.dart"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3431a8db593d1be4ffd3ded78771cdedb3000c3a158d6ec5561b688a604f9479"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes.length \u003E= 3 \u0026\u0026 bytes[0] == 0xFF \u0026\u0026 bytes[1] == 0xD8 \u0026\u0026 bytes[2] == 0xFF\u0060 appears character-identically in 3 files \u2014 lib/data/services/precise_ref_portable_importer.dart, lib/presentation/prompt_assistant/services/prompt_assistant_service.dart, lib/presentation/prompt_assistant/services/provider_adapters/prompt_assistant_adapter.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/data/services/precise_ref_portable_importer.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b832d34feaa30e623595f76eb5d1635c5f1fad6508267a24e47a298e9fbab2a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes.length \u003E= 3 \u0026\u0026 bytes[0] == 0xff \u0026\u0026 bytes[1] == 0xd8 \u0026\u0026 bytes[2] == 0xff\u0060 appears character-identically in 2 files \u2014 lib/core/utils/novelai_vibe_codec.dart, lib/core/watermark/watermark_logo_service.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/core/utils/novelai_vibe_codec.dart"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cd18bcaabba0980939cb33410abdd7a07c59c496a39ec0daac100ce88546b4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes.length \u003E= 8 \u0026\u0026 bytes[0] == 0x89 \u0026\u0026 bytes[1] == 0x50 \u0026\u0026 bytes[2] == 0x4E \u0026\u0026 bytes[3] == 0x47\u0060 appears character-identically in 2 files \u2014 lib/presentation/prompt_assistant/services/prompt_assistant_service.dart, lib/presentation/prompt_assistant/services/provider_adapters/prompt_assistant_adapter.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/presentation/prompt_assistant/services/prompt_assistant_service.dart"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"3033a69666d0f492b0a1f73b8b299b66a61871125e319ee2abe7518e391ceb27"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes.length \u003E= 8 \u0026\u0026 bytes[0] == 0x89 \u0026\u0026 bytes[1] == 0x50 \u0026\u0026 bytes[2] == 0x4e \u0026\u0026 bytes[3] == 0x47\u0060 appears character-identically in 2 files \u2014 lib/core/utils/novelai_vibe_codec.dart, lib/presentation/agent_chat/services/generation_interrogation_service.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/core/utils/novelai_vibe_codec.dart"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe520fd1a4690ef9839d2c05160c397e4737acaaf1574b84b423387a7e54404f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060capabilities.supportsWritableFavorites || capabilities.supportsLocalFavorites\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/online_gallery/online_gallery_content.dart, lib/presentation/screens/online_gallery/widgets/online_gallery_toolbar/online_gallery_toolbar_auth.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/presentation/screens/online_gallery/online_gallery_content.dart"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"53935d8eec7ebe056c228cdf896e1b75f2d25ca19191e912e4dee0049f7dc854"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060category.parentId != null \u0026\u0026 widget.onCategoryMove != null\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart, lib/presentation/widgets/gallery/gallery_category_tree_view.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/presentation/screens/tag_library_page/widgets/category_tree_view.dart"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c3255a1bb4ef2efda363540f2795c5c15091df1021e141e16414682193963e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060char == \u0027,\u0027 \u0026\u0026 braceDepth == 0 \u0026\u0026 bracketDepth == 0 \u0026\u0026 parenDepth == 0 \u0026\u0026 !inPipe\u0060 appears character-identically in 2 files \u2014 lib/core/services/prompt_token_counter_service.dart, lib/core/utils/nai_prompt_parser.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/core/services/prompt_token_counter_service.dart"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed87ee73325ba9f2ba3507a559fa0e93c1c361db478935653cb15696fe73ad33"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060character.enabled \u0026\u0026 (character.prompt.isNotEmpty || character.negativePrompt.isNotEmpty)\u0060 appears character-identically in 2 files \u2014 lib/core/services/character_conversion_service.dart, lib/presentation/providers/prompt_token_counter_provider.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/core/services/character_conversion_service.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1da33728ddbf215db866831f115c33ffecd327e7f0ee2e127d32ab0a6dd68f9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060character.enabled \u0026\u0026 character.prompt.isNotEmpty\u0060 appears character-identically in 3 files \u2014 lib/core/utils/novelai_auto_text.dart, lib/presentation/screens/generation/widgets/prompt_input_coordinator.dart, lib/presentation/screens/generation/widgets/prompt_input_tooltips.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/core/utils/novelai_auto_text.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"38837acad8715ca3a194f71a45dc6460f39ebecbb920435071e8aeb44960e2a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060character.prompt.trim().isNotEmpty || character.negativePrompt.trim().isNotEmpty\u0060 appears character-identically in 5 files \u2014 lib/data/models/online_gallery/gallery_prompt_projection.dart, lib/presentation/screens/online_gallery/online_gallery_detail_launcher.dart, lib/presentation/screens/online_gallery/online_gallery_selection_actions.dart, lib/presentation/widgets/danbooru_post_card.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/data/models/online_gallery/gallery_prompt_projection.dart"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31834552ba9cb850c4605ef9ba5db1c43d399c7ba743dc21dbac268741378ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060commaIndex != -1 \u0026\u0026 commaIndex \u003C dataUri.length - 1\u0060 appears character-identically in 2 files \u2014 lib/core/utils/vibe_image_embedder.dart, tool/vibe/vibe_analyzer.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/core/utils/vibe_image_embedder.dart"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cdab29ad4e22238063b370ca72063baa49ad60619a753d0c41c1dd6283bb89"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060composing.isValid \u0026\u0026 !composing.isCollapsed\u0060 appears character-identically in 2 files \u2014 lib/presentation/utils/text_selection_utils.dart, lib/presentation/widgets/autocomplete/autocomplete_wrapper.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/presentation/utils/text_selection_utils.dart"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb07df4911d4ddec55789a2b0727dc9f839086a06e3ad969172fe47666bb56c3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060compositeMask.width != targetWidth || compositeMask.height != targetHeight\u0060 appears character-identically in 2 files \u2014 lib/core/utils/focused_inpaint_utils.dart, lib/core/utils/inpaint_mask/inpaint_mask_operations.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/core/utils/focused_inpaint_utils.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c30ae63ef0f8e03ab9ca1023d1a91bd7546d4ee2b818d19572630c90f3066ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060constraints.maxWidth \u003C 360 || MediaQuery.textScalerOf(context).scale(1) \u003E= 2\u0060 appears character-identically in 7 files \u2014 lib/presentation/widgets/auth/credentials_login_form.dart, lib/presentation/widgets/character/add_to_library_dialog.dart, lib/presentation/widgets/image_editor/widgets/panels/canvas_size_dialog.dart, lib/presentation/widgets/metadata/metadata_import_dialog.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/presentation/widgets/auth/credentials_login_form.dart"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bd5c8e5f0c1e679cdca000f0ca93fbfed4bb7bb1f988aa2f9318d076d491a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060constraints.maxWidth \u003C 360 || textScale \u003E 1.5\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/precise_ref_library/widgets/precise_ref_entry_edit_dialog.dart, lib/presentation/screens/tag_library_page/widgets/send_to_home_dialog.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/presentation/screens/precise_ref_library/widgets/precise_ref_entry_edit_dialog.dart"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c722c13c22e37bb2d9b69821aeadb94aa8b671ff2a77a398238c8c3d84186e70"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060constraints.maxWidth \u003C 360 || usesLargeText\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/generation/widgets/fixed_tags_sidebar/fixed_tags_sidebar_pane.dart, lib/presentation/screens/generation/widgets/prompt_input_toolbar.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/presentation/screens/generation/widgets/fixed_tags_sidebar/fixed_tags_sidebar_pane.dart"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d1a2c28cc89c0d007d840ea7c6664dff05e4266a2e3e385d26e28013950ea3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060constraints.maxWidth \u003C 400 || MediaQuery.textScalerOf(context).scale(1) \u003E= 2\u0060 appears character-identically in 4 files \u2014 lib/presentation/prompt_assistant/widgets/prompt_assistant_custom_dialog.dart, lib/presentation/widgets/image_editor/widgets/panels/canvas_size_dialog.dart, lib/presentation/widgets/prompt/comfyui_import_dialog.dart, lib/presentation/widgets/prompt/diy/dialogs/preset_import_dialog.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/presentation/prompt_assistant/widgets/prompt_assistant_custom_dialog.dart"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"78249166a93ac3cccf5b282ffd4f3c26dba724b8dd20df65146a9329ebace584"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060constraints.maxWidth \u003C 420 || MediaQuery.textScalerOf(context).scale(1) \u003E= 2\u0060 appears character-identically in 3 files \u2014 lib/presentation/screens/vibe_library/widgets/vibe_selector_dialog.dart, lib/presentation/widgets/prompt/random_manager/tag_group_diy_section.dart, lib/presentation/widgets/settings/account_profile_sheet.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/presentation/screens/vibe_library/widgets/vibe_selector_dialog.dart"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b5275f6f334cc96ad47cea18d14982e672ec39aba9ae3ff4ab49e172d28b99"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060constraints.maxWidth \u003C 520 || MediaQuery.textScalerOf(context).scale(1) \u003E 1.5\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/cloud_sync/cloud_sync_content_selection_dialog.dart, lib/presentation/widgets/image_editor/effects/effects_preview_dialog.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/presentation/screens/cloud_sync/cloud_sync_content_selection_dialog.dart"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"867b5a70d8119e1499362a81e9294b9d23a51ab10addf2cf5815acbf22b00914"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060controller.rotation == 0 \u0026\u0026 !controller.isMirroredHorizontally\u0060 appears character-identically in 2 files \u2014 lib/presentation/widgets/image_editor/frame/editor_frame_controller.dart, lib/presentation/widgets/image_editor/frame/frame_tool_panel.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/presentation/widgets/image_editor/frame/editor_frame_controller.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2b9677fa3893ee2dbe7468f3eb42241bd4e75a7efd24b0216a446458215d15"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060current != null \u0026\u0026 (current.status == InpaintDraftStatus.prepared || current.status == InpaintDraftStatus.editing)\u0060 appears character-identically in 2 files \u2014 lib/presentation/agent_chat/services/inpaint_draft_authoring_service.dart, lib/presentation/agent_chat/services/manual_inpaint_toolbox.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/presentation/agent_chat/services/inpaint_draft_authoring_service.dart"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d973456d6368a978450d1ce2c6955aeb774838360ad09edb96e80c7f1c9c80f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060currentRoute != null \u0026\u0026 !currentRoute.isCurrent\u0060 appears character-identically in 2 files \u2014 lib/presentation/widgets/character/inline_character_card.dart, lib/presentation/widgets/character/inline_character_row.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/presentation/widgets/character/inline_character_card.dart"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7958bd9f007a5e7abc38e9f0ec8dbe1f542c9fe56763fd842b890554355b95"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060customPath != null \u0026\u0026 customPath.isNotEmpty\u0060 appears character-identically in 5 files \u2014 lib/core/utils/hive_storage_helper.dart, lib/core/utils/vibe_library_path_helper.dart, lib/data/repositories/gallery_category_repository.dart, lib/data/repositories/gallery_folder_repository.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/core/utils/hive_storage_helper.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d745dcafd48f6400fec781c01747122acc7a12ad78148f266091e45a90e5cb46"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060decoded == null || decoded.width != width || decoded.height != height\u0060 appears character-identically in 2 files \u2014 lib/core/utils/inpaint_mask/inpaint_mask_preview.dart, lib/presentation/widgets/image_editor/controllers/magic_wand_controller.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/core/utils/inpaint_mask/inpaint_mask_preview.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"207d8e1f4a8223c68a64d81fdd6a63f26ebc0ad7396f0eb524d9158f643f4c2f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060decoded.width == targetWidth \u0026\u0026 decoded.height == targetHeight\u0060 appears character-identically in 2 files \u2014 lib/core/utils/inpaint_mask/inpaint_mask_operations.dart, lib/core/utils/nai_resolution_adapter.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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9508f93f38d91f728f1afbb7a53dac74af6f9631281fef09823148f9ab5915"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060description != null \u0026\u0026 description.isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/settings/widgets/settings_card.dart, lib/presentation/screens/settings/widgets/settings_page_layout.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/presentation/screens/settings/widgets/settings_card.dart"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c074c7f6e3dcf2dc377539bd5185111886278fe3b85281d9c8f0a806fe01023"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060detail != null \u0026\u0026 detail.media.isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/online_gallery/online_gallery_content.dart, lib/presentation/screens/online_gallery/online_gallery_selection_actions.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/presentation/screens/online_gallery/online_gallery_content.dart"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"7340ae55dc678212b5fc49ecf96314cea372af0cd25c264805777ce60f1d74d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.enabled \u0026\u0026 e.promptType == FixedTagPromptType.negative \u0026\u0026 e.position == FixedTagPosition.prefix\u0060 appears character-identically in 2 files \u2014 lib/data/models/fixed_tag/fixed_tag_entry.dart, lib/presentation/providers/fixed_tags_provider.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/data/models/fixed_tag/fixed_tag_entry.dart"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"4091655bbd844e6dc32d6c55767a98c5759577479a57d994d5f2fd53d10ee114"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.enabled \u0026\u0026 e.promptType == FixedTagPromptType.negative \u0026\u0026 e.position == FixedTagPosition.suffix\u0060 appears character-identically in 2 files \u2014 lib/data/models/fixed_tag/fixed_tag_entry.dart, lib/presentation/providers/fixed_tags_provider.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/data/models/fixed_tag/fixed_tag_entry.dart"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5be2ceeca4baebd312fbf49e53627d902df513bd8611e3da5b5f15a9c6e0a7e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.enabled \u0026\u0026 e.promptType == FixedTagPromptType.positive\u0060 appears character-identically in 2 files \u2014 lib/data/models/fixed_tag/fixed_tag_entry.dart, lib/presentation/providers/fixed_tags_provider.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/data/models/fixed_tag/fixed_tag_entry.dart"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"731186a04b33e363eaeecde3b088cae884841ba8fd7f1cda68a4c73acc4e05e4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.enabled \u0026\u0026 e.promptType == FixedTagPromptType.positive \u0026\u0026 e.position == FixedTagPosition.prefix\u0060 appears character-identically in 2 files \u2014 lib/data/models/fixed_tag/fixed_tag_entry.dart, lib/presentation/providers/fixed_tags_provider.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/data/models/fixed_tag/fixed_tag_entry.dart"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"2416e04f3448a0704f0945468812dabb84627e32a6152c41da150e2ac5ac7e8a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.enabled \u0026\u0026 e.promptType == FixedTagPromptType.positive \u0026\u0026 e.position == FixedTagPosition.suffix\u0060 appears character-identically in 2 files \u2014 lib/data/models/fixed_tag/fixed_tag_entry.dart, lib/presentation/providers/fixed_tags_provider.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/data/models/fixed_tag/fixed_tag_entry.dart"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"015bf5d8c3f39a80c1d37438b0e18be3f94b891c2656c727ddfc487ef86e72b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060encoding is String \u0026\u0026 encoding.isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/core/utils/novelai_vibe_codec.dart, lib/core/utils/vibe_encoding_utils.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/core/utils/novelai_vibe_codec.dart"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"24100f10fcfe873010c0f1cbe5e573a06102bc60783c3750102751ca3e963c29"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060encodingModels != null \u0026\u0026 i \u003C encodingModels.length\u0060 appears character-identically in 2 files \u2014 lib/core/utils/vibe_export_utils.dart, lib/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_advanced_executor.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/core/utils/vibe_export_utils.dart"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2cffaea5cf14a887e09d87b4c73ebff114fd5d9b9d449383424b148bb06db5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entity is File \u0026\u0026 _supportedExtensions.contains( p.extension(entity.path).toLowerCase(), )\u0060 appears character-identically in 2 files \u2014 lib/data/repositories/gallery_category_repository.dart, lib/data/repositories/gallery_folder_repository.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/data/repositories/gallery_category_repository.dart"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"a069ba120c3a3a662db518eb1335567c66711011aa9fe9d21656825bbaec52f9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entity is File \u0026\u0026 entity.path.endsWith(\u0027.hive\u0027)\u0060 appears character-identically in 2 files \u2014 lib/core/services/data_migration_service.dart, lib/core/utils/hive_storage_helper.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/core/services/data_migration_service.dart"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"47df886017e7e5762fa92ba66af5fab9dd60836d5c37cb5ff38ad6464473f71c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.hasThumbnail \u0026\u0026 entry.thumbnail != null\u0060 appears character-identically in 4 files \u2014 lib/presentation/screens/tag_library_page/widgets/entry_card.dart, lib/presentation/screens/tag_library_page/widgets/entry_list_item.dart, lib/presentation/widgets/tag_library/tag_library_entry_hover_preview.dart, lib/presentation/widgets/tag_library/tag_library_picker_dialog.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/presentation/screens/tag_library_page/widgets/entry_card.dart"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"6087e205e38e2ec9ad99850db799822c766c54d47b70ca1854eff42f58460509"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.hasThumbnail || entry.hasVibeThumbnail\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/generation/widgets/recent_vibes_section.dart, lib/presentation/screens/vibe_library/widgets/vibe_selector_dialog.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/presentation/screens/generation/widgets/recent_vibes_section.dart"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"39948f6d2fe414fb090b21a365397161a3e07d2c208c263f0b9e7348e4f10bcf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.value \u003C 0 || entry.value \u003E maxCloudObjectResponseBytes\u0060 appears character-identically in 2 files \u2014 lib/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart, lib/core/cloud_sync/backend/webdav_cloud_sync_backend.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/core/cloud_sync/backend/google_drive_cloud_sync_backend.dart"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d3861c9aefb65f76347bbfee964741747d3f6fab10e0c7b12417ad28d52a59"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error is DioException \u0026\u0026 CancelToken.isCancel(error)\u0060 appears character-identically in 3 files \u2014 lib/data/datasources/remote/online_gallery/quick_tag_cloud_gallery_repository.dart, lib/data/services/online_gallery/online_gallery_search_service.dart, lib/presentation/providers/online_gallery_random_loader_service.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/data/datasources/remote/online_gallery/quick_tag_cloud_gallery_repository.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f121a9e10f8df9ccfcbb22392508c1d67a6bf8cbd77b4139650d64352f4dbb5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error.response?.statusCode == 422 \u0026\u0026 request.blacklistTags.isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart, lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"2760288daa38ba21bb82cfdb8d0c2f207945ccb8ed64f2aee2803f78c7fc3b21"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060errorCode == AuthErrorCode.networkTimeout || errorCode == AuthErrorCode.networkError\u0060 appears character-identically in 2 files \u2014 lib/presentation/widgets/auth/credentials_login_form.dart, lib/presentation/widgets/auth/token_login_card.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/presentation/widgets/auth/credentials_login_form.dart"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"f639cf4eb301eb94095110c6a606d67780c5da8d75a65932109564e064c4ca0d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060estimatedAnlas != null \u0026\u0026 estimatedAnlas \u003C 0\u0060 appears character-identically in 2 files \u2014 lib/core/agent/permissions/tool_permission_catalog.dart, lib/presentation/agent_chat/services/agent_tool_permission_controller.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/core/agent/permissions/tool_permission_catalog.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"83656862f39db2296db7641fdd0bd69d7a2a2c4b055a366441513e5e8ab9b9cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event is KeyDownEvent \u0026\u0026 event.logicalKey == LogicalKeyboardKey.enter\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/vibe_library/widgets/vibe_image_encode_dialog.dart, lib/presentation/screens/vibe_library/widgets/vibe_import_naming_dialog.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/presentation/screens/vibe_library/widgets/vibe_image_encode_dialog.dart"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21bace771eaa4f8e63d24c4142a55cf5e5f0cc90347ace7f4ebfd68817d1306"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event is KeyDownEvent || event is KeyRepeatEvent\u0060 appears character-identically in 2 files \u2014 lib/presentation/adaptive/interaction_policy.dart, lib/presentation/agent_chat/widgets/agent_chat_panel_controller.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/presentation/adaptive/interaction_policy.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad90a1e43d16d983a1ad2da4f71b2eac25a0c9f9936870ae1a90102b713491cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event is! KeyDownEvent \u0026\u0026 event is! KeyRepeatEvent\u0060 appears character-identically in 8 files \u2014 lib/presentation/agent_chat/widgets/agent_chat_composer.dart, lib/presentation/screens/mosaic/mosaic_editor_geometry.dart, lib/presentation/screens/watermark/watermark_editor_preview.dart, lib/presentation/widgets/autocomplete/autocomplete_wrapper.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/presentation/agent_chat/widgets/agent_chat_composer.dart"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dac0100f554f5a120a325ac235e86cbf239b76e2431fca690d6c0f0b4afe919"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event is! KeyDownEvent || event.logicalKey != LogicalKeyboardKey.keyA\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/tag_library_page/widgets/tag_library_toolbar.dart, lib/presentation/widgets/gallery/local_gallery_toolbar.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/presentation/screens/tag_library_page/widgets/tag_library_toolbar.dart"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"88843b085599ead1ed75e0c163feba50cc1971e109dfa364f02489a10e5ae805"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.session.allowedOperations.contains(DropOperation.copy) \u0026\u0026 canAcceptGalleryDrop(event.session.items)\u0060 appears character-identically in 2 files \u2014 lib/presentation/widgets/gallery/gallery_album_tree_view.dart, lib/presentation/widgets/gallery/gallery_category_tree_view.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/presentation/widgets/gallery/gallery_album_tree_view.dart"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb27693d1ca7515b2bd5d97c24b93501a06a08ffac60f9856382de4cfb9754f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060executionState.isRunning || executionState.isReady\u0060 appears character-identically in 2 files \u2014 lib/app.dart, lib/presentation/widgets/queue/execution_stats_panel.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/app.dart"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"17647664b8c7d819ee7d8e33e5f4b8c95ffc96f3f0cbe9eec5f5177e798225be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060image.canSave \u0026\u0026 PlatformCapabilities.current.supportsOpenFolder\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/generation/widgets/history_panel/history_image_card.dart, lib/presentation/screens/generation/widgets/image_preview.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/presentation/screens/generation/widgets/history_panel/history_image_card.dart"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d84baafe04405f44796ab70a64bfe5ceb85419ef4c9b866baa3679b07ccb36"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060imageBase64 != null \u0026\u0026 imageBase64.isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/core/utils/vibe_file_parser.dart, lib/core/utils/vibe_image_embedder.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/core/utils/vibe_file_parser.dart"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e30f901a247a01b8be3a24dc0968b3735ac69a042d6f353242a1e8cb29825f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060imageId is! String || imageId.trim().isEmpty\u0060 appears character-identically in 2 files \u2014 lib/presentation/agent_chat/services/generation_image_resource.dart, lib/presentation/utils/internal_drag_protocol.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/presentation/agent_chat/services/generation_image_resource.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"87811caf424587d820adef23c5b9b11bd4803128ffe07fcdc21f6966a1d633c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isGenerating || cooldownRemainingSeconds \u003E 0\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/generation/mobile_generation_chrome.dart, lib/presentation/screens/generation/widgets/generation_controls/generate_button.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/presentation/screens/generation/mobile_generation_chrome.dart"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b77021f958291ac09b2c2fe40f19c190b3a5a4bd76b76edfb6399e46c51bf56"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isLauncherGenerating || isKritaGenerating\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/generation/mobile_layout.dart, lib/presentation/screens/generation/widgets/generation_controls/generation_controls.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/presentation/screens/generation/mobile_layout.dart"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e3b7d4c8552ce681642ee96e8f191b0365452e8384506738c636cadaa7b3b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.type != ContextMenuButtonType.copy \u0026\u0026 item.type != ContextMenuButtonType.cut\u0060 appears character-identically in 2 files \u2014 lib/presentation/widgets/prompt/prompt_display_controller.dart, lib/presentation/widgets/prompt/unified/unified_prompt_clipboard.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/presentation/widgets/prompt/prompt_display_controller.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f51af6ec2aff26b40ddac5d4f2db65dbfa1dfe7f03d2a72293ad67444cb8c12"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060json.containsKey(\u0027prompt\u0027) || json.containsKey(\u0027comment\u0027) || json.containsKey(\u0027Comment\u0027)\u0060 appears character-identically in 2 files \u2014 tool/metadata/compare_metadata.dart, tool/metadata/extract_metadata.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":"tool/metadata/compare_metadata.dart"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c199fb9713c1eecd534667d48fccee941579fdcde5c4f92d7c198911b0ff4e7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060jsonString == null || jsonString.isEmpty\u0060 appears character-identically in 5 files \u2014 lib/core/shortcuts/shortcut_storage.dart, lib/core/storage/base_hive_storage.dart, lib/core/storage/queue_state_storage.dart, lib/core/storage/replication_queue_storage.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/core/shortcuts/shortcut_storage.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ec417be324d727fcc69c497063cb76f7799049a33e9ae5f78a1b42dbb01c95"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060keyboard.isControlPressed || keyboard.isMetaPressed\u0060 appears character-identically in 3 files \u2014 lib/presentation/screens/mosaic/mosaic_editor_geometry.dart, lib/presentation/widgets/autocomplete/autocomplete_wrapper.dart, lib/presentation/widgets/prompt/tag_editor_view.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/presentation/screens/mosaic/mosaic_editor_geometry.dart"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c47956ea9a6107be5fdbb7d8b69c8ab078fea3a73a1071ddcfbd57f62c4c67e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060layer == null || layer.locked || !layer.hasContent\u0060 appears character-identically in 2 files \u2014 lib/presentation/widgets/image_editor/core/layer_move_controller.dart, lib/presentation/widgets/image_editor/effects/image_editor_effects_controller.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/presentation/widgets/image_editor/core/layer_move_controller.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2e24286ed18b96eaf952eb72f6e460cf45270d9d98636e7bb64ccfa61185ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060libraryEntry == null || !context.interactionPolicy.precisePointerAvailable\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/generation/widgets/sidebar_entry_tile.dart, lib/presentation/widgets/prompt/fixed_tags_columns.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/presentation/screens/generation/widgets/sidebar_entry_tile.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6a703ce731aa0544b7c964ea94cedc341eaef27291526a3c51644508f39e67"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lifecycle == null || lifecycle == AppLifecycleState.resumed\u0060 appears character-identically in 2 files \u2014 lib/core/services/interactive_work_gate.dart, lib/presentation/screens/splash/app_bootstrap.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/core/services/interactive_work_gate.dart"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2adbc497d3f6af6d4ad0d2d79785c805b01792aca726eb3a1239522f35a0b6e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060maleMatch != null \u0026\u0026 femaleMatch != null\u0060 appears character-identically in 3 files \u2014 lib/core/utils/comfyui_prompt_parser/and_mask_parser.dart, lib/core/utils/comfyui_prompt_parser/couple_parser.dart, lib/core/utils/comfyui_prompt_parser/pipe_parser.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/core/utils/comfyui_prompt_parser/and_mask_parser.dart"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94ac1a88dfef3b9ea581c7c096031a94e5a0f47750b8594e7ab8f959ea2f997"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060maxLines != null \u0026\u0026 lines.length \u003E= maxLines\u0060 appears character-identically in 2 files \u2014 lib/core/agent/harness/env/dart_io_execution_env.dart, lib/core/agent/harness/session/jsonl/session_jsonl_line_storage.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/core/agent/harness/env/dart_io_execution_env.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"370d80a9944c01d19abeaa49ddb31f16bf31594b3c4be40695f4f13922ba5290"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060message is String \u0026\u0026 message.trim().isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/presentation/prompt_assistant/services/provider_adapters/agent_wire_helpers.dart, lib/presentation/prompt_assistant/services/provider_adapters/prompt_assistant_adapter.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/presentation/prompt_assistant/services/provider_adapters/agent_wire_helpers.dart"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"24797c20666980db7c29dcf11339fac24907844d04ce1df1726963a1da68e6fa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata.cfgRescale != null \u0026\u0026 metadata.cfgRescale! \u003E 0\u0060 appears character-identically in 2 files \u2014 lib/presentation/widgets/common/image_detail/components/detail_metadata_panel.dart, lib/presentation/widgets/metadata/metadata_import_dialog.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/presentation/widgets/common/image_detail/components/detail_metadata_panel.dart"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f3789afbc223d178aa1c3925f010359dcf2c952a7e16efac9629adb3572f80"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata.fixedPrefixTags.isNotEmpty || metadata.fixedSuffixTags.isNotEmpty || metadata.fixedNegativePrefixTags.isNotEmpty || metadata.fixedN\u2026\u0060 appears character-identically in 2 files \u2014 lib/data/models/gallery/fixed_tag_usage_projection.dart, lib/presentation/utils/fixed_tag_import_resolution.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/data/models/gallery/fixed_tag_usage_projection.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6daab0d0fa610a449eb13c69832fb1848863a1b4a2ad9a412bba71925f8bef88"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata.smea == true || metadata.smeaDyn == true\u0060 appears character-identically in 2 files \u2014 lib/presentation/widgets/common/image_detail/components/detail_metadata_panel.dart, lib/presentation/widgets/metadata/metadata_import_dialog.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/presentation/widgets/common/image_detail/components/detail_metadata_panel.dart"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df8ae180eed903c2011ba582f9c333f0b078d6a24d2dacacb66d8e28262b2f6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata.width != null \u0026\u0026 metadata.height != null\u0060 appears character-identically in 3 files \u2014 lib/data/models/gallery/nai_metadata_prompt_projection.dart, lib/presentation/widgets/drop/image_destination_dialog.dart, lib/presentation/widgets/metadata/metadata_import_dialog.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/data/models/gallery/nai_metadata_prompt_projection.dart"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"1172e5e8be73148cf5104f79472bdaba7de01f6add62e5cb980359e7faa40885"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata?.width != null \u0026\u0026 metadata?.height != null\u0060 appears character-identically in 2 files \u2014 lib/data/services/gallery/gallery_stream_scanner.dart, lib/presentation/widgets/gallery/gallery_content_view.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/data/services/gallery/gallery_stream_scanner.dart"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f4ad777a1800062aa9a3553393ed175ed8f424d10649ce3dd402cf02266b94"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metrics.hasPixels \u0026\u0026 metrics.hasContentDimensions \u0026\u0026 metrics.viewportDimension \u003E 0 \u0026\u0026 metrics.pixels.isFinite\u0060 appears character-identically in 2 files \u2014 lib/presentation/agent_chat/widgets/agent_chat_panel_controller.dart, lib/presentation/widgets/common/owned_scroll_controller.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/presentation/agent_chat/widgets/agent_chat_panel_controller.dart"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1359566c2d0c099018984355bdda5ffcdf4c9335dba318cb2e8a3896e082f51"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mounted \u0026\u0026 identical(widget.controller, updatedController)\u0060 appears character-identically in 2 files \u2014 lib/presentation/widgets/common/weight_adjust_toolbar.dart, lib/presentation/widgets/prompt/unified/unified_prompt_input.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/presentation/widgets/common/weight_adjust_toolbar.dart"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"947054d66051a2c204cbf05b50670f70da903e8286bae57381d785c0974803ed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name is String \u0026\u0026 name.trim().isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/core/utils/vibe_encoding_utils.dart, lib/presentation/agent_chat/widgets/agent_tool_result_summary.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/core/utils/vibe_encoding_utils.dart"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0722e116d298e0ac7762ee8bdbc27a23000bc00fb79f1cb9005df617c98ceac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060newParentId != null \u0026\u0026 state.categories.wouldCreateCycle(categoryId, newParentId)\u0060 appears character-identically in 2 files \u2014 lib/presentation/providers/gallery_category_provider.dart, lib/presentation/providers/vibe_library_category_provider.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/presentation/providers/gallery_category_provider.dart"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15b8f09a1490452f059aef9a43289983d028b7fb88a7eb6229bf6fe4b2a0db0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060normalized != null \u0026\u0026 !normalized.startsWith(\u0027W/\u0027) \u0026\u0026 RegExp(r\u0027^\u0022[^\u0022\\r\\n]*\u0022$\u0027).hasMatch(normalized)\u0060 appears character-identically in 2 files \u2014 lib/core/cloud_sync/backend/webdav_capability_probe.dart, lib/core/cloud_sync/backend/webdav_cloud_sync_backend.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/core/cloud_sync/backend/webdav_capability_probe.dart"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5967291762d6fb389d00f80b284e4e8d71273e82c8e2f24b200347e5eb6de8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060notification is ScrollStartNotification || notification is ScrollUpdateNotification || notification is OverscrollNotification\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/generation/mobile_generation_controller.dart, lib/presentation/screens/generation/widgets/history_panel/history_share_preheat_controller.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/presentation/screens/generation/mobile_generation_controller.dart"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d380e96ee0a95ac9df96631b023f3355b88b4515e0ff0a67987903abafc077"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060oldThumbnailPath == null || oldThumbnailPath.isEmpty\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/tag_library_page/widgets/entry_add_dialog.dart, lib/presentation/widgets/drop/tag_library_drop_handler.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/presentation/screens/tag_library_page/widgets/entry_add_dialog.dart"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd7c4462a73ac9197a079f631155cda4663aef4c1e56b8732a669dcdfda55a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.importPrompt \u0026\u0026 metadata.prompt.isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/presentation/utils/metadata_import_applier.dart, lib/presentation/utils/metadata_import_coordinator.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/presentation/utils/metadata_import_applier.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"55715fd670b1aad721fc8588cbd9ef59c17eda56cb45975db8a18237ae177c2b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parentId != null \u0026\u0026 !_expandedIds.contains(parentId)\u0060 appears character-identically in 2 files \u2014 lib/presentation/widgets/gallery/gallery_album_tree_view.dart, lib/presentation/widgets/gallery/gallery_category_tree_view.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/presentation/widgets/gallery/gallery_album_tree_view.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba6d7d01d59e7bf8fd24520ea5a39933cbd7e5d69dc07952455e2543c3c4564"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed.success \u0026\u0026 parsed.metadata != null\u0060 appears character-identically in 2 files \u2014 lib/core/derivatives/derivative_metadata_transfer.dart, lib/data/services/metadata/image_metadata_parser_service.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/core/derivatives/derivative_metadata_transfer.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"15761f940f93f17fd891ae80199a8bbdac56b07087f94e6105fc2ff743188961"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060persistentCategories \u0026\u0026 _showCategoryPanel\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/precise_ref_library/precise_ref_library_screen.dart, lib/presentation/screens/tag_library_page/tag_library_page_screen.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/presentation/screens/precise_ref_library/precise_ref_library_screen.dart"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb846e9e01f2e831b6a83f7ddd693c2ad4440b6d80e8c14c24ed34025e35f47"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060physicalKeys.contains(PhysicalKeyboardKey.shiftLeft) || physicalKeys.contains(PhysicalKeyboardKey.shiftRight)\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/vibe_library/widgets/vibe_detail_viewer.dart, lib/presentation/screens/vibe_library/widgets/vibe_library_content_view.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/presentation/screens/vibe_library/widgets/vibe_detail_viewer.dart"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"29cef9abf5ea8d306c2e82f3d52cb99a8de4d6670393ceaf11567b7af4ad2036"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060preparation == null || preparation.status != GenerationPreparationStatus.prepared\u0060 appears character-identically in 2 files \u2014 lib/presentation/agent_chat/services/generation_preparation_runtime.dart, lib/presentation/agent_chat/services/generation_preparation_service.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/presentation/agent_chat/services/generation_preparation_runtime.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f533f544935907e69cbc8158d35d31fe0e962f32a16ec2a312283279862d076"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060previewImage != null \u0026\u0026 previewImage!.isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/data/models/image/image_stream_chunk.dart, lib/presentation/providers/comfyui/comfyui_provider.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/data/models/image/image_stream_chunk.dart"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19f4145b070a4d8b1000e49ed5f0ff843e8c3603802234f335493617d29ef4a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060previewSlots.isNotEmpty \u0026\u0026 generationIndex \u003C previewSlots.length\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/generation/widgets/history_panel/history_image_card.dart, lib/presentation/screens/generation/widgets/image_preview.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/presentation/screens/generation/widgets/history_panel/history_image_card.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9355cc4a29730ae72ee391ddbaa267f4c79b1efa2c38f0dd999d772fe8b7415c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060previous?.status != GenerationStatus.generating \u0026\u0026 next.status == GenerationStatus.generating\u0060 appears character-identically in 2 files \u2014 lib/presentation/providers/generation/preview_selection_provider.dart, lib/presentation/providers/queue_execution_provider.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/presentation/providers/generation/preview_selection_provider.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d24407a7df783d260fb5456b193236e057f3c36f4e54ba0cfa9b9c8c19ee5d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060previousStatus == \u0027success\u0027 \u0026\u0026 (currentStatus == \u0027error\u0027 || currentStatus == \u0027failure\u0027)\u0060 appears character-identically in 2 files \u2014 tool/testing/verify_regression_detection.dart, tool/testing/verify_regression_simple.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":"tool/testing/verify_regression_detection.dart"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d1b9c0fb3dad5ed568cb148786789ea92b76da32a1df5bd298dc561a9bd007"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060proxyAddress != null \u0026\u0026 proxyAddress.isNotEmpty\u0060 appears character-identically in 4 files \u2014 lib/core/network/dio_client.dart, lib/core/network/proxy_service.dart, lib/presentation/prompt_assistant/providers/web_access_provider.dart, lib/presentation/providers/startup_initialization_provider.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/core/network/dio_client.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4c7dc8f463581cf938b377ac6ae4966445f00136fcc1b1ce94a49ed7221330"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rawImageData != null \u0026\u0026 rawImageData!.isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/data/models/vibe/vibe_library_entry.dart, lib/data/models/vibe/vibe_reference.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/data/models/vibe/vibe_library_entry.dart"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be6e519c6270eb4e3af9f469b0b87a1902322c5c8e44933a1c9880246b8b828"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rawImageData == null || rawImageData.isEmpty\u0060 appears character-identically in 2 files \u2014 lib/core/utils/vibe_file_parser.dart, lib/presentation/screens/vibe_library/widgets/vibe_detail_viewer.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/core/utils/vibe_file_parser.dart"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"8126cc84ae928f18cc27e0f364592785c10e21afce2190aa43e0349802e8ec26"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reducedMotion == _reducedMotion \u0026\u0026 _controller.value != 0\u0060 appears character-identically in 5 files \u2014 lib/presentation/screens/statistics/widgets/animated/animated_bar_chart.dart, lib/presentation/screens/statistics/widgets/animated/animated_number.dart, lib/presentation/screens/statistics/widgets/animated/animated_pie_chart.dart, lib/presentation/screens/statistics/widgets/charts/heatmap_chart.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/presentation/screens/statistics/widgets/animated/animated_bar_chart.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c05af47bc71a89f0626caf3818ffaf81b6e7bcf7255bebf187e235339715c2f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ref.read(imageGenerationNotifierProvider).isBusy || isKritaGenerating\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/generation/desktop_layout.dart, lib/presentation/screens/generation/web_style_layout.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/presentation/screens/generation/desktop_layout.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bc1f3c82e7fca9fe35808a7765673c142aa53c029685051556d98de1ed0285"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060renderObject is! RenderBox || !renderObject.hasSize\u0060 appears character-identically in 10 files \u2014 lib/presentation/screens/generation/mobile_generation_controller.dart, lib/presentation/screens/generation/mobile_generation_gestures.dart, lib/presentation/screens/generation/widgets/fixed_tags_sidebar/fixed_tags_link_controller.dart, lib/presentation/screens/generation/widgets/sidebar_link_painter.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/presentation/screens/generation/mobile_generation_controller.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d9266b6219bf3e455842459e4e75eff56d71257c8c046587251573450b650f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060request.apiKey != null \u0026\u0026 request.apiKey!.trim().isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart, lib/presentation/prompt_assistant/services/provider_adapters/openai_responses_adapter.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/presentation/prompt_assistant/services/provider_adapters/openai_chat_completions_adapter.dart"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"a584b9924dfc36309030930ec2c1f2dba500e2c46fb6d9e120e4cd6f0e15b278"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060request.dateStart != null || request.dateEnd != null\u0060 appears character-identically in 2 files \u2014 lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart, lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f136bbe4d5d9c3653bd67f2f87b3b818b2b433cb3f03eebfebcd24549014847"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response?.spot != null \u0026\u0026 event is! FlPointerExitEvent \u0026\u0026 event is! FlLongPressEnd\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/statistics/widgets/charts/parameter_distribution_bar.dart, lib/presentation/screens/statistics/widgets/charts/weekday_bar_chart.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/presentation/screens/statistics/widgets/charts/parameter_distribution_bar.dart"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bd38b4c34903870e6005b5d8fd830e5989a05cc147fe1fd2c44c48eb472107"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result != null \u0026\u0026 result.files.isNotEmpty\u0060 appears character-identically in 3 files \u2014 lib/presentation/screens/generation/handlers/vibe_import_handler.dart, lib/presentation/screens/generation/widgets/precise_reference_panel.dart, lib/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_advanced_executor.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/presentation/screens/generation/handlers/vibe_import_handler.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52a67932529266d489833bdfbaee31ca88ce318c87422d3abbbb6bba850feba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.success \u0026\u0026 result.metadata != null\u0060 appears character-identically in 3 files \u2014 lib/data/services/image_metadata_service.dart, lib/data/services/metadata/metadata_isolate_worker.dart, tool/metadata/check_metadata_extraction.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/data/services/image_metadata_service.dart"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b3a87d9d0c6cad45862d863b7299f6ab1f213c9553217d5f3f921fd45bef33"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060segmentLength \u003C 2 || offset \u002B segmentLength \u003E bytes.length\u0060 appears character-identically in 2 files \u2014 lib/core/utils/exif_container.dart, lib/data/models/online_gallery/gelbooru_post_parser.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/core/utils/exif_container.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26c87209b42b1999147d3e66fd22f03873ab0df528cae2524c1e8279a44dc0c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060separator \u003C= 0 || separator == value.length - 1\u0060 appears character-identically in 2 files \u2014 lib/core/agent/skill_catalog.dart, lib/core/cloud_sync/backend/github_cloud_sync_backend.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/core/agent/skill_catalog.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcf3f2ada7cfdd2514ab6057b2827984adcf82c84a2c624623c624bba76e19e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060session.focusedInpaintEnabled \u0026\u0026 frameController.hasOutpaintChanges\u0060 appears character-identically in 2 files \u2014 lib/presentation/widgets/image_editor/controllers/editor_canvas_resize_controller.dart, lib/presentation/widgets/image_editor/controllers/editor_session_initializer.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/presentation/widgets/image_editor/controllers/editor_canvas_resize_controller.dart"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d0f7ba7cc5ac48343aa3c4526150f87951ab0de215526dec0ff4973e9abe4c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060showCancel \u0026\u0026 batchStatus.currentImage \u003E 0 \u0026\u0026 batchStatus.totalImages \u003E batchStatus.currentImage\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/generation/mobile_generation_chrome.dart, lib/presentation/screens/generation/widgets/generation_controls/generate_button.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/presentation/screens/generation/mobile_generation_chrome.dart"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3aa0143e35eb556d52faefa6e784d7b4144b24125ec8e7866bbee4486a288c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060signature is String \u0026\u0026 signature.isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart, lib/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.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/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"478568b5863012b6cd001840b1d3bc7bdf11a03b9d505b4483c0a8ff6e15cbce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060size == null || size.$1 \u003C= 0 || size.$2 \u003C= 0\u0060 appears character-identically in 2 files \u2014 lib/presentation/providers/generation/generation_models.dart, lib/presentation/widgets/common/image_comparison_view.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/presentation/providers/generation/generation_models.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9a20da01bb57e5fdd139ad30049849981ee43ccf63f118dc0eb7d4ebc820b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060slot == GalleryTreeDropSlot.child \u0026\u0026 source.parentId == category.id\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/tag_library_page/widgets/category_tree_view.dart, lib/presentation/widgets/gallery/gallery_category_tree_view.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/presentation/screens/tag_library_page/widgets/category_tree_view.dart"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7749588616ec6df621d8d15fe6d178664d15072663c73f1963270efcc30e03"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source.width == width \u0026\u0026 source.height == height\u0060 appears character-identically in 2 files \u2014 lib/core/utils/pica_lanczos_resizer.dart, tool/diagnostics/pica_resize_benchmark.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/core/utils/pica_lanczos_resizer.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ef1c9815b5eb576dc37331d311ae826207b1fa60a2065519550235c340d54d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sourceDescriptor.width \u003C= 0 || sourceDescriptor.height \u003C= 0 || sourceDescriptor.width \u003E _maxSourceDimension || sourceDescriptor.height \u003E _ma\u2026\u0060 appears character-identically in 2 files \u2014 lib/core/mosaic/mosaic_render_service.dart, lib/core/watermark/watermark_render_service.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/core/mosaic/mosaic_render_service.dart"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a07ce35a6a3a05a63b5f115c8695638e9651f2838eba24813bef392453afb86"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sourceId == GallerySourceId.danbooru || sourceId == GallerySourceId.safebooru\u0060 appears character-identically in 2 files \u2014 lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart, lib/data/services/online_gallery/online_gallery_search_service.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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7387f4e255b0a44feec57c353344d9ada1d38d7b8cc7b23014245cb06e8af7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sourceWidth == null || sourceHeight == null\u0060 appears character-identically in 2 files \u2014 lib/presentation/providers/generation/image_workflow_geometry_helpers.dart, lib/presentation/widgets/image_editor/controllers/editor_session_initializer.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/presentation/providers/generation/image_workflow_geometry_helpers.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a75bf1a8dbd1acdcdadc716cdbd42b654b2d6d84f63c5d85bb89d54d975e93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sourceWidth == targetWidth \u0026\u0026 sourceHeight == targetHeight\u0060 appears character-identically in 2 files \u2014 lib/core/utils/inpaint_mask/inpaint_mask_operations.dart, lib/core/utils/pica_lanczos_resizer.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/core/utils/inpaint_mask/inpaint_mask_operations.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb8046233f9bca15e609cb889be004bd8b999c71e8ba97c649fc4f1fc8f2abd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state.baseWidth != null \u0026\u0026 state.baseHeight != null\u0060 appears character-identically in 2 files \u2014 lib/presentation/providers/generation/image_workflow_controller.dart, lib/presentation/providers/generation/image_workflow_params_sync_service.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/presentation/providers/generation/image_workflow_controller.dart"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"48090588cbed84d980d46ffc88bac7397632d7b832613039f4a415087ac67b75"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state.isBusy || state.needsPreviewConfirmation\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/cloud_sync/cloud_sync_dashboard.dart, lib/presentation/screens/cloud_sync/cloud_sync_security_section.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/presentation/screens/cloud_sync/cloud_sync_dashboard.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a4317fd3de58b214f10579864222c96e29ed335a5f6f01be688626f29e27c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state.isDrawing \u0026\u0026 state.currentStrokePoints.isNotEmpty\u0060 appears character-identically in 3 files \u2014 lib/presentation/widgets/image_editor/tools/blur_tool.dart, lib/presentation/widgets/image_editor/tools/brush_tool.dart, lib/presentation/widgets/image_editor/tools/eraser_tool.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/presentation/widgets/image_editor/tools/blur_tool.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5167b98701a45583238d146379532b3ab9ba1bab5340862ac832b8ff2ad45438"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060states.contains(WidgetState.hovered) || interaction.isFocusVisible(states)\u0060 appears character-identically in 2 files \u2014 lib/presentation/agent_chat/widgets/agent_chat_header.dart, lib/presentation/widgets/common/compact_icon_button.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/presentation/agent_chat/widgets/agent_chat_header.dart"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3fe2fdd971fd2b14e4df8ea3c7d3ec51b5f30a247858afc9438b9e4a9f7c6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status == null || !RegExp(r\u0027HTTP/\\S\u002B\\s\u002B200(?:\\s|$)\u0027).hasMatch(status)\u0060 appears character-identically in 2 files \u2014 lib/core/cloud_sync/backend/webdav_collection_ensurer.dart, lib/core/cloud_sync/backend/webdav_etag_reader.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/core/cloud_sync/backend/webdav_collection_ensurer.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"18facf2ea48e90f06685728ee4d216df5c7ffe9dc8b00fadcff7d6cefc28466c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060strengths != null \u0026\u0026 i \u003C strengths.length\u0060 appears character-identically in 2 files \u2014 lib/core/utils/vibe_export_utils.dart, lib/presentation/screens/vibe_library/widgets/vibe_export_advanced/vibe_export_advanced_executor.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/core/utils/vibe_export_utils.dart"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"211babdfbd2f37f0ba51bd2af9bedcf45e5afce6258b2a6d78e4763447e2fb68"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tag.isNotEmpty \u0026\u0026 !tag.contains(\u0027:\u0027) \u0026\u0026 !tag.startsWith(\u0027-\u0027)\u0060 appears character-identically in 2 files \u2014 lib/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart, lib/data/datasources/remote/online_gallery/gelbooru_gallery_source_adapter.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/data/datasources/remote/online_gallery/donmai_gallery_source_adapter.dart"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2dc97399f135ae67888971671361b9471f2bbaa96e3d068342ed951121a609"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tagsToAdd.isEmpty \u0026\u0026 tagsToRemove.isEmpty\u0060 appears character-identically in 2 files \u2014 lib/presentation/providers/bulk_operation_provider.dart, lib/presentation/widgets/bulk_metadata_edit_dialog.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/presentation/providers/bulk_operation_provider.dart"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1161e6afe82f3ccba99db3de2b15a62f38297c8f2245e951f919ad5a31f203c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060task.width != null \u0026\u0026 task.height != null\u0060 appears character-identically in 2 files \u2014 lib/presentation/widgets/queue/task_edit_dialog.dart, lib/presentation/widgets/queue/task_list_item.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/presentation/widgets/queue/task_edit_dialog.dart"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b5b55746f30dd91c45dcc4d08cc8415a212866d2c8930e31445640d0644551"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this == bottom || this == bottomLeft || this == bottomRight\u0060 appears character-identically in 2 files \u2014 lib/core/windowing/floating_panel_geometry.dart, lib/presentation/widgets/image_editor/widgets/outpaint_edge_drag_overlay.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/core/windowing/floating_panel_geometry.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c1a34a9d9f46b5823857b4186b86f133792f9c94d10978bad3e7e3f4417fa0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this == left || this == topLeft || this == bottomLeft\u0060 appears character-identically in 2 files \u2014 lib/core/windowing/floating_panel_geometry.dart, lib/presentation/widgets/image_editor/widgets/outpaint_edge_drag_overlay.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/core/windowing/floating_panel_geometry.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f039c42d1e407c06bb0cd78c9615dddfdf196e816edcf642c944164f860f6457"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this == right || this == topRight || this == bottomRight\u0060 appears character-identically in 2 files \u2014 lib/core/windowing/floating_panel_geometry.dart, lib/presentation/widgets/image_editor/widgets/outpaint_edge_drag_overlay.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/core/windowing/floating_panel_geometry.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3c4c39dfbb7784b86f8f68fa512523b01a5a8b30bae1c91e44d044076a6869"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this == top || this == topLeft || this == topRight\u0060 appears character-identically in 2 files \u2014 lib/core/windowing/floating_panel_geometry.dart, lib/presentation/widgets/image_editor/widgets/outpaint_edge_drag_overlay.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/core/windowing/floating_panel_geometry.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5a6cbaa57b7ecf1c1e5aeaecc610551a84120cc6b9472f743de36bcbcf58ff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060thumbnail != null \u0026\u0026 thumbnail!.isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/data/models/tag_library/tag_library_entry.dart, lib/data/models/vibe/vibe_library_entry.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/data/models/tag_library/tag_library_entry.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf2b07273ecbdbc2187a8b934615cd346bb57a10037258fae3847319606a074"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060thumbnail != null \u0026\u0026 thumbnail.isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/vibe_library/widgets/vibe_card.dart, lib/presentation/widgets/common/image_detail/components/vibe_section.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/presentation/screens/vibe_library/widgets/vibe_card.dart"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"147830ead835f0fee43d8c9c757ba8b90b0ccdda1689b6b2ce088a0ea8e3be07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060thumbnailBase64 != null \u0026\u0026 thumbnailBase64.isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/core/utils/vibe_file_parser.dart, lib/core/utils/vibe_image_embedder.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/core/utils/vibe_file_parser.dart"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9492cd4c36eddec540b922c0acde2fbc634947fa55dd149b3507e478867da1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060thumbnailPath == null || thumbnailPath.isEmpty\u0060 appears character-identically in 2 files \u2014 lib/presentation/agent_chat/services/agent_resource_resolver.dart, lib/presentation/screens/tag_library_page/widgets/entry_add_dialog.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/presentation/agent_chat/services/agent_resource_resolver.dart"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd1e3701b03e663398a6d90c8ff23fcfd8f6ad695cd4be0c6e3907f4cd9e107"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060touchInput \u0026\u0026 constraints.maxWidth \u003C 600\u0060 appears character-identically in 2 files \u2014 lib/presentation/widgets/autocomplete/completion_overlay.dart, lib/presentation/widgets/autocomplete/completion_overlay_header.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/presentation/widgets/autocomplete/completion_overlay.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76912412aa52728698dbd7bfcb00aac96dff16ab1eabf601dd612a0ddfcd1e7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060transparentBackground \u0026\u0026 capabilities.supportsTransparentBackground\u0060 appears character-identically in 2 files \u2014 lib/core/utils/prompt_semantics_utils.dart, lib/data/models/image/image_params.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/core/utils/prompt_semantics_utils.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e81f41a63625754a3538ca9a7f89fd79b11e4beca375bd7392463ea10722db"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060turns.isNotEmpty \u0026\u0026 turns.last[\u0027role\u0027] == role\u0060 appears character-identically in 2 files \u2014 lib/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart, lib/presentation/prompt_assistant/services/provider_adapters/gemini_generate_content_adapter.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/presentation/prompt_assistant/services/provider_adapters/anthropic_messages_adapter.dart"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"4406289a17543a7ca53186bcc1c6433e7af8aa5aa919f9c113824e710c7d9204"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060uri != null \u0026\u0026 uri.scheme == \u0027https\u0027 \u0026\u0026 uri.host.isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/data/datasources/remote/online_gallery/quick_tag_cloud_gallery_mapper.dart, lib/data/repositories/online_gallery_local_favorites_repository.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/data/datasources/remote/online_gallery/quick_tag_cloud_gallery_mapper.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4a2ce1803c4c051eca8c1c3d17239d63be76a51196b1627ad10ce1404ad3bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value is String \u0026\u0026 value.trim().isNotEmpty\u0060 appears character-identically in 3 files \u2014 lib/core/agent/agent_tool_presentation.dart, lib/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart, lib/presentation/prompt_assistant/services/provider_adapters/prompt_assistant_adapter.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/core/agent/agent_tool_presentation.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8868ba148c6f5a21fc8ccdab0e4ffe8144a8578fb880e694d4e0195834e2ea2e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value is int \u0026\u0026 value \u003E= 0 \u0026\u0026 value \u003C= 0xFFFFFFFF\u0060 appears character-identically in 2 files \u2014 lib/data/models/mosaic/mosaic_settings.dart, lib/data/models/watermark/watermark_settings.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/data/models/mosaic/mosaic_settings.dart"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2627a8e966f0b7e43da183136491594c29e2df82e0857807e4bd6f1afcb61cc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value is! String || value.trim().isEmpty\u0060 appears character-identically in 3 files \u2014 lib/data/datasources/local/random_tag_library_data_source.dart, lib/data/models/gallery/nai_image_metadata_raw_decoder.dart, lib/data/models/interaction/user_question.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/data/datasources/local/random_tag_library_data_source.dart"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c6491228dcd86ad6b41296d491f0c521eeda71e6c61f707c877e94f20958e3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.composing.isValid \u0026\u0026 !value.composing.isCollapsed\u0060 appears character-identically in 2 files \u2014 lib/presentation/agent_chat/models/agent_chat_slash_syntax.dart, lib/presentation/widgets/prompt/tag_editor_view.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/presentation/agent_chat/models/agent_chat_slash_syntax.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0f83447a59375a548ae0f209623a97e8ba728f7afac0e528c8fa27ceef4979"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.length \u003E= 2 \u0026\u0026 ((value.startsWith(\u0027\u0022\u0027) \u0026\u0026 value.endsWith(\u0027\u0022\u0027)) || (value.startsWith(\u0022\u0027\u0022) \u0026\u0026 value.endsWith(\u0022\u0027\u0022)))\u0060 appears character-identically in 2 files \u2014 lib/core/agent/harness/skills.dart, lib/core/agent/skill_catalog.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/core/agent/harness/skills.dart"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"37442e4f9faf0161c7c68f7ecd6471950aa8f1a5878724518f1164cd18e92854"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.startsWith(\u0027/\u0027) || RegExp(r\u0027^[A-Za-z]:\u0027).hasMatch(value)\u0060 appears character-identically in 2 files \u2014 lib/core/agent/skill_archive_extractor.dart, lib/data/services/precise_ref_library_archive_service.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/core/agent/skill_archive_extractor.dart"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3536d9512def0e8da4baa46bc7cb60cea438e921621984c8d82ee1451348152"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060vibe.vibeEncoding.isNotEmpty || (vibe.rawImageData != null \u0026\u0026 vibe.rawImageData!.isNotEmpty) || (vibe.thumbnail != null \u0026\u0026 vibe.thumbnail!.i\u2026\u0060 appears character-identically in 2 files \u2014 lib/core/utils/vibe_export_utils.dart, lib/presentation/screens/generation/handlers/vibe_export_handler.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/core/utils/vibe_export_utils.dart"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"8212fb36a8b6b3a24982e586884982af9d54e4dc3cb0908b913b076d57c1ec34"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060widget.isSelectionMode || !widget.longPressSelects\u0060 appears character-identically in 2 files \u2014 lib/presentation/screens/tag_library_page/widgets/entry_card.dart, lib/presentation/screens/tag_library_page/widgets/entry_list_item.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/presentation/screens/tag_library_page/widgets/entry_card.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"194e56a29395b39ad72c4967ba515e84867fcee914e38197dcccf29a8981ad28"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060widget.task.thumbnailUrl != null \u0026\u0026 widget.task.thumbnailUrl!.isNotEmpty\u0060 appears character-identically in 2 files \u2014 lib/presentation/widgets/queue/task_edit_dialog.dart, lib/presentation/widgets/queue/task_list_item.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/presentation/widgets/queue/task_edit_dialog.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7105c7b7cab63f9003d4d384cac770d86874a2d3ab84d733937005df5b0cf3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060width \u003E _maxImageDimension || height \u003E _maxImageDimension\u0060 appears character-identically in 2 files \u2014 lib/presentation/widgets/common/image_detail/file_image_detail_data.dart, lib/presentation/widgets/common/image_detail/image_detail_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/presentation/widgets/common/image_detail/file_image_detail_data.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c09ed5fee1035cfe429f756494b819b747cad8e22ddae76cb5642bdcb0e9c4"}},{"ruleId":"X5","level":"note","message":{"text":"Nullable reference types not enabled everywhere: 0/1 C# file(s) are in a nullable-enabled context. This repository commits no project file, so nothing sets \u003CNullable\u003Eenable\u003C/Nullable\u003E for it: a file is enabled only by its own \u0060#nullable enable\u0060, by a Unity \u0060csc.rsp\u0060 with \u0060-nullable:enable\u0060 for its assembly, or as a file-based app (\u0060#:\u0060 directives) whose \u0060#:property Nullable\u0060 does not turn it off. NRTs catch a whole class of null-deref bugs at compile time."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"80b24de9378624a0ce4846d60457395befcaec8e109ea81d289a370c9f7bfd5d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060partialLength\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/core/autocomplete/cooccurrence_pack_repository.dart"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5f0f81f22542a1151a0365dd4de256284b5e3492603403c2ca1cb6ee06631f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060resolveFuzzy\u0060 turns every thrown error into \u0060{}\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/core/autocomplete/fast_tag_service.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b7633afc2e79571b841cac987cecc0b169b7cb852ae839532bc45d7d4ce134"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_searchOptionalDictionary\u0060 turns every thrown error into \u0060[]\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/core/autocomplete/fast_tag_service.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57bf37b66770a24fbf6a566c660767378a01d2420dd17ec3535b6e9f45533a9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_readMetadata\u0060 turns every thrown error into \u0060{}\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/core/autocomplete/zh_dictionary_service.dart"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"810d5a3885a053a386ac93b2e505ea870912fd6e73d3bd6ff5fe618477e404ee"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_graphErrorCodes\u0060 answers \u0060[]\u0060 when \u0060FormatException\u0060 is thrown, with no log or rethrow \u2014 a malformed value silently becomes that default. Log the input or fail validation. 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/core/cloud_sync/backend/onedrive_api_client.dart"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5307d68e0a79069dca0b16c86e87378ca809fae16f1a85f5b2dc51e6562599"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parsePending\u0060 (in \u0060fromMap\u0060) turns every thrown error into \u0060[]\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/core/database/datasources/gallery_records.dart"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"693a7f5eca0f25db0e38d71c396d2150e18dca6f2e1e5d047141ed1bb923014c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_getTableCount\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/core/database/datasources/gallery_schema.dart"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef791575721d5cfca04700625327a2d8e73500f0f71195ac1708d7c4de8b313e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_read\u0060 answers \u0060{}\u0060 when \u0060FormatException\u0060 is thrown, with no log or rethrow \u2014 a malformed value silently becomes that default. Log the input or fail validation. 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/core/derivatives/derivative_registry.dart"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d0961227e8312f1ac1a9d8521d63b013df88ca7fb6477d9cd67ac39917d1f1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getAndroidSupportedAbis\u0060 turns every thrown error into \u0060[]\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/core/services/app_installation_service.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8cebb33d99ba821d5a35244bd27955c573b8f520be8cceeb1877d05001e88b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_safeLength\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/core/services/verified_resumable_downloader.dart"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c84ed92c92e0e315f8cda036d1e136c1a75eb3516419e77efb9d4a4d7ef3d2f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadFailedTasks\u0060 turns every thrown error into \u0060[]\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/core/storage/queue_state_storage.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06d2646b9315035227f4e1ec3d16fbe4633288f9528acb5f1396d8a2c233c74"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getFavorites\u0060 turns every thrown error into \u0060[]\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/core/storage/tag_favorite_storage.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38362e6186d87fc2ecede5da31b7a67628b3e1250df874ee36405a11395fcd6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getTemplates\u0060 turns every thrown error into \u0060[]\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/core/storage/tag_template_storage.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"801cfc15304db8d2329a8816b65d49dbc7c228afb654c83a71afb2e0a59d85fb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_getAuthQueryParams\u0060 turns every thrown error into \u0060{}\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/data/datasources/remote/danbooru_api_service.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"52484480e2e4b17795d1dee1b4c8abaac73cc4a4a429cd81068f58bd307b6845"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_decodeList\u0060 turns every thrown error into \u0060[]\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/data/datasources/remote/online_gallery/ai_tag_gallery_source_adapter.dart"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdca30e855ce0f00ceda1e8b2f88fc031e1f4848c4dae37e1ad5b9794a50201"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_readName\u0060 turns every thrown error into \u0060\u0027\u0027\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/presentation/agent_chat/services/agent_chat_session_summary_cache.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"82cdb68cd6a78f69cc96ab19d0693737d6a96f8875ce25ed5986b62824b436fb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_appVersion\u0060 turns every thrown error into \u0060\u0027unknown\u0027\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/presentation/mcp/providers/mcp_server_notifier.dart"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"3661de931a859669eda2f90dc57d10f68cbb4efce3fce0c2deec1458f9787b79"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_comfyChips\u0060 turns every thrown error into \u0060[]\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/presentation/screens/generation/widgets/img2img_source_section.dart"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c47954f942b5848a45c9f2c179920e4224f5c96ef88c8f72423a4da39cb8e9"}}],"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-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":68,"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."]}]}