{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"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":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02: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":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"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":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"RuleBuilder.buildForPage (cyclomatic 162): RuleBuilder.buildForPage has cyclomatic complexity 162 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/akashi_bonus/lib/rule_builder.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a2f067161932feebb3181df32d415579f3193d348aac680d7d1c535225dfdf"}},{"ruleId":"D1","level":"warning","message":{"text":"_YahagiShellState._buildShell (cyclomatic 126): _YahagiShellState._buildShell has cyclomatic complexity 126 (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/main.dart"},"region":{"startLine":2455}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f29cfa983e8e7d7e740a0bc8f9d2aadcda23fb8f97c66d5fb508746a51fd53"}},{"ruleId":"D1","level":"warning","message":{"text":"_InformationPanelState.build (cyclomatic 117): _InformationPanelState.build has cyclomatic complexity 117 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/main.dart"},"region":{"startLine":4534}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b451737d654e2b51f6d915a2fd98974b5f340265441859739c146c0f2a652d"}},{"ruleId":"D1","level":"warning","message":{"text":"GameStateSerializer.deserialize (cyclomatic 112): GameStateSerializer.deserialize has cyclomatic complexity 112 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_serializer.dart"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"3065cae23c295972b4a979ff59d7a0937d6ae3c596a4a315d3a043bfde8f3c49"}},{"ruleId":"D1","level":"warning","message":{"text":"TargetGroupResolver.resolve (cyclomatic 87): TargetGroupResolver.resolve has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/akashi_bonus/lib/name_resolver.dart"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"63905b2bd6acc9997aba3c55ef59730c10937fe5868f5ae54edac8608742c0bb"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpeditionStrings.conditionLabel (cyclomatic 87): ExpeditionStrings.conditionLabel has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_strings.dart"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"033a7e53de41091734ef8c30bb671c445afc4053eb826e7c5ce53e893419ca37"}},{"ruleId":"D1","level":"warning","message":{"text":"QuestProgressEngine._events (cyclomatic 81): QuestProgressEngine._events has cyclomatic complexity 81 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_progress_engine.dart"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"88499b5db3b18194610e9e0e48d2f73d80ed1a745cc7b8a902556970fa0f92d1"}},{"ruleId":"D1","level":"warning","message":{"text":"GameStateReducer.reduce (cyclomatic 80): GameStateReducer.reduce has cyclomatic complexity 80 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5600b324c4e201a71f6df5897239351e1c04a09aa77dbf42261149766e8e1b"}},{"ruleId":"D1","level":"warning","message":{"text":"QuestProgressEngine.process (cyclomatic 77): QuestProgressEngine.process has cyclomatic complexity 77 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_progress_engine.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabbb37c574da4807088beb274b146b747f4bc3641c023fd9eaa481e04556bba"}},{"ruleId":"D1","level":"warning","message":{"text":"BackupArchive.decode (cyclomatic 72): BackupArchive.decode has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/backup/record_backup.dart"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb89837b64a8bc703bc5c1cbeb11f4586d4297ab29132cdccfaab0e58094683e"}},{"ruleId":"D1","level":"warning","message":{"text":"GameNotificationCoordinator._buildOngoingItems (cyclomatic 71): GameNotificationCoordinator._buildOngoingItems has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notification/game_notification_coordinator.dart"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01697d56dcf7adbf029001c7e36b9f98561a256110a3f7b9a9975aca9925723"}},{"ruleId":"D1","level":"warning","message":{"text":"MainActivity.configureFlutterEngine (cyclomatic 69): MainActivity.configureFlutterEngine has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"f734dbe76623ec4200b032836ee416255fa879ac0e2820b0fdf72cdc4e02ccd9"}},{"ruleId":"D1","level":"warning","message":{"text":"GameNotificationCoordinator._buildScheduledAlarms (cyclomatic 67): GameNotificationCoordinator._buildScheduledAlarms has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notification/game_notification_coordinator.dart"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6aac8c656dd1ca0cce5ccd56c3a1e3fe04ea4cd1eec37199c8d17fe82240cf9"}},{"ruleId":"D1","level":"warning","message":{"text":"_LogbookExperiencePageState._buildTable (cyclomatic 60): _LogbookExperiencePageState._buildTable has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_experience_page.dart"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4b6f64fd72a3bef56411afff8ceb07fccedac01f09c5cdda16f1598dfb8925"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutSettingsController.load (cyclomatic 60): LayoutSettingsController.load has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/layout_settings_controller.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9617f81d6667e9e78ad8797065c2579ebbc49e05f46a232bc6f195ae059b1513"}},{"ruleId":"D1","level":"warning","message":{"text":"GameModPng.inspect (cyclomatic 56): GameModPng.inspect 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModPng.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7eed64b2f75f05bd79121f3171920acfae2ed6e25e2963d2bdb58ac22d73bb"}},{"ruleId":"D1","level":"warning","message":{"text":"SortieExperienceController.accept (cyclomatic 53): SortieExperienceController.accept has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_experience_controller.dart"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ec62cbe0691e3db400fbab77f3b4b07d6263d3d25895f523551813054078e9"}},{"ruleId":"D1","level":"warning","message":{"text":"GameStateController.allowsCaptureEvent (cyclomatic 51): GameStateController.allowsCaptureEvent has cyclomatic complexity 51 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_controller.dart"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d4c90b09de10094b89b71aa9370cd4dd9303ba039bb50006c7aead090b4ec7"}},{"ruleId":"D1","level":"warning","message":{"text":"_SortieExperienceCardState._shipTable (cyclomatic 51): _SortieExperienceCardState._shipTable has cyclomatic complexity 51 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_experience_card.dart"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad2b8b382cc782e94c0e225889b5fa164ff7749df1be2265c876e0ac3205a26"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpeditionStrings._localizedFlagshipType (cyclomatic 49): ExpeditionStrings._localizedFlagshipType has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_strings.dart"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a337d85e7c61ff859cccfa956e49d959c9b243d105c71e625f512a362bfd178"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstructionSummaryCard._buildConstructionSlotAt (cyclomatic 47): ConstructionSummaryCard._buildConstructionSlotAt 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/src/fleet/construction_summary_card.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"387b87966c5c1447c9e24fa0f980024c4198950189703d8651038adcf4d483de"}},{"ruleId":"D1","level":"warning","message":{"text":"DatasetValidator.validate (cyclomatic 46): DatasetValidator.validate 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":"tool/akashi_bonus/lib/dataset_validator.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c662a623269d6d674929f2c3cc3829a8b877539fd0601aec89542552bf0f0d5a"}},{"ruleId":"D1","level":"warning","message":{"text":"_CompositionImagePageState._save (cyclomatic 45): _CompositionImagePageState._save has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/composition_image_page.dart"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"df30e69f2bc7af560d16225b6d225cfdb44088f82ead36c1835687e702caa3c3"}},{"ruleId":"D1","level":"warning","message":{"text":"GameResourceCacheEngine.fetch (cyclomatic 45): GameResourceCacheEngine.fetch has cyclomatic complexity 45 (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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheEngine.kt"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa618ee1b6eeffd4b565ad8567e190be9412f011a616f9997c351dd133e56f23"}},{"ruleId":"D1","level":"warning","message":{"text":"_PoiBattleSimulator._shell (cyclomatic 44): _PoiBattleSimulator._shell has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38efc18b93a2babff20834dbd20b26169ecb5e7f04307002cf1049d6bf87850"}},{"ruleId":"D1","level":"warning","message":{"text":"GameModsStrings.resourceLabel (cyclomatic 44): GameModsStrings.resourceLabel has cyclomatic complexity 44 (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. This is NOT this file\u0027s highest cyclomatic complexity: GameModsStrings.reason (cyclomatic 51) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_strings.dart"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df382176860c19bf43b5e5b8c4efc0a19d9b9079a551f85cba5ffb43834a2c8"}},{"ruleId":"D1","level":"warning","message":{"text":"GameModArchive.unpackChecked (cyclomatic 44): GameModArchive.unpackChecked has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModArchive.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0633343a5fb37f35c0c92f55e53491173455da7d342478097d64fe78ad97407"}},{"ruleId":"D1","level":"warning","message":{"text":"GameStateController.accept (cyclomatic 43): GameStateController.accept has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_controller.dart"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"76600e67d4403c89a696cf2734f672cd569ba6609ffc0eda3a26eff3188853e2"}},{"ruleId":"D1","level":"warning","message":{"text":"SortieResourceLedger._reconcileCharge (cyclomatic 42): SortieResourceLedger._reconcileCharge has cyclomatic complexity 42 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_resource_ledger.dart"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddffd034dc58a9427999ea10241eae794e66c6090aa031135b2e2c1a7e4572cf"}},{"ruleId":"D1","level":"warning","message":{"text":"_BattleResultWarningOverlayState._checkAdvanceSafety (cyclomatic 41): _BattleResultWarningOverlayState._checkAdvanceSafety has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/battle_result_warning_overlay.dart"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50f6f6ba899f38b92fa06eddf908f1db4666d65ef16879e1607fcea32841b61"}},{"ruleId":"D1","level":"warning","message":{"text":"_FleetSummaryMetrics.build (cyclomatic 41): _FleetSummaryMetrics.build has cyclomatic complexity 41 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_summary_card.dart"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd45c2d9c0531598cefb985175a397a9196474fb45bb81b57244e7b68fd47a3a"}},{"ruleId":"D1","level":"warning","message":{"text":"SenkaState.fromJson (cyclomatic 41): SenkaState.fromJson has cyclomatic complexity 41 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_state.dart"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad048560b40d0dfd7694eb57ff6a00def7d6ab0ccb925039831a532647b973c6"}},{"ruleId":"D1","level":"warning","message":{"text":"_GameModsPageState._details (cyclomatic 41): _GameModsPageState._details has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"602f2b6d930cd0c88ad038bdb6a72a7acd2e0982e160bed624d286126eedb478"}},{"ruleId":"D1","level":"warning","message":{"text":"GameStateReducer._battleResult (cyclomatic 40): GameStateReducer._battleResult has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":3070}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb8d9e69fb117b9f47c2e4a6fc14206efe37256ee24d6a5848ce85803f68c9c"}},{"ruleId":"D1","level":"warning","message":{"text":"GameModLibrary.scan (cyclomatic 40): GameModLibrary.scan has cyclomatic complexity 40 (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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibrary.kt"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f85c78e1c1ccc504952d61bba83e269a5e882d3c2f55f2c09d676e26f468fbb"}},{"ruleId":"D1","level":"warning","message":{"text":"BattleController._applyBattlePhase (cyclomatic 38): BattleController._applyBattlePhase has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_controller.dart"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afe6aad0f785a01ed1d8d8187b89744a2979c1747554f9d60ee5fdcba23469e"}},{"ruleId":"D1","level":"warning","message":{"text":"GameBrowserToolbar.build (cyclomatic 37): GameBrowserToolbar.build 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/src/browser/game_browser_toolbar.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7d158f9185496a00c881adf7322241ba0810b3745fc46be302fa85f5494d72"}},{"ruleId":"D1","level":"warning","message":{"text":"ShipSubtitleRuntimeController._synchronize (cyclomatic 37): ShipSubtitleRuntimeController._synchronize 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/src/subtitles/ship_subtitle_runtime_controller.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e717625e9508785ecab4c62307d47d4534c402a6a7293f53114fa012ba09f50"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeGameWarningDialogSpec.parse (cyclomatic 37): NativeGameWarningDialogSpec.parse has cyclomatic complexity 37 (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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogState.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"936256f36417a2ddac00716839991721b092e37deb367ae1dc66068d5c4bda4e"}},{"ruleId":"D1","level":"warning","message":{"text":"_FleetShipStatusCapsuleState.build (cyclomatic 36): _FleetShipStatusCapsuleState.build has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_ship_status_capsule.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"174a37aeab0f55d1fa5ee7e694f2e1e9dec082b05cf1dbdcc9f84203d07f5287"}},{"ruleId":"D1","level":"warning","message":{"text":"_FleetSummaryCardState.build (cyclomatic 36): _FleetSummaryCardState.build 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/src/fleet/fleet_summary_card.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"436bb4bb1b5515151599b4507160f89c12a47104275ec8926433d7a3a85cb818"}},{"ruleId":"D1","level":"warning","message":{"text":"_ResourceTrendChartState.build (cyclomatic 36): _ResourceTrendChartState.build has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/resource_trend_chart.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"0299a9f456c12ef557c50e70c2f75115ca546595c72ab96bc7e6daa3e834adb8"}},{"ruleId":"D1","level":"warning","message":{"text":"_GameResourceCacheSectionState.build (cyclomatic 36): _GameResourceCacheSectionState.build has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/game_resource_cache_section.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3527acb1d0244a9991ef21328d9eb585e88dba8b8c00573ae9af38a60cc16bae"}},{"ruleId":"D1","level":"warning","message":{"text":"SortieExperienceController._move (cyclomatic 36): SortieExperienceController._move has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_experience_controller.dart"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"098d2d524450eb71a8096771d83c6bc5bb3a3e2d8d0ee188dfe9d5d3a4c4c8d9"}},{"ruleId":"D1","level":"warning","message":{"text":"GameInfoNoticeController.calculateFleetTrainingCruiserBonus (cyclomatic 35): GameInfoNoticeController.calculateFleetTrainingCruiserBonus has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notice/game_info_notice_controller.dart"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"774a147bfdd44ac3f6bdc7decdede7553b3ff49992ba24452daccb67ad20643b"}},{"ruleId":"D1","level":"warning","message":{"text":"GameStateReducer._start2 (cyclomatic 34): GameStateReducer._start2 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/src/game_state/game_state_reducer.dart"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aaa221a08ddceba9b4c5795d316a461aafe921062def2243d2526944e66c112"}},{"ruleId":"D1","level":"warning","message":{"text":"LogbookDatabase._validateBackupRows (cyclomatic 34): LogbookDatabase._validateBackupRows 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/src/logbook/logbook_database.dart"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a1c0745f4f6473cd799bab3eeea4daceef109807c9fb4d0a3415b4306dece6"}},{"ruleId":"D1","level":"warning","message":{"text":"_NativeActivityGameSurfaceState._dispatchCurrentEvent (cyclomatic 34): _NativeActivityGameSurfaceState._dispatchCurrentEvent 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/src/native_activity_game_surface.dart"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a7535cb12de0b43f8b01a4b80e1d41c69229a883e0020d87b83767532e12ba"}},{"ruleId":"D1","level":"warning","message":{"text":"BackupArchive.merge (cyclomatic 33): BackupArchive.merge 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/src/backup/record_backup.dart"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"640b6e46af1aebcf3abe877cf413649a160bba04af766b8f56c09ec8a9d6f384"}},{"ruleId":"D1","level":"warning","message":{"text":"BattleDetailReplayBuilder._parseShell (cyclomatic 33): BattleDetailReplayBuilder._parseShell 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/src/battle/battle_detail_replay_builder.dart"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc99b347e19cbe844dc51a7fa1c3d51b5dbff3080fbc140da89bfced38f288a9"}},{"ruleId":"D1","level":"warning","message":{"text":"AndroidCaptureEvent.decode (cyclomatic 33): AndroidCaptureEvent.decode has cyclomatic complexity 33 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/game_capture_port.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b803f700c4e48bc27a249627e48dbe64fd3437a2ba9154db103ed826a5ffb05"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetShipMinimalRow._statusGrid (cyclomatic 33): FleetShipMinimalRow._statusGrid 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/src/fleet/fleet_ship_minimal_row.dart"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c34f8b262f235cb85684b73da6459374a57e2583cd8db3234476a32d6b7d625"}},{"ruleId":"D1","level":"warning","message":{"text":"GameStateReducer._parseShips (cyclomatic 33): GameStateReducer._parseShips 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/src/game_state/game_state_reducer.dart"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f087ec765fc58b2c6b756aca9ff909df7b129fcb785da0cda043333bb5ba906"}},{"ruleId":"D1","level":"warning","message":{"text":"QuestProgressEngine.restore (cyclomatic 33): QuestProgressEngine.restore 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/src/quest/quest_progress_engine.dart"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7efbbab4b221ac73e8feeecb59863f73ab98adba02d2edb8708385d5cd1d66"}},{"ruleId":"D1","level":"warning","message":{"text":"_SenkaCalendarViewState._cell (cyclomatic 33): _SenkaCalendarViewState._cell 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/src/senka/senka_calendar_view.dart"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e08ae936c3d286022dff70c64ed86388a7388e4e96431ccd039936d0931e16b"}},{"ruleId":"D1","level":"warning","message":{"text":"build_enemy_catalog.build_catalog (cyclomatic 33): build_enemy_catalog.build_catalog 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":"tool/build_enemy_catalog.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e380fc1906724c9a1732e7a12b585011adf5cfd7e3954fa5c4a1818cf796abbb"}},{"ruleId":"D1","level":"warning","message":{"text":"BattleController._applyResult (cyclomatic 32): BattleController._applyResult has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_controller.dart"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab37533dfc5cf2c972ff77d41f4f9bd9f5825fffc53ed4e1c3dbe09b4c995bc0"}},{"ruleId":"D1","level":"warning","message":{"text":"_BattleResultWarningOverlayState._showWarningDialog (cyclomatic 32): _BattleResultWarningOverlayState._showWarningDialog has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/battle_result_warning_overlay.dart"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdc63fb5386abb201f1e029f51b3157720adc34df6f9a0ffa895097e3bb3a04"}},{"ruleId":"D1","level":"warning","message":{"text":"DashboardCard.build (cyclomatic 32): DashboardCard.build 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/src/fleet/dashboard_card.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dac4e13ac5a0c8c153ec9a5c5650454689cf7e8cc670afdad343d0b0c902610"}},{"ruleId":"D1","level":"warning","message":{"text":"_MetricsBar.build (cyclomatic 32): _MetricsBar.build has cyclomatic complexity 32 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_information_center.dart"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"851b31d9265e490d85f49912bd9e5e3fd495def88c67d065366db7d194e03df1"}},{"ruleId":"D1","level":"warning","message":{"text":"GameStateReducer._mapInfo (cyclomatic 32): GameStateReducer._mapInfo 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/src/game_state/game_state_reducer.dart"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edd9f8dfafc77fbca4b3b940f8358d0827c269d39fd643208d2ae25e56111fe"}},{"ruleId":"D1","level":"warning","message":{"text":"SenkaReducer._ranking (cyclomatic 32): SenkaReducer._ranking 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/src/senka/senka_reducer.dart"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b124fecf8ac4143d768dcb372dd4da2a20a27478572292f8bd56fddfc85978"}},{"ruleId":"D1","level":"warning","message":{"text":"GameRuntimeSettingsPage.build (cyclomatic 32): GameRuntimeSettingsPage.build 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/src/settings/game_runtime_settings_page.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0b82c3ada584628ede4887c59f9b9ada3717d3a7d60e2ee25a3e08182a712c"}},{"ruleId":"D1","level":"warning","message":{"text":"_EquipmentRow.build (cyclomatic 32): _EquipmentRow.build 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/src/toolbox/composition_image_card.dart"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"b951ccba99608e3557e5147f26cf81c7b943f5dac523b552147a9e1de13c4f19"}},{"ruleId":"D1","level":"warning","message":{"text":"_GameModsPageState._badges (cyclomatic 32): _GameModsPageState._badges 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/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"789b9d27826b8c2da52d011c36c5f16fbde8bb82c97744b085c5696b9198680b"}},{"ruleId":"D1","level":"warning","message":{"text":"GameResourceCacheManager.onMethodCall (cyclomatic 32): GameResourceCacheManager.onMethodCall 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheManager.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4538ff3c18897541336153e17d9afbacdc98ab0b78cf8e6b587510e6d936ac33"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceNavigation.build (cyclomatic 31): WorkspaceNavigation.build has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/main.dart"},"region":{"startLine":4004}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb73b3a02bc61f3de5ab5203adcde18a973c3e6717a13e6437215a90e52b19b"}},{"ruleId":"D1","level":"warning","message":{"text":"RecordBackupService.restore (cyclomatic 31): RecordBackupService.restore has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/backup/record_backup.dart"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"5927ebc7793af145e37dd8581dcaa00f18115dd54493db8871b3ac39b648292c"}},{"ruleId":"D1","level":"warning","message":{"text":"GameResourceBaselineCatalog.decode (cyclomatic 31): GameResourceBaselineCatalog.decode has cyclomatic complexity 31 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/game_resource_baseline_catalog.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8828d3e62cb78ab6f745afbbd9790838041519170b3b3b231ef0820262f5aa2"}},{"ruleId":"D1","level":"warning","message":{"text":"_QuestCenterPageState.build (cyclomatic 31): _QuestCenterPageState.build has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_center_page.dart"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dea2d8bfd352a1f04f3e0656424b630d8b18b26c65b4510871e810f176ed44c"}},{"ruleId":"D1","level":"warning","message":{"text":"CompositionImageCard.build (cyclomatic 31): CompositionImageCard.build has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/composition_image_card.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fc73f62434c4b5a6990b19b5ccdbd90adac06fd7ed4e0329ec8a2a8337b78e"}},{"ruleId":"D1","level":"warning","message":{"text":"_GameModsPageState._coordinateRow (cyclomatic 30): _GameModsPageState._coordinateRow 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/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"952b3522201d5560fc070945c21f2c1b3ef1d587e90120402b11842f4c65be17"}},{"ruleId":"D1","level":"warning","message":{"text":"FixedCanvasScaleApplier.apply (cyclomatic 30): FixedCanvasScaleApplier.apply 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/FixedCanvasScaleApplier.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe3076cb2270a3cb00d70fa7d22c34c37f428972e181e49ac028724389e3c8f"}},{"ruleId":"D1","level":"warning","message":{"text":"_CompactBattlePanel.build (cyclomatic 29): _CompactBattlePanel.build 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/src/battle/live_battle_card.dart"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"49cd67afebc813e3c1c7603262c8ceb2d49d9d6198e4ef54f02e5bd1cbc66a17"}},{"ruleId":"D1","level":"warning","message":{"text":"AnchorageRepairCalculator.project (cyclomatic 29): AnchorageRepairCalculator.project 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/src/fleet/anchorage_repair_calculator.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4842ff614831ef2abbd826f925c4058d90fae3451f41bdcac6c9bb84f8f14af9"}},{"ruleId":"D1","level":"warning","message":{"text":"LogbookDatabase._getOperationRecords (cyclomatic 29): LogbookDatabase._getOperationRecords 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/src/logbook/logbook_database.dart"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af6ca0c9f3f30f5064e7f6076247f1130e5a976dd5d6baea233b78f3fe961e3"}},{"ruleId":"D1","level":"warning","message":{"text":"_QuestCompletionFeedbackState._onStateChanged (cyclomatic 29): _QuestCompletionFeedbackState._onStateChanged 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/src/quest/quest_completion_feedback.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd69a61b13a2160e68d58aed10f94ab02b85418063a44075152f2bf79795175"}},{"ruleId":"D1","level":"warning","message":{"text":"QuestProgressEngine._migrateRecord (cyclomatic 29): QuestProgressEngine._migrateRecord 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/src/quest/quest_progress_engine.dart"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a616f0224c0d8f81f22874c4f40be43362b42222134f0bd1e118e55948322d"}},{"ruleId":"D1","level":"warning","message":{"text":"_FleetMetricsStrip.build (cyclomatic 29): _FleetMetricsStrip.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/src/toolbox/composition_image_card.dart"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"898901801d43225fb794e48eb580b684897bcc8a01b729109fe3c7a87179da4f"}},{"ruleId":"D1","level":"warning","message":{"text":"ship_subtitles.start (cyclomatic 29): ship_subtitles.start has cyclomatic complexity 29 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 10 belong to 2 function literals inside it that branch. 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":"assets/scripts/ship_subtitles.js"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41e39626acb43b2aa3dba50f09247b09a9e046eb9199f2548c6236292c79df5"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpeditionStrings.expeditionAreaName (cyclomatic 28): ExpeditionStrings.expeditionAreaName has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_strings.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"734d50d0644c3f6399217fee2e65674f8aa5b6b8e620104d783e73d1efab1b5a"}},{"ruleId":"D1","level":"warning","message":{"text":"NosakiSparkleCalculator.project (cyclomatic 28): NosakiSparkleCalculator.project 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/src/fleet/nosaki_sparkle_calculator.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ece61c7558f5efdd498ad98af36fcc6609bb858bd382b2e77c0388414ff10e9"}},{"ruleId":"D1","level":"warning","message":{"text":"_QuestDetail.build (cyclomatic 28): _QuestDetail.build has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_center_page.dart"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3676b4a545214bfcd21b45d79bec069ff316f908a3e78904fd1366229c24653"}},{"ruleId":"D1","level":"warning","message":{"text":"_SortieExperienceCardState._buildTotal (cyclomatic 28): _SortieExperienceCardState._buildTotal has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_experience_card.dart"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8db27c6d892cb5fb55d6722d9f57feb3b03383260de409f084ce625f8e524ae"}},{"ruleId":"D1","level":"warning","message":{"text":"_CompositionImagePageState._controls (cyclomatic 28): _CompositionImagePageState._controls 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/src/toolbox/composition_image_page.dart"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7a50e15443b748634e69e5d1fcc052d9e5ae956581bc932b72853c2f91ac9c"}},{"ruleId":"D1","level":"warning","message":{"text":"GadgetBypassEngine.validBody (cyclomatic 28): GadgetBypassEngine.validBody has cyclomatic complexity 28 (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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GadgetBypassEngine.kt"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1760d750b514406d30ce3aab6e52d202a9650b12169eefe08aae1c0488dfe88"}},{"ruleId":"D1","level":"warning","message":{"text":"GadgetBypassWebViewClient.serveFromGameCache (cyclomatic 28): GadgetBypassWebViewClient.serveFromGameCache 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GadgetBypassWebViewClient.kt"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5159761c0ede37fc6f6012a5d92e95da21c07826dc9c7301dd85e187ecaf211f"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeGameWebViewEvent.decode (cyclomatic 27): NativeGameWebViewEvent.decode 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/src/browser/native_game_webview_contract.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49e3630d997c0f32d20edc811ec1108e0ed09c1a638b8a74ce9aa52efac5aa5"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactResourceBarState._buildInteractiveItem (cyclomatic 27): CompactResourceBarState._buildInteractiveItem has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/resource_grid.dart"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4c247162ee59f4451da0b9684d89ea246bbf00a82878898d9af8518922147d"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetMetrics.fromState (cyclomatic 27): FleetMetrics.fromState 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/src/game_state/fleet_metrics.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d65a0bf00207660f40cd3dd2f398e7d290bad5d86a7485deff0fe4c8177e31"}},{"ruleId":"D1","level":"warning","message":{"text":"_OwnedInventoryPageState.build (cyclomatic 27): _OwnedInventoryPageState.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/src/inventory/owned_inventory_page.dart"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bddc7adbe17ffb36ee366c0a26a7a0050c96003f9535332b89fdc181edf278e"}},{"ruleId":"D1","level":"warning","message":{"text":"_RenderPortraitMasonry.performLayout (cyclomatic 27): _RenderPortraitMasonry.performLayout 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/src/layout/hd_portrait_grid.dart"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d29427364367528ffabe956a190828095652032b2840b0a08845df43a16b206"}},{"ruleId":"D1","level":"warning","message":{"text":"_QuestCenterPageState._entries (cyclomatic 27): _QuestCenterPageState._entries 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/src/quest/quest_center_page.dart"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8e14f4f3d64db0e28d11bdd7a9d00d2181bdabb1838f42121dc57f531e1591"}},{"ruleId":"D1","level":"warning","message":{"text":"HdLayoutSettings.decode (cyclomatic 27): HdLayoutSettings.decode 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/src/settings/hd_layout_settings.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"803017ab70e5641d25fca629815091fddf9a8c7fefda52a1a0236e769f4e2455"}},{"ruleId":"D1","level":"warning","message":{"text":"SortieResourceLedger.returnToPort (cyclomatic 27): SortieResourceLedger.returnToPort 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/src/sortie_experience/sortie_resource_ledger.dart"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"45084be4a5bdd1336f942628c677af0b5a9ab7c5c8552ff4f580c2a6376c6046"}},{"ruleId":"D1","level":"warning","message":{"text":"RecordBackupHandler.onMethodCall (cyclomatic 27): RecordBackupHandler.onMethodCall has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/RecordBackupHandler.kt"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"baac2bd98fd58437647a33c70ab356a2231858d6e93fd153e9eecf7c7d692c59"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpUrlConnectionGameResourceFetcher.fetchWithinBudget (cyclomatic 27): HttpUrlConnectionGameResourceFetcher.fetchWithinBudget 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceFetcher.kt"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"89447b45d753bc544295a431a12844297f7698afe0d1098ee2840a51eda04937"}},{"ruleId":"D1","level":"warning","message":{"text":"GameModArchive.checkCentralDirectory (cyclomatic 27): GameModArchive.checkCentralDirectory 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModArchive.kt"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9237bfd2d32415d28906984bfa06c11f2f7291a056c78dc5cd59d4528a8c274"}},{"ruleId":"D1","level":"warning","message":{"text":"build_sortie_release.build_release (cyclomatic 27): build_sortie_release.build_release 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":"tool/build_sortie_release.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"7514a454a14060ab175e79b5d07e48a2d3446d9be2ce9a87e9051a7f3b889d8f"}},{"ruleId":"D1","level":"warning","message":{"text":"_ResourceTrendPageState.build (cyclomatic 26): _ResourceTrendPageState.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/src/fleet/resource_trend_page.dart"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"0755b2ec24011286645249b87ed8b7d9162084c85283efe1f65579dab34e3f6c"}},{"ruleId":"D1","level":"warning","message":{"text":"ShipPortraitCache._resolve (cyclomatic 26): ShipPortraitCache._resolve has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/ship_portrait_cache.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"68090ebbed77e0b7159f8b46bf2338ce116cbbc233fe5560e5c54f2c85fd138a"}},{"ruleId":"D1","level":"warning","message":{"text":"_GameWebViewState.initState (cyclomatic 26): _GameWebViewState.initState has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_webview.dart"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dc6cea47f71a42e65458d8308a675a8d0b98bf13fb7a44b8b0a1affcf39edb"}},{"ruleId":"D1","level":"warning","message":{"text":"GameInfoNoticeController._handleModernization (cyclomatic 26): GameInfoNoticeController._handleModernization has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notice/game_info_notice_controller.dart"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6c805beea332bddd6beca89f99db4f99eec29b3afe64e9656272bca2ff9014"}},{"ruleId":"D1","level":"warning","message":{"text":"QuestCatalogDataset.parse (cyclomatic 26): QuestCatalogDataset.parse has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_catalog_dataset.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9808cad659ce9292a4ff853e4e614d0fd0225acf38b608846354e15fa2556e"}},{"ruleId":"D1","level":"warning","message":{"text":"_SortiePanel.build (cyclomatic 26): _SortiePanel.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/src/senka/senka_info_view.dart"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87e1366f6d1b20e76a92588b105dbdbc8caf4387be171a6c9bfa204f22ec9ff"}},{"ruleId":"D1","level":"warning","message":{"text":"_ShipCard.build (cyclomatic 26): _ShipCard.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/src/toolbox/composition_image_card.dart"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0db72640604606cf7a4ff752388cf246f9fbbd59d4d262a2fb790a499e0395"}},{"ruleId":"D1","level":"warning","message":{"text":"GameModsController._readProgress (cyclomatic 26): GameModsController._readProgress 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/src/toolbox/game_mods/game_mods_controller.dart"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"5095132adf5965466014c4796e51fb5741a0a9af4be785f3f8dd8783350fdfb9"}},{"ruleId":"D1","level":"warning","message":{"text":"_GameModsPageState.build (cyclomatic 26): _GameModsPageState.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/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca593bf5eac6834fbf58e1b6d3eb327d783dec0b7de014503ce51ed5ec9016e"}},{"ruleId":"D1","level":"warning","message":{"text":"GameModRepository.openResource (cyclomatic 26): GameModRepository.openResource 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModRepository.kt"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42a807a03375c1cf546434867e2f59d3933051a7a7f6b6747e4af1c868d2525"}},{"ruleId":"D1","level":"warning","message":{"text":"build_sortie_map_assets.build_assets (cyclomatic 26): build_sortie_map_assets.build_assets 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":"tool/build_sortie_map_assets.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"220b3215ef166a46c43fae2da9d322014e42440a47125878d8d200d481d19452"}},{"ruleId":"D1","level":"warning","message":{"text":"ship_subtitles.bridge.onmessage (cyclomatic 26): ship_subtitles.bridge.onmessage has cyclomatic complexity 26 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/scripts/ship_subtitles.js"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4187bf48b07cb2edb60a759e992dee23c17edc8baafb4e1e9d96aa566cdd28a"}},{"ruleId":"D1","level":"warning","message":{"text":"_MapPainter.paint (cyclomatic 25): _MapPainter.paint has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/sortie_map_section.dart"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1e5bd83615d809e6dd136c7e88d34b7488aaeabd6042779898475a00db4700"}},{"ruleId":"D1","level":"warning","message":{"text":"GameCaptureController._applyConfiguration (cyclomatic 25): GameCaptureController._applyConfiguration has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/game_capture_controller.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5a9051b503e0f4e6ad28b572a01fe9f509045bfaeb06caa1cc7cf585dc9806"}},{"ruleId":"D1","level":"warning","message":{"text":"OwnedInventoryProjection.equipmentGroups (cyclomatic 25): OwnedInventoryProjection.equipmentGroups has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/owned_inventory_projection.dart"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcfb63953c6f2179bca58d4322033134c288f4cc4ee3e8acc724ed71bf232e9"}},{"ruleId":"D1","level":"warning","message":{"text":"HdBottomStrip.build (cyclomatic 25): HdBottomStrip.build has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/layout/hd_bottom_strip.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ef27b3e52ea57fef9abb3bdd277b15be1a8a5d1ef1449045e8aefc5c995547"}},{"ruleId":"D1","level":"warning","message":{"text":"_NativeActivityGameSurfaceState._drainVisibility (cyclomatic 25): _NativeActivityGameSurfaceState._drainVisibility has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/native_activity_game_surface.dart"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1e28a74096fb2cfdffca7b2389cd0da68732966c0aaccf10675152beef719d"}},{"ruleId":"D1","level":"warning","message":{"text":"GameInfoNoticeController._handleFleetReadiness (cyclomatic 25): GameInfoNoticeController._handleFleetReadiness has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notice/game_info_notice_controller.dart"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e079493f761cf259e3b9d7fa837c74821a1aa5b755b240ba5bebc815ce6892"}},{"ruleId":"D1","level":"warning","message":{"text":"QuestProgressEngine.replaceGoals (cyclomatic 25): QuestProgressEngine.replaceGoals has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_progress_engine.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37d2e1034f19c747c5f67d6ac456a9c6e348d22d0c843b1e5d7ce928f581b51"}},{"ruleId":"D1","level":"warning","message":{"text":"SenkaReducer.reduce (cyclomatic 25): SenkaReducer.reduce has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_reducer.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d126957086a106f20e12d91992228e49d345460c6b16072dbdfd01e04e8f8f24"}},{"ruleId":"D1","level":"warning","message":{"text":"SortieResourceLedger._recordRepair (cyclomatic 25): SortieResourceLedger._recordRepair 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/src/sortie_experience/sortie_resource_ledger.dart"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f4d18daf764a0b50dc8d979d3ac1eddba6f9fb5f8e66a39a87d121029148f6"}},{"ruleId":"D1","level":"warning","message":{"text":"_GameModsPageState._scanLibrary (cyclomatic 25): _GameModsPageState._scanLibrary has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6eba6d9692749b27f6a074762e109a796cbce5d29e11f6c2272869b99b1f83"}},{"ruleId":"D1","level":"warning","message":{"text":"build_enemy_release._validate_catalog (cyclomatic 25): build_enemy_release._validate_catalog 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":"tool/build_enemy_release.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42fb1f2f2abe037604ac691a07463c0ff4adb8b78b72f782a2d213248d10f16"}},{"ruleId":"D1","level":"warning","message":{"text":"BattleController.accept (cyclomatic 24): BattleController.accept has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_controller.dart"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2ac0d23fa1e768d63710a8fbcb334c172a990559e9ffbc4be7c51a7eea8c37"}},{"ruleId":"D1","level":"warning","message":{"text":"_ExpeditionCheckContentState._buildContent (cyclomatic 24): _ExpeditionCheckContentState._buildContent has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_check_card.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cd010dcc64a9a87cd2e3b37fd1986d8b7196fd5aa32b003eba66744d1f9a10"}},{"ruleId":"D1","level":"warning","message":{"text":"_CameraAvoidanceViewportState.build (cyclomatic 24): _CameraAvoidanceViewportState.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/src/layout/camera_avoidance.dart"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0d1b005822d0733b7475cdf7101bbe0e832886b56cdc4c2a84cf55a6789fdd"}},{"ruleId":"D1","level":"warning","message":{"text":"AppPalette._fallback (cyclomatic 24): AppPalette._fallback has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/theme/app_palette.dart"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"2438b390f7eea4e77525b4c3dd8d40b82137e2e6b8f912625bfbe665997de653"}},{"ruleId":"D1","level":"warning","message":{"text":"GameModManager.onMethodCall (cyclomatic 24): GameModManager.onMethodCall has cyclomatic complexity 24 (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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModManager.kt"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5bbbcd36032e56b84b95c81cf314a55dee7c6e98308b3fe3b69b6ea1024f7bd"}},{"ruleId":"D1","level":"warning","message":{"text":"GameResourceManifestConsumer._rebuild (cyclomatic 23): GameResourceManifestConsumer._rebuild 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/src/browser/game_resource_manifest_consumer.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0854d5fccf99efe682ef04369396b44dcc547ab3c096a215ec4469774d8df24"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpeditionEvaluator._evaluateRequirement (cyclomatic 23): ExpeditionEvaluator._evaluateRequirement has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_evaluator.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e71d37be6c72b576aa8d45eb0efdbce8f49a8a8c00616cfb1358e5b5ec7ed4"}},{"ruleId":"D1","level":"warning","message":{"text":"_FleetFocusPanel.build (cyclomatic 23): _FleetFocusPanel.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/src/fleet/fleet_information_center.dart"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e1870fbc8c7f8ae715d28813e1732ec87b9999a1f2b5028c6fb6c4694de7af"}},{"ruleId":"D1","level":"warning","message":{"text":"GameStateReducer._snapshot (cyclomatic 23): GameStateReducer._snapshot 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/src/game_state/game_state_reducer.dart"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b58a08b8c0bbe0b9f5b24d0e8218d8ac294bf116ff3806ef21b522e185f27eb"}},{"ruleId":"D1","level":"warning","message":{"text":"_GameWebViewState._applyGamePresentation (cyclomatic 23): _GameWebViewState._applyGamePresentation has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_webview.dart"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb927e705b5fdcf04a3dea661c5c38b1431beaaa6f0a9293ef6a6c673ac35d2b"}},{"ruleId":"D1","level":"warning","message":{"text":"KcwikiReportCollector.accept (cyclomatic 23): KcwikiReportCollector.accept has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/kcwiki_report/kcwiki_report_collector.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"705597cd541322fa0c96a6b59ee8dfbb16f79d97b9c706ced02b49219c7b8642"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceContextHeader.build (cyclomatic 23): WorkspaceContextHeader.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/src/layout/workspace_context_header.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"99310d8fcecadea26f12fc67d21a95f06d1f60134636f83515ddbf967a3ca63e"}},{"ruleId":"D1","level":"warning","message":{"text":"QuestCatalog.project (cyclomatic 23): QuestCatalog.project has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_catalog.dart"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5799e590e10a51e39b6dd631ce200e2b121bc5c49219eb5f13b2d03b69a612"}},{"ruleId":"D1","level":"warning","message":{"text":"_QuestCompletionHeaderSlotState._canDisplayMessage (cyclomatic 23): _QuestCompletionHeaderSlotState._canDisplayMessage 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/src/quest/quest_completion_drawer.dart"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec0efdaee44c4e1e29dbcc4c5d41c83185b7e42ea5b900c39803bf10b1fdf00"}},{"ruleId":"D1","level":"warning","message":{"text":"SortieResourceLedger.record (cyclomatic 23): SortieResourceLedger.record 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/src/sortie_experience/sortie_resource_ledger.dart"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a4f6e33f371fc2fd959332277ce8726b6065822ec84aded646ad8da31d783c"}},{"ruleId":"D1","level":"warning","message":{"text":"_GameModsPageState._libraryPanel (cyclomatic 23): _GameModsPageState._libraryPanel 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/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6aa09a6fa49793945aaafbadb86896045cd5db8419a35fea95995a6a7f6946b"}},{"ruleId":"D1","level":"warning","message":{"text":"_SortieMapQueryPageState._buildCatalog (cyclomatic 23): _SortieMapQueryPageState._buildCatalog 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/src/toolbox/sortie_map_query/sortie_map_query_page.dart"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"02371c472ca440e82d288aec78ed09a205b131587ed83782c802eea7bfb0ef91"}},{"ruleId":"D1","level":"warning","message":{"text":"GameResourceDownloadCoordinator.downloadLoop (cyclomatic 23): GameResourceDownloadCoordinator.downloadLoop 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceDownloadCoordinator.kt"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02a115e6563e2e5a6174c63a5c0ac48420df6841a03340e8b1a4f0a5fd89f05"}},{"ruleId":"D1","level":"warning","message":{"text":"GameModMp3.validate (cyclomatic 23): GameModMp3.validate 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModMp3.kt"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce34c086e3c7db956f715906aeaedfde188cd89325f76035be3afd46879833c"}},{"ruleId":"D1","level":"warning","message":{"text":"BattleController._updateSortieMapProgress (cyclomatic 22): BattleController._updateSortieMapProgress has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_controller.dart"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f8350042deea6b51d7930d887cfaa23f4f558337d2f4849e9ec5d38651f319"}},{"ruleId":"D1","level":"warning","message":{"text":"_PoiBattleSimulator._rank (cyclomatic 22): _PoiBattleSimulator._rank has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc789af302657dbf12b6b014f70269f8d1310aa166f51cf2483a28309622372"}},{"ruleId":"D1","level":"warning","message":{"text":"_BattleResultWarningOverlayState._showAdvanceWarning (cyclomatic 22): _BattleResultWarningOverlayState._showAdvanceWarning has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/battle_result_warning_overlay.dart"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfddccf700b822cc2f001c08e0d4c877f30c3435e2db572f5626880d423ecd84"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpeditionIncomeCalculator.daihatsuBonusBreakdownForFleet (cyclomatic 22): ExpeditionIncomeCalculator.daihatsuBonusBreakdownForFleet has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_income_calculator.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a5edc8b23f6e141194beb9e391a7bd15cb0321ef93ef54631e409efc871877"}},{"ruleId":"D1","level":"warning","message":{"text":"_ShipRow.build (cyclomatic 22): _ShipRow.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/src/fleet/fleet_information_center.dart"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc05e8ad5f82a19d12ab8a49a2d5e946f06afe841fe7fd2d157645e73732ed4"}},{"ruleId":"D1","level":"warning","message":{"text":"LandBaseAirGroupRow.build (cyclomatic 22): LandBaseAirGroupRow.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/src/fleet/land_base_summary_card.dart"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2d10530e287322dcd584651ab4554f83740a4fbc536b057dc289b0ebbea1a2"}},{"ruleId":"D1","level":"warning","message":{"text":"_GameWebViewState._runStartupSequence (cyclomatic 22): _GameWebViewState._runStartupSequence has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_webview.dart"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb49722053b3201ed479f270d10cad9c5ebbf352f4316796ab96f09fb51e0ece"}},{"ruleId":"D1","level":"warning","message":{"text":"_OwnedInventoryPageState._handleControllerChanged (cyclomatic 22): _OwnedInventoryPageState._handleControllerChanged 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/src/inventory/owned_inventory_page.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41835668fce5a997bac552b2502defcac14f0de0754583492cb125871eb5f57"}},{"ruleId":"D1","level":"warning","message":{"text":"GameNameCatalog._buildEntityIndex (cyclomatic 22): GameNameCatalog._buildEntityIndex has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/localization/game_name_catalog.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c1a43287233cf0e340a2b7c77ff9aacf9dea4ccecfb673535fdf638066281a"}},{"ruleId":"D1","level":"warning","message":{"text":"_LogbookExperiencePageState._load (cyclomatic 22): _LogbookExperiencePageState._load has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_experience_page.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"016226fc08dba0ddb47397756f1dadb6613bba491fd89b7907943e09908633e8"}},{"ruleId":"D1","level":"warning","message":{"text":"ShipSubtitleCatalogController.load (cyclomatic 22): ShipSubtitleCatalogController.load has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_catalog_controller.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1eff59d439e78077eca7ad74bee68658d06decbad758784b3099b8401402cd4"}},{"ruleId":"D1","level":"warning","message":{"text":"ShipSubtitleCatalogController._checkKcwikiGroup (cyclomatic 22): ShipSubtitleCatalogController._checkKcwikiGroup has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_catalog_controller.dart"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"7104cd55f4f627089d166097446bb544c621438757a9af60b83e6293e67633fc"}},{"ruleId":"D1","level":"warning","message":{"text":"GameResourceCacheIndex.loadLegacySnapshot (cyclomatic 22): GameResourceCacheIndex.loadLegacySnapshot 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheIndex.kt"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db51f66b6f6b441ff18a15fa30f9fb86ae3a5ac9ae5ba10f6adbf7dd49398e6"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeGameWebViewChannel.executeOnMain (cyclomatic 22): NativeGameWebViewChannel.executeOnMain 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWebViewChannel.kt"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce2afe866d74afe3774c40063c75b0581e1db37296c8cd93194fb0a1bab24cb"}},{"ruleId":"D1","level":"warning","message":{"text":"BattleController._reduce (cyclomatic 21): BattleController._reduce has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_controller.dart"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"aead80498b65089634f1acb6f77e59d43b45bb47f79007cd1b8c01b42bf2e42d"}},{"ruleId":"D1","level":"warning","message":{"text":"GameFrameRatePolicy.completeWindow (cyclomatic 21): GameFrameRatePolicy.completeWindow has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/game_frame_rate_policy.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"70cda23203512cde40bce8a68afb09474ad0fd269717b312536166d55a831ada"}},{"ruleId":"D1","level":"warning","message":{"text":"_BattleResultWarningOverlayState._onGameCaptureUpdate (cyclomatic 21): _BattleResultWarningOverlayState._onGameCaptureUpdate has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/battle_result_warning_overlay.dart"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"986fa53ff080b8e954d9e78105811c0b2609698ece35844cecbc4d5274c78f67"}},{"ruleId":"D1","level":"warning","message":{"text":"_MapGaugeRow.build (cyclomatic 21): _MapGaugeRow.build has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/pre_sortie_check_summary.dart"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbdf5f75952c8d0a43c16e617a141460b13db303d2cf4a8de0e2a6175700e23c"}},{"ruleId":"D1","level":"warning","message":{"text":"_DashboardDropTargetState.build (cyclomatic 21): _DashboardDropTargetState.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/src/layout/hd_home_editor.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"21efc1aff2ca4a6bff52df666d23ae82a5c70c169b32e4c266fe65e235d12079"}},{"ruleId":"D1","level":"warning","message":{"text":"WindowLayoutSnapshot.fromMap (cyclomatic 21): WindowLayoutSnapshot.fromMap has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/layout/window_layout_controller.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a955953f98eb10e64a843962dbbf59641b819a390ffc137f9f1144ae088b4bb6"}},{"ruleId":"D1","level":"warning","message":{"text":"LogbookEventRecorder._recordConstruction (cyclomatic 21): LogbookEventRecorder._recordConstruction 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. This is NOT this file\u0027s highest cyclomatic complexity: LogbookEventRecorder._equipmentType (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_event_recorder.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe921de9605da4aec56b877b9bdb5a6a29a5df1e1d272bfe3a7e47c8b82921aa"}},{"ruleId":"D1","level":"warning","message":{"text":"_LogbookTablePageState._matchesFilter (cyclomatic 21): _LogbookTablePageState._matchesFilter has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_page.dart"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"c479a3a97820593194d75a962b7f9363290fe32d63ea1d71cc879f1419af0f38"}},{"ruleId":"D1","level":"warning","message":{"text":"NotificationSettings.== (cyclomatic 21): NotificationSettings.== has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/notification_settings_store.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"70225ca306b116f4ddaca3f78552366f2ba017372842538add2e6e1507d568d9"}},{"ruleId":"D1","level":"warning","message":{"text":"GameModRepository.readState (cyclomatic 21): GameModRepository.readState 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModRepository.kt"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f683f9ec4b868137a5edb7abe0fc41f542206d725055d1710c042acffd8d8d1"}},{"ruleId":"D1","level":"warning","message":{"text":"ReferenceCalculator.compute (cyclomatic 20): ReferenceCalculator.compute 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":"tool/akashi_bonus/lib/reference_calculator.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ea9008d3618515214bac43dee72cfdcfd25eb05115808b5dbebe83e0246f7e"}},{"ruleId":"D1","level":"warning","message":{"text":"_BattleOverview.build (cyclomatic 20): _BattleOverview.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/src/battle/detailed_battle_panel.dart"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bb8af99b8c6514e527ef0048cd67e275732caf4dc897737bc28c614a42dfe0"}},{"ruleId":"D1","level":"warning","message":{"text":"FcdMapDataset.parse (cyclomatic 20): FcdMapDataset.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/src/battle/fcd_map_dataset.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9321a76370d1e273049946f76069cdfddedb18cb5cf98e9cff84775f509aab9"}},{"ruleId":"D1","level":"warning","message":{"text":"_SortieMapSectionState.build (cyclomatic 20): _SortieMapSectionState.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/src/battle/sortie_map_section.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef557076addbef9df42a05948aba25f7fec25fa6ab2104539fae8f7e5c9b5a6"}},{"ruleId":"D1","level":"warning","message":{"text":"_FleetShipStatusCapsuleState._textIdentity (cyclomatic 20): _FleetShipStatusCapsuleState._textIdentity 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/src/fleet/fleet_ship_status_capsule.dart"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c18f959de43c19a49c53f5abbeed8defac7ed8a02833ca36eb66e3d58880e8"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetTransportPoints.fromState (cyclomatic 20): FleetTransportPoints.fromState has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_transport_points.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e916f2981535adab49edafc91c6b563ddebd0b03f1dd98aae1990e7a971d76"}},{"ruleId":"D1","level":"warning","message":{"text":"GameApiEventPipeline._prepareAndDispatch (cyclomatic 20): GameApiEventPipeline._prepareAndDispatch 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/src/game_state/game_api_event_pipeline.dart"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a20fb1c560616ec3303979941a72f6b7ea68c6e45819f939a6c2bb5f3c41aa"}},{"ruleId":"D1","level":"warning","message":{"text":"GameStateReducer.projectFleetBattleDisplay (cyclomatic 20): GameStateReducer.projectFleetBattleDisplay has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"4303cdd62822749013b992ce9173d5a29616c94da6e3fbb44e21e0274516a076"}},{"ruleId":"D1","level":"warning","message":{"text":"GameStateReducer._applyKnownQuestProgress (cyclomatic 20): GameStateReducer._applyKnownQuestProgress has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"258baefb5645b50bf82814b492e218c990adbcec6ebb0ba06e48eef7840d45fe"}},{"ruleId":"D1","level":"warning","message":{"text":"ShipEquipmentCompatibilityProjection.groups (cyclomatic 20): ShipEquipmentCompatibilityProjection.groups has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/ship_equipment_compatibility_projection.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5118eabb6f32028af741d159cad3f1ff0ff093cd8548f2d1cf5c4e16838b6d96"}},{"ruleId":"D1","level":"warning","message":{"text":"_BattleDetailPageState._process (cyclomatic 20): _BattleDetailPageState._process has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/battle_detail_page.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8d376e3e220d7acc4a44e25dd198c1630b114c298309aace92ca52682228f5"}},{"ruleId":"D1","level":"warning","message":{"text":"_AttackReport.build (cyclomatic 20): _AttackReport.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/src/logbook/battle_detail_page.dart"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b36e172936b0787b35e27110d1f8dcd723f82b9c2f41dd0b6c6f0b652ed94d0"}},{"ruleId":"D1","level":"warning","message":{"text":"_NativeActivityGameSurfaceState._runPostCreateBootstrap (cyclomatic 20): _NativeActivityGameSurfaceState._runPostCreateBootstrap has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/native_activity_game_surface.dart"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c2512a6e1c62bfb6c1cb8283a0cb41bf34bf2756eff208cddf2b3af65fc8ba"}},{"ruleId":"D1","level":"warning","message":{"text":"GameInfoNoticeController._handleSortieCapacity (cyclomatic 20): GameInfoNoticeController._handleSortieCapacity 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/src/notice/game_info_notice_controller.dart"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"2002a6684a69b9d4f35fe636b87bd87866a65787efa3849e0ad99df7cae555e9"}},{"ruleId":"D1","level":"warning","message":{"text":"SenkaController._restore (cyclomatic 20): SenkaController._restore has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_controller.dart"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabde0a1ee6935c11b93cab11acbc7e95932905c73849fd415f730063b46bdc8"}},{"ruleId":"D1","level":"warning","message":{"text":"SortieExperienceController._settle (cyclomatic 20): SortieExperienceController._settle has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_experience_controller.dart"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"676a5d24a8151593329ce0855c6a890c629c1d54f9b735a5e8552e7940f6b4c8"}},{"ruleId":"D1","level":"warning","message":{"text":"AppTelemetryService._collectDeviceProperties (cyclomatic 20): AppTelemetryService._collectDeviceProperties has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/telemetry/telemetry_service.dart"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac7413e67cc4c86d2c618cc39fb696417a1a01985df0702ed019c2be6424faa"}},{"ruleId":"D1","level":"warning","message":{"text":"_ExpCalcPageState._compactPoint (cyclomatic 20): _ExpCalcPageState._compactPoint 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/src/toolbox/exp_calc/exp_calc_page.dart"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d35b1c38a08f74a725c447aa5488d30539462316457832952900599067cc6c5"}},{"ruleId":"D1","level":"warning","message":{"text":"GameModArchive.classify (cyclomatic 20): GameModArchive.classify has cyclomatic complexity 20 (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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModArchive.kt"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcdcb1ebe1c0aa29f83391dfe4f11c51c15465e4877b87490c116f0d0e08abe"}},{"ruleId":"D1","level":"warning","message":{"text":"GameModCoordinateEndpoint.open (cyclomatic 20): GameModCoordinateEndpoint.open 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModCoordinateEndpoint.kt"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ef57bb810bef92fc141d2e9a1f96305e50e2b98caabcf48ee74dd7fd412c69"}},{"ruleId":"D1","level":"warning","message":{"text":"GameModRepository.commitLibraryImport (cyclomatic 20): GameModRepository.commitLibraryImport 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModRepository.kt"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bb0d05b2bcd444fa0f4c80d285271cd7465bb63db545e1cf92145a238817e8"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeGameWarningDialogChannel.renderChecklist (cyclomatic 20): NativeGameWarningDialogChannel.renderChecklist 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogChannel.kt"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"055ef83e6b0c2899e9e72499952c0b4f8d5df8a0cd21754dd74b5a02f10a221e"}},{"ruleId":"D1","level":"warning","message":{"text":"build_enemy_catalog._resolve_alias (cyclomatic 20): build_enemy_catalog._resolve_alias 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":"tool/build_enemy_catalog.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc57560fb2fcdde43c6994516f790827dde79bbbb167f307b25f74ad5f63e57e"}},{"ruleId":"D1","level":"warning","message":{"text":"build_sortie_release._validate_client_catalog (cyclomatic 20): build_sortie_release._validate_client_catalog has cyclomatic complexity 20 (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":"tool/build_sortie_release.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3b9e206b2495930abff630e4d3885a0c2f1f8aa6df0ba0fe7f3e0da19e63c1"}},{"ruleId":"D1","level":"warning","message":{"text":"AkashiFetcher.fetch (cyclomatic 19): AkashiFetcher.fetch 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/akashi_bonus/lib/fetcher.dart"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7ac4f72ae6a255a7cb60a50dbb8f6e1c0ffe22bdd16e4dfdb1fe254bedd04f"}},{"ruleId":"D1","level":"warning","message":{"text":"AccountSession.accept (cyclomatic 19): AccountSession.accept has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/account/account_session.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd74bf504c482bd8dce37984a32258969f30313196c036a0d8692b6d5dd6ca41"}},{"ruleId":"D1","level":"warning","message":{"text":"BattleDetailReplayBuilder._parseTorpedo (cyclomatic 19): BattleDetailReplayBuilder._parseTorpedo has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_detail_replay_builder.dart"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b0ec5b4647459549aff567c5906ad480183ae4e9469a5b6c0c1845c0f7cc93"}},{"ruleId":"D1","level":"warning","message":{"text":"BattleShipDetails.enemy (cyclomatic 19): BattleShipDetails.enemy has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_ship_details.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b79bc60b3c9db7dc03d0d101211a4966206d274fc6edef76f851d0d0677eb44"}},{"ruleId":"D1","level":"warning","message":{"text":"_ShipPopoverState.build (cyclomatic 19): _ShipPopoverState.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/src/battle/battle_ship_details_popover.dart"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fc6b710737db58f05ae25a5bae3765e33505a197fb44b67a8094f9997f7edb"}},{"ruleId":"D1","level":"warning","message":{"text":"FcdMapUpdateService.checkAndUpdate (cyclomatic 19): FcdMapUpdateService.checkAndUpdate has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/fcd_map_update_service.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdc988288e8f95dab1321832b8683fa7bfcc2bda17d10bef19f5413339db819"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeGameSurfaceSlotState._measureAndReport (cyclomatic 19): NativeGameSurfaceSlotState._measureAndReport 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/src/browser/native_game_surface_slot.dart"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a520c0370f08fd5dc4b8f590a4699d48d2e5842eb1809f993caec50a1ee91c2"}},{"ruleId":"D1","level":"warning","message":{"text":"GameCaptureController._drainConfigurations (cyclomatic 19): GameCaptureController._drainConfigurations has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/game_capture_controller.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac0039070f1ac936bae078dfff232111214bbed8a1a2ba66c3cafab723984c5"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactResourceBarState._buildGrid (cyclomatic 19): CompactResourceBarState._buildGrid has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/resource_grid.dart"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"0320be80ec1fdb89578461acfe56c971c9748f0cf0d02258e5be2876aa1f433a"}},{"ruleId":"D1","level":"warning","message":{"text":"GameInfoNoticeController.accept (cyclomatic 19): GameInfoNoticeController.accept has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notice/game_info_notice_controller.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd9a6f13e9a0d5048f300d4b8f7adf5d3f175f3bf113ef12b2f345a39e9c5dd"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetDisplaySettingsSection.build (cyclomatic 19): FleetDisplaySettingsSection.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/src/settings/fleet_display_settings_section.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d40a376ac82e7781253dae39417ed1e26e6458e2672c40e698f525820294c29"}},{"ruleId":"D1","level":"warning","message":{"text":"_NotificationSettingsPageState.build (cyclomatic 19): _NotificationSettingsPageState.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/src/settings/notification_settings_page.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e326adedeebdc641691d7e8cd7409cff6123b8643633e46dedc861040dfd9de"}},{"ruleId":"D1","level":"warning","message":{"text":"RecordBackupSection.build (cyclomatic 19): RecordBackupSection.build 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/src/settings/record_backup_section.dart"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa311e05680e5f9fa9b0e524bc69eed4072a3cbc2d3696c6408978dfd1ec0cd"}},{"ruleId":"D1","level":"warning","message":{"text":"ShipSubtitleKc3UpdateService._get (cyclomatic 19): ShipSubtitleKc3UpdateService._get has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_kc3_update_service.dart"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4fe4d85d3fc068d3f47d92221741792133a7f31d810d369f176f641936d857"}},{"ruleId":"D1","level":"warning","message":{"text":"ShipSubtitleUpdateService._get (cyclomatic 19): ShipSubtitleUpdateService._get has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_update_service.dart"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b599cb6a69f5015fcf5d0ae99246644807c19c9e913ea1e9be3045f5c5e2d7"}},{"ruleId":"D1","level":"warning","message":{"text":"AppTelemetryService._detectAndroidEmulator (cyclomatic 19): AppTelemetryService._detectAndroidEmulator 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/src/telemetry/telemetry_service.dart"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ffe4bcf9867cfb13249a9763db6ada1bf7b89930ba5caa478a7bc0caffa64f"}},{"ruleId":"D1","level":"warning","message":{"text":"DeckBuilderExporter.exportMap (cyclomatic 19): DeckBuilderExporter.exportMap has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/deck_builder_exporter.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"406b45b816259ec185e4c6a5771d8bf24ed60c13b4510b8b7154d04359d1328f"}},{"ruleId":"D1","level":"warning","message":{"text":"GameModsController.setResourcesEnabled (cyclomatic 19): GameModsController.setResourcesEnabled has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_controller.dart"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2640a0eddcb8b1c5a88d306ca7cd203be978a18db703928033a489de66b29d"}},{"ruleId":"D1","level":"warning","message":{"text":"AndroidGameFrameReloadBridge.onPostMessage (cyclomatic 19): AndroidGameFrameReloadBridge.onPostMessage 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFrameReloadBridge.kt"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1441f4beed20d8c6844f60235f2a27d16f00d99f372e8300c3bf1f72d7075a8"}},{"ruleId":"D1","level":"warning","message":{"text":"GameModCoordinateParser.ini (cyclomatic 19): GameModCoordinateParser.ini 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModCoordinateParser.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"413563fc40fcf5efd5c7dcaba394563dfabc52ceef45d730b2a67528562b0af9"}},{"ruleId":"D1","level":"warning","message":{"text":"AppNotificationManager.bindItem (cyclomatic 19): AppNotificationManager.bindItem 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/notification/AppNotificationManager.kt"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0aed1e4aee7a32607fb7ae224ee9afadeb2138a7ee4907bf45f0d38242f393"}},{"ruleId":"D1","level":"warning","message":{"text":"ShipSubtitleBridge.onMessage (cyclomatic 19): ShipSubtitleBridge.onMessage 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/subtitles/ShipSubtitleBridge.kt"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c909cc9899adfa8f45b32f80204327c04e5a96b494cce2c73c168395b75dcf5a"}},{"ruleId":"D1","level":"warning","message":{"text":"GameAudioController._reconcileNative (cyclomatic 18): GameAudioController._reconcileNative has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/audio/game_audio_controller.dart"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf495bc13f960a831ce13cda99f452a48a62b5f1ce4b31ff20131559a4cf834"}},{"ruleId":"D1","level":"warning","message":{"text":"_PoiBattleSimulator._support (cyclomatic 18): _PoiBattleSimulator._support has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba703e58c165cd2590cc2bfbf146fd44996585fb43b17f539f2f11eb827eaf66"}},{"ruleId":"D1","level":"warning","message":{"text":"DmmRegionCompatibility.scriptForPage (cyclomatic 18): DmmRegionCompatibility.scriptForPage 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/src/browser/dmm_region_compatibility.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca3598de3015769f6281eb45222443e79bec7ea808c7c9b12cbee1c45114931"}},{"ruleId":"D1","level":"warning","message":{"text":"_GameBrowserMenu.build (cyclomatic 18): _GameBrowserMenu.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/src/browser/game_browser_menu.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"18932ab7b2e30c2bc74af6011b7bddcf48358a9d5ca02cff32879cb0b0c4d8f3"}},{"ruleId":"D1","level":"warning","message":{"text":"GameSurfaceInputGuardRoute._onAnimationStatus (cyclomatic 18): GameSurfaceInputGuardRoute._onAnimationStatus 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/src/browser/game_surface_input_guard.dart"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"85be6ea8695d6d91c160f77cbe60a21ca5f5d69cd15b594190561485f6583c4b"}},{"ruleId":"D1","level":"warning","message":{"text":"ShipMoraleMark.build (cyclomatic 18): ShipMoraleMark.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/src/fleet/ship_status_visuals.dart"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"702c3e53f78fc5a7b65fca289c9d8c9d267720553b241fef9b6de144539f13c0"}},{"ruleId":"D1","level":"warning","message":{"text":"GameApiEventPipeline._acceptDocument (cyclomatic 18): GameApiEventPipeline._acceptDocument has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_api_event_pipeline.dart"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c672bffa441b02336842a39a57c45f2e4ff0851b8f0b60975caed2143275613"}},{"ruleId":"D1","level":"warning","message":{"text":"_GameWebViewState.didUpdateWidget (cyclomatic 18): _GameWebViewState.didUpdateWidget has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_webview.dart"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"b868401f834607958aca611e0bc2c7ee4178136b7c9ae518130f8e3df5ee7b23"}},{"ruleId":"D1","level":"warning","message":{"text":"SenkaReducer._inferMagic (cyclomatic 18): SenkaReducer._inferMagic has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_reducer.dart"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bfb1fff0f6582ae33b27186a4711c0f258d2bb4fc176da843287652cd0b9d3"}},{"ruleId":"D1","level":"warning","message":{"text":"DataSettingsPage.build (cyclomatic 18): DataSettingsPage.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/src/settings/data_settings_page.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7669dd6ba74b392cd9a15c7e9ad3b3c46eece7c8cdc90929e7e5f57e735da49"}},{"ruleId":"D1","level":"warning","message":{"text":"ShipSubtitleNameCatalog.shipName (cyclomatic 18): ShipSubtitleNameCatalog.shipName has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_name_catalog.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffb23f390ac0854d9ae250b9a6047da6a01b267d5185df0678bce200a6c7d68"}},{"ruleId":"D1","level":"warning","message":{"text":"_GameModsPageState._footer (cyclomatic 18): _GameModsPageState._footer has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"108d386deb5bdbdf682de137753ff26177719dbef836e66d382863082ce16ed3"}},{"ruleId":"D1","level":"warning","message":{"text":"RecordBackupHandler.handleSaveResult (cyclomatic 18): RecordBackupHandler.handleSaveResult 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/RecordBackupHandler.kt"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b7cf4426d679d0f9caab62398576470392aa37c5aa44ffc8fad2638a45a8d4"}},{"ruleId":"D1","level":"warning","message":{"text":"GameResourceCacheStore.commitInternal (cyclomatic 18): GameResourceCacheStore.commitInternal 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheStore.kt"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6932409a498e3a87ff8b9012d2bd47cb779e2b7635cb68eb5bb5d4066bbf56"}},{"ruleId":"D1","level":"warning","message":{"text":"GameModLibraryDefaultMigration.migrate (cyclomatic 18): GameModLibraryDefaultMigration.migrate 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibraryDefaultMigration.kt"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb6ff7ebb006362344de18c5d12de7364ce0443d9cbf6503096274f04d10ee7"}},{"ruleId":"D1","level":"warning","message":{"text":"GameModRepository.exportTree (cyclomatic 18): GameModRepository.exportTree 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModRepository.kt"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b30c19812d7bb03c5f944fa8d396ae939003fcdfbbb7357179f18988d3659b9"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivityWebViewHost.create (cyclomatic 18): ActivityWebViewHost.create 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/ActivityWebViewHost.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa2d38ac31660929458e776aeef13bc3c58ca8ab4cd717c3c0e0107ad3ed560"}},{"ruleId":"D1","level":"warning","message":{"text":"NotificationAlarmReceiver.deliverCurrentAlarm (cyclomatic 18): NotificationAlarmReceiver.deliverCurrentAlarm 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/notification/NotificationAlarmReceiver.kt"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e563c8415f9e2a108f9dc328870ead151fde7c6168f13aadbf17d3309ba098"}},{"ruleId":"D1","level":"warning","message":{"text":"_SmokeAppState._serve (cyclomatic 17): _SmokeAppState._serve 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":"tool/advance_warning_device_smoke/main.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c3fa88097a3803b47e9be8b9b8da29e6e6e64d67caea47cd0c231b58689c2c"}},{"ruleId":"D1","level":"warning","message":{"text":"_BattleShipRow.build (cyclomatic 17): _BattleShipRow.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/src/battle/detailed_battle_panel.dart"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb614c2cf507ab12d7629ac68d5321cc26d652ff294977edd65f101b2e9f6136"}},{"ruleId":"D1","level":"warning","message":{"text":"_CompactBarRow.build (cyclomatic 17): _CompactBarRow.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/src/battle/live_battle_card.dart"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd3668b131fa47806b1e482e9789f44c9869a66ceabe911aa51f2072ff56009"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeGameSurfaceSlotState.didChangeDependencies (cyclomatic 17): NativeGameSurfaceSlotState.didChangeDependencies 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/src/browser/native_game_surface_slot.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f3d37d577873bdc08e0751600d5fb792cfc97920216470bceab1321c7a6d38"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeGameSurfaceSlotState._runBoundsDrain (cyclomatic 17): NativeGameSurfaceSlotState._runBoundsDrain has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/native_game_surface_slot.dart"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ffc80b897105c184dc933e34496fbbc5153854b3e995287d475f217520fd18"}},{"ruleId":"D1","level":"warning","message":{"text":"_RepairCapsule.build (cyclomatic 17): _RepairCapsule.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/src/fleet/repair_summary_card.dart"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"98920b3d46bfc6596848fc17d92a80bf314f5827258050a3b8d7ec06c3d99f33"}},{"ruleId":"D1","level":"warning","message":{"text":"MasterShip.remainingModernization (cyclomatic 17): MasterShip.remainingModernization has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state.dart"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78bb559c9c471e9cacc10cfd30fac26b29740530baf43906f7eedd8b46c9298"}},{"ruleId":"D1","level":"warning","message":{"text":"_ImprovementTableState.build (cyclomatic 17): _ImprovementTableState.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/src/improvement/improvement_planner_view.dart"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a81f9a866cb4d1ac0521ea1bc0b880b28a3f244939dc35d44291c8c04ee7838"}},{"ruleId":"D1","level":"warning","message":{"text":"LogbookDatabase._onUpgrade (cyclomatic 17): LogbookDatabase._onUpgrade has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_database.dart"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ef6afa15f03a619bf166f44e7d5929149188913005633be11db7ab51ee3b9c"}},{"ruleId":"D1","level":"warning","message":{"text":"LogbookDatabase.insertBattleRecord (cyclomatic 17): LogbookDatabase.insertBattleRecord has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_database.dart"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f62625fcff77da29afdccfb3bf5af6bdebcc94bae543c027ba6664f53dd15b6"}},{"ruleId":"D1","level":"warning","message":{"text":"LogbookEventRecorder._recordConstructionDockUpdate (cyclomatic 17): LogbookEventRecorder._recordConstructionDockUpdate 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. This is NOT this file\u0027s highest cyclomatic complexity: LogbookEventRecorder._equipmentType (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_event_recorder.dart"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89874ed4f6b746ab888f56b47280b0b5db40bd683e577246dee0990bdb790d1"}},{"ruleId":"D1","level":"warning","message":{"text":"_LogbookTablePageState._refreshLatest (cyclomatic 17): _LogbookTablePageState._refreshLatest has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_page.dart"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81a834c62a20cc2904fc14f90f8410b8db5d4462f5758819f86ca4d1d5b37b8"}},{"ruleId":"D1","level":"warning","message":{"text":"_LogbookTablePageState._loadSortieFilterCatalog (cyclomatic 17): _LogbookTablePageState._loadSortieFilterCatalog has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_page.dart"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fbb74ac6cf56baa16265e7cd30b0efcfd157e3dbbc73fabf7c85d15b5ecfc4"}},{"ruleId":"D1","level":"warning","message":{"text":"GameInfoNoticeController._handleExpeditionStart (cyclomatic 17): GameInfoNoticeController._handleExpeditionStart has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notice/game_info_notice_controller.dart"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"c241e6d93dacda2c199432039a519a3b70b1f86e53f6903e454c3444e660281f"}},{"ruleId":"D1","level":"warning","message":{"text":"GameNotificationCoordinator._drainSnapshots (cyclomatic 17): GameNotificationCoordinator._drainSnapshots has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notification/game_notification_coordinator.dart"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"736991e33f08bb2775709a37f19897bdb522b966bad00b8979bf88aa9806e115"}},{"ruleId":"D1","level":"warning","message":{"text":"PinnedQuestsSummary._standardRow (cyclomatic 17): PinnedQuestsSummary._standardRow has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/pinned_quests_summary.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db9ca53dbb8d81552f6e3712e88eb27f746f569fbb4cd57aa29566d59f2e16e"}},{"ruleId":"D1","level":"warning","message":{"text":"QuestProgressEngine._battleShips (cyclomatic 17): QuestProgressEngine._battleShips has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_progress_engine.dart"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91274374c4d1b3702d40a0f6a92be7f80be744538401f035fb866a1642c152b"}},{"ruleId":"D1","level":"warning","message":{"text":"DataSettingsPage._clearCompositionRecords (cyclomatic 17): DataSettingsPage._clearCompositionRecords has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/data_settings_page.dart"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"08dadd2d460acb6a49b88966438c2bc2c08ff165a7fd8f27a97cbafa973db02a"}},{"ruleId":"D1","level":"warning","message":{"text":"ShipSubtitleUpdateService._checkKc3 (cyclomatic 17): ShipSubtitleUpdateService._checkKc3 has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_update_service.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e365cd985a83820de53a72d8bc17c650173afcdb1dece7c8a6caaff02086b43"}},{"ruleId":"D1","level":"warning","message":{"text":"_LandBaseCard.build (cyclomatic 17): _LandBaseCard.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/src/toolbox/composition_image_card.dart"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e67cd889d46bc65991a9aaaa388a2343d71e0da80dec8fd3900a7e67a97495"}},{"ruleId":"D1","level":"warning","message":{"text":"_CompositionImagePageState._loadRecords (cyclomatic 17): _CompositionImagePageState._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/src/toolbox/composition_image_page.dart"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b14081d9849f470c2fc7833146c08d18def64f687a74876a60175ca9c37ec7b"}},{"ruleId":"D1","level":"warning","message":{"text":"GameModsController.refresh (cyclomatic 17): GameModsController.refresh 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/src/toolbox/game_mods/game_mods_controller.dart"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"847d4bf9581102f26cc18a34cb8c32966bb9716c9d8cbdef513a4a8526e632c9"}},{"ruleId":"D1","level":"warning","message":{"text":"_GameModsPageState._resourceRow (cyclomatic 17): _GameModsPageState._resourceRow has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9f574a0ba3a6c7934e314e82003e6138add8586d0fe5b6ba97150987114bf2"}},{"ruleId":"D1","level":"warning","message":{"text":"SortieMapCatalogUpdateService._getWithRedirects (cyclomatic 17): SortieMapCatalogUpdateService._getWithRedirects has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/sortie_map_catalog_update_service.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7014f1309aacd93fa9a6be390042364a1e57f7ebecd2bedfa4971a034c00ea5b"}},{"ruleId":"D1","level":"warning","message":{"text":"_OverviewPanel.build (cyclomatic 17): _OverviewPanel.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/src/toolbox/sortie_map_query/sortie_map_query_page.dart"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d3d4a802a41eb59f3472c704351251b74208617326d91202b10f393648afb3"}},{"ruleId":"D1","level":"warning","message":{"text":"_NodeDetailPanel.build (cyclomatic 17): _NodeDetailPanel.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/src/toolbox/sortie_map_query/sortie_map_query_page.dart"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"7258417810d71d12d83b1ebdf37409684b12a021a8a012975cd16673eaefb962"}},{"ruleId":"D1","level":"warning","message":{"text":"AndroidGameFrameReloadBridge.reloadWhen (cyclomatic 17): AndroidGameFrameReloadBridge.reloadWhen 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFrameReloadBridge.kt"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10aac9ba1f00e4cee9cb1617a77b070b6df0fc68ec650112e92e8a9955568cb"}},{"ruleId":"D1","level":"warning","message":{"text":"GameModLibrary.saveTree (cyclomatic 17): GameModLibrary.saveTree 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibrary.kt"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9ef27de06b652cd56377a05759794b6886dcfe3fa82d817a8102279a101f8f"}},{"ruleId":"D1","level":"warning","message":{"text":"build_sortie_map_assets._node_kind (cyclomatic 17): build_sortie_map_assets._node_kind 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":"tool/build_sortie_map_assets.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be96ef09b7547d8f6573e68e1a63ae090e2e3fdcef5f24256c842f0160a16ae"}},{"ruleId":"D1","level":"warning","message":{"text":"YahagiApp._buildGameSurface (cyclomatic 16): YahagiApp._buildGameSurface 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/main.dart"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"c844227239576a87f0e0c219b03152dfe72d24fb111ed79a3071007c756dce8a"}},{"ruleId":"D1","level":"warning","message":{"text":"BattleController._mapIdentityFromNavigation (cyclomatic 16): BattleController._mapIdentityFromNavigation has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_controller.dart"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e27c52825b03674d882d7e7d974f73cc5e9db7334b4327059ab06c8ac446430"}},{"ruleId":"D1","level":"warning","message":{"text":"BattleContext._baseNodeTypeLabel (cyclomatic 16): BattleContext._baseNodeTypeLabel has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_models.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"78200a67c0dd12f72d0a4b023f993cd7bdd5394b943a5a90d584023b16d1313b"}},{"ruleId":"D1","level":"warning","message":{"text":"_CompactFleetGrid.build (cyclomatic 16): _CompactFleetGrid.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/src/battle/live_battle_card.dart"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"46888fff0e802c7e5590fef1a1613441afeeab756ae5e5f03ede56c2611e961c"}},{"ruleId":"D1","level":"warning","message":{"text":"_GameFullscreenControlsState._syncNative (cyclomatic 16): _GameFullscreenControlsState._syncNative 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/src/browser/game_fullscreen_controls.dart"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe48a476c71bbde83ea534033c048a32dac870ed064891100d10fd9446e4ec3"}},{"ruleId":"D1","level":"warning","message":{"text":"_GameFullscreenControlsState.build (cyclomatic 16): _GameFullscreenControlsState.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/src/browser/game_fullscreen_controls.dart"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eabc2c2a293feb9ff0092f9217dead9b8060c80845111a539cc503ea252372b"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeGameResourceChecklistAdapter._onEvent (cyclomatic 16): NativeGameResourceChecklistAdapter._onEvent has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/native_game_resource_checklist.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"769a312e78f7a52d727fad0381b834e72b1e04edd184cd630efbef4a8bfefaff"}},{"ruleId":"D1","level":"warning","message":{"text":"_BattleResultWarningOverlayState._refreshWarning (cyclomatic 16): _BattleResultWarningOverlayState._refreshWarning has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/battle_result_warning_overlay.dart"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fa5c45261d7ba662c9b291783bc15ccc588521788ccbb0aa9fabc52f70f415"}},{"ruleId":"D1","level":"warning","message":{"text":"_FleetInformationCenterState.build (cyclomatic 16): _FleetInformationCenterState.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/src/fleet/fleet_information_center.dart"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edd59ddde113fb89aa3cbe5e8be7227b69c2e04bd2fff108a943a657f1abcc6"}},{"ruleId":"D1","level":"warning","message":{"text":"_FleetViewState.build (cyclomatic 16): _FleetViewState.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/src/fleet/fleet_information_center.dart"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5221eafb4811a0de2a86ebf6f77623f7dbbac1849f2e26e9760416aa697aa80"}},{"ruleId":"D1","level":"warning","message":{"text":"_RepairSummaryCardState._buildDockSlot (cyclomatic 16): _RepairSummaryCardState._buildDockSlot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/repair_summary_card.dart"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b8be430a80035a6d2197cb4648dd522b3a3f4d9ed73308f2dbc1d4fb71a5e9"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactResourceBarState._gridRows (cyclomatic 16): CompactResourceBarState._gridRows has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/resource_grid.dart"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5d9d533680bbe1bf40c585de1580c6a35d0b0bf82ba96c233f8355165f9400"}},{"ruleId":"D1","level":"warning","message":{"text":"GameStateReducer._selectEventMapRank (cyclomatic 16): GameStateReducer._selectEventMapRank has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac31d645e5baba735f44760d47dee0b2db4f2c2a691985de7fbb59c1d709e6a6"}},{"ruleId":"D1","level":"warning","message":{"text":"ImprovementRawBundle.normalize (cyclomatic 16): ImprovementRawBundle.normalize has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/improvement/improvement_raw_bundle.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa63142601b0b1e1f6a9f9febd01cfc48916bd9390a92e596486f1b57a64540a"}},{"ruleId":"D1","level":"warning","message":{"text":"GameNameDictionary.fromJson (cyclomatic 16): GameNameDictionary.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/src/localization/game_name_dictionary.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b5885434ad23c1e83a50d8de758fefb55fbb16673126fece752b0044e8969b"}},{"ruleId":"D1","level":"warning","message":{"text":"_LogbookTablePageState._operationRecordQuery (cyclomatic 16): _LogbookTablePageState._operationRecordQuery has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_page.dart"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"604e2e8baf8add6e60be1f90245ee0e1f326b7bd5bde605acc0d89f95010c5bb"}},{"ruleId":"D1","level":"warning","message":{"text":"GameNotificationCoordinator._captureManualCompletionTasks (cyclomatic 16): GameNotificationCoordinator._captureManualCompletionTasks has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notification/game_notification_coordinator.dart"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6688187b8bba63f56a67f91dfc32f3b76d1fcf67a10a24245a271d23a7ea2a"}},{"ruleId":"D1","level":"warning","message":{"text":"SenkaPanel.build (cyclomatic 16): SenkaPanel.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/src/senka/senka_ui.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f3560a40ed1e86e658795a695cd8362ffe7a4ddff286484b5aad290f390b73"}},{"ruleId":"D1","level":"warning","message":{"text":"_ExpCalcPageState._battleOptions (cyclomatic 16): _ExpCalcPageState._battleOptions has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/exp_calc/exp_calc_page.dart"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7da2ac76da14564a68d70f32e0ebeb52e9816fd0654e6a09a0481c9c4d2e15"}},{"ruleId":"D1","level":"warning","message":{"text":"_MarqueeTextState.build (cyclomatic 16): _MarqueeTextState.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/src/widgets/marquee_text.dart"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"7495e558526dfec5be00399bfae4713c9eb117b5b19ab6603ade2bc2294bd1e5"}},{"ruleId":"D1","level":"warning","message":{"text":"GameMouseWheelBridge.onMessage (cyclomatic 16): GameMouseWheelBridge.onMessage 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameMouseWheelBridge.kt"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8eff013c49f3c119dc2777fc92ac82cf465046331cfe42247de1b3dd64f8f68"}},{"ruleId":"D1","level":"warning","message":{"text":"KanxyHttpProxyMonitor.setProxy (cyclomatic 16): KanxyHttpProxyMonitor.setProxy 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/KanxyHttpProxyMonitor.kt"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c37aa2d0d8c15d37f424945610c878dedf3760c6a5cb229459d52eb34326afc"}},{"ruleId":"D1","level":"warning","message":{"text":"GameModArchive.applyDependencies (cyclomatic 16): GameModArchive.applyDependencies 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModArchive.kt"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b98b13fa4bbb2e82e3d3e51dcb792abbb08d3979ed4fed72761df94b62d2561"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeGameWarningDialogChannel.createWindow (cyclomatic 16): NativeGameWarningDialogChannel.createWindow 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogChannel.kt"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"196b184cecde1e3ee812044157a38499205daa046af86f1d686676a693ac1b3d"}},{"ruleId":"D1","level":"warning","message":{"text":"check_repository_hygiene.findings (cyclomatic 16): check_repository_hygiene.findings 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":"tool/check_repository_hygiene.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce62e36cc78b7c8ef1a6a0489a6fc2eea20999abbc3582fb8f8672ec24c48d5"}},{"ruleId":"D1","level":"warning","message":{"text":"ship_subtitles.installHooks (cyclomatic 16): ship_subtitles.installHooks has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to 4 function items inside it that branch. 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":"assets/scripts/ship_subtitles.js"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fe2207a7792d77e56b48b7eb9f010499194f32ad3e4a51288986b9880c71b5"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleBuilder.buildForPage (cognitive 586): RuleBuilder.buildForPage has cognitive complexity 586 (threshold 15). Drivers by points: if/else 85 (304 pts), loops 49 (195 pts), ternaries 15 (63 pts), boolean chains 19, match/switch 1 (5 pts) (nesting depth added 417). 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":"tool/akashi_bonus/lib/rule_builder.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"594a52f0a697e4698b8f39b43ed0a13089477628b909653c3bc06210c9e3e18a"}},{"ruleId":"D2","level":"warning","message":{"text":"GameStateSerializer.deserialize (cognitive 304): GameStateSerializer.deserialize has cognitive complexity 304 (threshold 15). Drivers by points: if/else 43 (142 pts), loops 20 (65 pts), ternaries 15 (64 pts), boolean chains 32, error handling 1 (nesting depth added 193). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_serializer.dart"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c803ddfbd8dc8e03edcfc4c2dd03b3079e9a75db4f8e16921bd346920a5224"}},{"ruleId":"D2","level":"warning","message":{"text":"TargetGroupResolver.resolve (cognitive 237): TargetGroupResolver.resolve has cognitive complexity 237 (threshold 15). Drivers by points: if/else 56 (161 pts), loops 10 (47 pts), boolean chains 17, ternaries 3 (12 pts) (nesting depth added 151). 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":"tool/akashi_bonus/lib/name_resolver.dart"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc695b14af4e6a4585a10d78c5a29dbd0acf6d357d159315a61f8a672be956b7"}},{"ruleId":"D2","level":"warning","message":{"text":"GameNotificationCoordinator._buildScheduledAlarms (cognitive 184): GameNotificationCoordinator._buildScheduledAlarms has cognitive complexity 184 (threshold 15). Drivers by points: if/else 34 (123 pts), ternaries 6 (21 pts), boolean chains 20, loops 7 (20 pts) (nesting depth added 117). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notification/game_notification_coordinator.dart"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"667ad1f818367b9e823488d8ac87062c123e7ae5cfd8a39196c73480ff7a38bc"}},{"ruleId":"D2","level":"warning","message":{"text":"GameNotificationCoordinator._buildOngoingItems (cognitive 178): GameNotificationCoordinator._buildOngoingItems has cognitive complexity 178 (threshold 15). Drivers by points: if/else 26 (77 pts), ternaries 16 (56 pts), loops 9 (26 pts), boolean chains 17, match/switch 1 (2 pts) (nesting depth added 109). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notification/game_notification_coordinator.dart"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f975700376e5b8a21e10efae35327c626a17cc79a1bf1a781ed6fb4ac9733ec7"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestProgressEngine._events (cognitive 151): QuestProgressEngine._events has cognitive complexity 151 (threshold 15). Drivers by points: if/else 42 (95 pts), boolean chains 26, loops 7 (17 pts), ternaries 6 (13 pts) (nesting depth added 70). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_progress_engine.dart"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca172fd5f5f0570d76ffe58c2923b0aab852ae4436a11d781e54e669a07344e"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestProgressEngine.process (cognitive 150): QuestProgressEngine.process has cognitive complexity 150 (threshold 15). Drivers by points: if/else 31 (61 pts), ternaries 13 (43 pts), loops 13 (27 pts), boolean chains 18, error handling 1 (nesting depth added 74). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_progress_engine.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99a13b70aadef5dac4e8ab552e1e5efb642c59465f3532f0b7cd2b6938ef0f9"}},{"ruleId":"D2","level":"warning","message":{"text":"_YahagiShellState._buildShell (cognitive 140): _YahagiShellState._buildShell has cognitive complexity 140 (threshold 15). Drivers by points: ternaries 76 (90 pts), boolean chains 39, if/else 10 (11 pts) (nesting depth added 15). 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/main.dart"},"region":{"startLine":2455}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cf2b198086e92fd4c4a5d4dee81b9ec0e4dc1b22c4ab4096d10fa18bfe87b3"}},{"ruleId":"D2","level":"warning","message":{"text":"_InformationPanelState.build (cognitive 131): _InformationPanelState.build has cognitive complexity 131 (threshold 15). Drivers by points: ternaries 51 (82 pts), boolean chains 20, if/else 15 (20 pts), match/switch 3 (5 pts), loops 3 (4 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/main.dart"},"region":{"startLine":4534}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d81a969e7478c81a5d022599cb9eab3802be59d7cdfa904cc5afc497679a3d"}},{"ruleId":"D2","level":"warning","message":{"text":"_PoiBattleSimulator._shell (cognitive 110): _PoiBattleSimulator._shell has cognitive complexity 110 (threshold 15). Drivers by points: if/else 17 (62 pts), ternaries 8 (27 pts), boolean chains 17, loops 2 (4 pts) (nesting depth added 66). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0490a33157ed63fef049ae2636ea8ed915f2d6f1f2c567f7963efca572d12b3"}},{"ruleId":"D2","level":"warning","message":{"text":"BackupArchive.decode (cognitive 103): BackupArchive.decode has cognitive complexity 103 (threshold 15). Drivers by points: if/else 32 (58 pts), boolean chains 35, loops 5 (10 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/backup/record_backup.dart"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c8c01314668e06a49b010dd95f22cd43f66f70685cd3f9b7308330857deb22"}},{"ruleId":"D2","level":"warning","message":{"text":"MainActivity.configureFlutterEngine (cognitive 102): MainActivity.configureFlutterEngine has cognitive complexity 102 (threshold 15). Drivers by points: if/else 56 (79 pts), boolean chains 14, match/switch 9 (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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee157086b539cfc9ab889d59ea1a642c2154078c6ad79d79a4cd1ef6cadd292"}},{"ruleId":"D2","level":"warning","message":{"text":"ShipSubtitleRuntimeController._synchronize (cognitive 99): ShipSubtitleRuntimeController._synchronize has cognitive complexity 99 (threshold 15). Drivers by points: if/else 17 (66 pts), boolean chains 13, ternaries 3 (12 pts), loops 2 (6 pts), error handling 1 (2 pts) (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_runtime_controller.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecdb5c1c30d23ef1713c42c429860a794b33141c5853161cd285c311d9fe69b"}},{"ruleId":"D2","level":"warning","message":{"text":"DatasetValidator.validate (cognitive 97): DatasetValidator.validate has cognitive complexity 97 (threshold 15). Drivers by points: if/else 24 (60 pts), loops 11 (27 pts), boolean chains 10 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into 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/akashi_bonus/lib/dataset_validator.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8200887712e2729a1a94806b97753cb43397b6db38377f2fbcbad1bdde247487"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutSettingsController.load (cognitive 87): LayoutSettingsController.load has cognitive complexity 87 (threshold 15). Drivers by points: if/else 30 (45 pts), ternaries 9 (16 pts), boolean chains 14, error handling 4 (8 pts), loops 2 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/layout_settings_controller.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d922b0d9d28f8f1b567ee10aa629cfe53a622964f7291c477d6a02d8710247a"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpeditionStrings.conditionLabel (cognitive 81): ExpeditionStrings.conditionLabel has cognitive complexity 81 (threshold 15). Drivers by points: ternaries 36 (74 pts), match/switch 3 (5 pts), if/else 2 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_strings.dart"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c88f7722e990bd072d22bb618d6af067fa72960336a962165c6aacb8de853d"}},{"ruleId":"D2","level":"warning","message":{"text":"GameStateReducer._battleResult (cognitive 81): GameStateReducer._battleResult has cognitive complexity 81 (threshold 15). Drivers by points: if/else 14 (34 pts), ternaries 14 (34 pts), boolean chains 11, loops 1 (2 pts) (nesting depth added 41). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":3070}}}],"partialFingerprints":{"codehealthFindingId/v1":"417b0024127ac08dd7d9292c159e35866f78ce5a957724f289b3fab86aca0f46"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModArchive.unpackChecked (cognitive 81): GameModArchive.unpackChecked has cognitive complexity 81 (threshold 15). Drivers by points: if/else 34 (65 pts), boolean chains 11, loops 3 (4 pts), error handling 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModArchive.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9544b30bf10276cfa5d90be78d1fdd22f717de5153ceff23a3dfc14f556f0cdf"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestProgressEngine.restore (cognitive 78): QuestProgressEngine.restore has cognitive complexity 78 (threshold 15). Drivers by points: if/else 17 (51 pts), loops 5 (16 pts), boolean chains 10, error handling 1 (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_progress_engine.dart"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"18939431968d64a9a3fbb0363f74f66338fde7022f1ffeb80c58c1837eda17d4"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstructionSummaryCard._buildConstructionSlotAt (cognitive 75): ConstructionSummaryCard._buildConstructionSlotAt has cognitive complexity 75 (threshold 15). Drivers by points: ternaries 27 (50 pts), if/else 13 (16 pts), boolean chains 9 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/construction_summary_card.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6ca38f70979f60f5a4e506ae1de1f09446a5bc19b0221c040a643b46c45c16"}},{"ruleId":"D2","level":"warning","message":{"text":"_LogbookExperiencePageState._buildTable (cognitive 75): _LogbookExperiencePageState._buildTable has cognitive complexity 75 (threshold 15). Drivers by points: ternaries 28 (46 pts), if/else 15 (19 pts), match/switch 4 (5 pts), boolean chains 3, loops 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/src/logbook/logbook_experience_page.dart"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdae15f2c2fbcca5090601146580486b1633908c62322443b32e07e92e2a9bd6"}},{"ruleId":"D2","level":"warning","message":{"text":"RecordBackupService.restore (cognitive 74): RecordBackupService.restore has cognitive complexity 74 (threshold 15). Drivers by points: if/else 17 (49 pts), error handling 5 (11 pts), boolean chains 6, loops 2 (6 pts), ternaries 1 (2 pts) (nesting depth added 43). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/backup/record_backup.dart"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa729246c2b2ee525679e18d85864fa8f789f142b6d59161b0d525fe8b298b48"}},{"ruleId":"D2","level":"warning","message":{"text":"_CompositionImagePageState._save (cognitive 71): _CompositionImagePageState._save has cognitive complexity 71 (threshold 15). Drivers by points: if/else 17 (35 pts), boolean chains 16, ternaries 6 (13 pts), loops 2 (5 pts), error handling 1, match/switch 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/composition_image_page.dart"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"52de3a807508d2da623290be270183c006651929116177c77b3dc8e70ff31eac"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModPng.inspect (cognitive 71): GameModPng.inspect has cognitive complexity 71 (threshold 15). Drivers by points: if/else 24 (37 pts), boolean chains 18, loops 7 (9 pts), match/switch 3 (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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModPng.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9029d0cbe3556d632e86618ce8cfab4d0ed70b9d3c32e1143e7a53cf8bd935"}},{"ruleId":"D2","level":"warning","message":{"text":"GameStateController.accept (cognitive 69): GameStateController.accept has cognitive complexity 69 (threshold 15). Drivers by points: if/else 20 (42 pts), boolean chains 20, error handling 2 (4 pts), ternaries 1 (3 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/src/game_state/game_state_controller.dart"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba295a2d326e547a55577eab1b92a099a6bbffd960ffa6bca39967ebaaf4d4d"}},{"ruleId":"D2","level":"warning","message":{"text":"LogbookDatabase._validateBackupRows (cognitive 69): LogbookDatabase._validateBackupRows has cognitive complexity 69 (threshold 15). Drivers by points: if/else 10 (37 pts), boolean chains 16, loops 7 (16 pts) (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/src/logbook/logbook_database.dart"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6edc62ccd9d72f9e07dac184d2b5c0926e34bb7e30d28eef596152139c51cd"}},{"ruleId":"D2","level":"warning","message":{"text":"BattleDetailReplayBuilder._parseShell (cognitive 67): BattleDetailReplayBuilder._parseShell has cognitive complexity 67 (threshold 15). Drivers by points: ternaries 12 (30 pts), if/else 8 (22 pts), boolean chains 9, loops 3 (6 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_detail_replay_builder.dart"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"a543e4b1aabb316c02b1489b16ce60d5d48bc4d1cce86d429c92850c611fecc8"}},{"ruleId":"D2","level":"warning","message":{"text":"_FleetShipStatusCapsuleState.build (cognitive 64): _FleetShipStatusCapsuleState.build has cognitive complexity 64 (threshold 15). Drivers by points: if/else 16 (29 pts), ternaries 13 (24 pts), boolean chains 8, loops 1 (3 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/src/fleet/fleet_ship_status_capsule.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fde12670b5297f4290cad9ae358bd7d835630f1f800630389f20ea0f28e34e"}},{"ruleId":"D2","level":"warning","message":{"text":"GameStateReducer._parseShips (cognitive 62): GameStateReducer._parseShips has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 26 (52 pts), if/else 2 (5 pts), loops 2 (3 pts), boolean chains 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/src/game_state/game_state_reducer.dart"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"385f1030c811a2afa4bc56c65845d8e5bb9d38f53f33abd4fae8c6311ddc5157"}},{"ruleId":"D2","level":"warning","message":{"text":"build_enemy_catalog.build_catalog (cognitive 62): build_enemy_catalog.build_catalog has cognitive complexity 62 (threshold 15). Drivers by points: if/else 14 (34 pts), ternaries 4 (12 pts), loops 7 (9 pts), boolean chains 7 (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":"tool/build_enemy_catalog.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"df98885d2b37cab452ebc58f99bc570478d4868c0db00b4dab8c95bc43259a1e"}},{"ruleId":"D2","level":"warning","message":{"text":"DashboardCard.build (cognitive 61): DashboardCard.build has cognitive complexity 61 (threshold 15). Drivers by points: if/else 14 (37 pts), ternaries 9 (14 pts), boolean chains 10 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/dashboard_card.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"28667595c7c1aa17c048e9d2f4cc2715c7aad0602f2b299114c03ceb060fa6e4"}},{"ruleId":"D2","level":"warning","message":{"text":"GameStateController.allowsCaptureEvent (cognitive 60): GameStateController.allowsCaptureEvent has cognitive complexity 60 (threshold 15). Drivers by points: boolean chains 29, if/else 15 (23 pts), loops 5 (7 pts), ternaries 1 (nesting depth added 10). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_controller.dart"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"b919c890fa090b986a04da002cfe74facc7c6dd31c6a9a6769dc29a3c60d9924"}},{"ruleId":"D2","level":"warning","message":{"text":"_GameModsPageState._details (cognitive 60): _GameModsPageState._details has cognitive complexity 60 (threshold 15). Drivers by points: loops 11 (19 pts), if/else 9 (17 pts), boolean chains 13, ternaries 7 (11 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/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ed88b811bb6abd4bc6c22ef6a224196626b69028172e38544a687b9bef2dae"}},{"ruleId":"D2","level":"warning","message":{"text":"BackupArchive.merge (cognitive 59): BackupArchive.merge has cognitive complexity 59 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 11 (18 pts), boolean chains 7, ternaries 3 (6 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/src/backup/record_backup.dart"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"552cb3ba9fcbf449e6bb018d21db0caceb9449b417c2e74e3c52fcb2a6fc6d22"}},{"ruleId":"D2","level":"warning","message":{"text":"GameResourceCacheEngine.fetch (cognitive 59): GameResourceCacheEngine.fetch has cognitive complexity 59 (threshold 15). Drivers by points: if/else 28 (36 pts), boolean chains 20, error handling 2 (3 pts) (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheEngine.kt"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f82f147a504a9b2b0243bd0388e61b8c571ff1b8a054ee497173f07fcafab49"}},{"ruleId":"D2","level":"warning","message":{"text":"ShipPortraitCache._resolve (cognitive 58): ShipPortraitCache._resolve has cognitive complexity 58 (threshold 15). Drivers by points: if/else 15 (37 pts), ternaries 4 (10 pts), error handling 3 (6 pts), boolean chains 5 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/ship_portrait_cache.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ec3503dfc4f57f8da1e7eebdec95d8ac16fabf802b2b3ce1396d855f8b5bde"}},{"ruleId":"D2","level":"warning","message":{"text":"GameInfoNoticeController.calculateFleetTrainingCruiserBonus (cognitive 58): GameInfoNoticeController.calculateFleetTrainingCruiserBonus has cognitive complexity 58 (threshold 15). Drivers by points: if/else 27 (50 pts), boolean chains 7, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notice/game_info_notice_controller.dart"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"3502b8db1e9162742051b86b619ddcfdca8f42efe2ed3fed3ad3c83f8688c014"}},{"ruleId":"D2","level":"warning","message":{"text":"_BattleResultWarningOverlayState._checkAdvanceSafety (cognitive 57): _BattleResultWarningOverlayState._checkAdvanceSafety has cognitive complexity 57 (threshold 15). Drivers by points: boolean chains 26, if/else 13 (25 pts), error handling 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/battle_result_warning_overlay.dart"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb46c8f87bdcef0bbab62d3b3af5acc3a50961bdb8a74acd313525af9beb7485"}},{"ruleId":"D2","level":"warning","message":{"text":"GameStateReducer._start2 (cognitive 57): GameStateReducer._start2 has cognitive complexity 57 (threshold 15). Drivers by points: ternaries 16 (32 pts), if/else 8 (16 pts), boolean chains 7, loops 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/src/game_state/game_state_reducer.dart"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f92cad04f51b5ffcf8ab779788419b8f3aec5363a169d2b9389c93090874cf"}},{"ruleId":"D2","level":"warning","message":{"text":"SortieExperienceController.accept (cognitive 57): SortieExperienceController.accept has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (31 pts), boolean chains 22, ternaries 1 (2 pts), error handling 1, match/switch 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/src/sortie_experience/sortie_experience_controller.dart"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d0e585128616f7a13874c3e22272e590c1119532ce0579a7b66fc876de1fff"}},{"ruleId":"D2","level":"warning","message":{"text":"_ResourceTrendChartState.build (cognitive 56): _ResourceTrendChartState.build has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 21 (36 pts), if/else 12 (17 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/src/fleet/resource_trend_chart.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"1848d833537a33a19ddb8e830a97bb58d2599278c4339c66ca9644d3f46ff809"}},{"ruleId":"D2","level":"warning","message":{"text":"_NativeActivityGameSurfaceState._drainVisibility (cognitive 56): _NativeActivityGameSurfaceState._drainVisibility has cognitive complexity 56 (threshold 15). Drivers by points: if/else 10 (37 pts), boolean chains 11, error handling 1 (4 pts), loops 2 (4 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/native_activity_game_surface.dart"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ee1aeda9628b62c24952e7df3c3469de40780192d9876bec903678b36ce3d3"}},{"ruleId":"D2","level":"warning","message":{"text":"BattleController._applyBattlePhase (cognitive 55): BattleController._applyBattlePhase has cognitive complexity 55 (threshold 15). Drivers by points: if/else 18 (31 pts), boolean chains 9, loops 5 (8 pts), ternaries 7 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_controller.dart"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abb858817d18debf17f221ced709ee112df14ef42826f81d9fcabd97d87d004"}},{"ruleId":"D2","level":"warning","message":{"text":"GameCaptureController._drainConfigurations (cognitive 55): GameCaptureController._drainConfigurations has cognitive complexity 55 (threshold 15). Drivers by points: if/else 13 (45 pts), error handling 2 (7 pts), boolean chains 2, 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/src/capture/game_capture_controller.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc1eec7758fa30417f99bfb5c7573cd5639ee9125b3a67a41add2438a86e348"}},{"ruleId":"D2","level":"warning","message":{"text":"GameStateReducer._mapInfo (cognitive 54): GameStateReducer._mapInfo has cognitive complexity 54 (threshold 15). Drivers by points: ternaries 15 (30 pts), if/else 7 (13 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fffeee0fb4f37f6bd69cb0e73737ce0882181b7024bffe787e1c26eece6af9e"}},{"ruleId":"D2","level":"warning","message":{"text":"_SortieExperienceCardState._shipTable (cognitive 54): _SortieExperienceCardState._shipTable has cognitive complexity 54 (threshold 15). Drivers by points: ternaries 34 (35 pts), boolean chains 7, if/else 6 (7 pts), loops 3 (5 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/src/sortie_experience/sortie_experience_card.dart"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe95ff08d8c9b823d4561b4a8bb6f333047c0c6dcd87ecf083c87f375a26f6d"}},{"ruleId":"D2","level":"warning","message":{"text":"ShipSubtitleCatalogController._checkKcwikiGroup (cognitive 54): ShipSubtitleCatalogController._checkKcwikiGroup has cognitive complexity 54 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 5 (15 pts), ternaries 3 (8 pts), error handling 3 (6 pts), match/switch 1 (4 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_catalog_controller.dart"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce3f993d8bc2edf96059216df4554ac4b7fa9c50759cdc0aacc2f3fb5a0e1be"}},{"ruleId":"D2","level":"warning","message":{"text":"GameRuntimeSettingsPage.build (cognitive 53): GameRuntimeSettingsPage.build has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (37 pts), boolean chains 5, match/switch 2 (5 pts), ternaries 2 (5 pts), loops 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/src/settings/game_runtime_settings_page.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5c00ad9db58d2ebb651c3c00ec5d915d37e69681c944d126321ba34ecb2e76"}},{"ruleId":"D2","level":"warning","message":{"text":"HdLayoutSettings.decode (cognitive 52): HdLayoutSettings.decode has cognitive complexity 52 (threshold 15). Drivers by points: ternaries 11 (30 pts), if/else 4 (9 pts), boolean chains 8, loops 2 (4 pts), error handling 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/hd_layout_settings.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"95642653e36985da6d80ccf0857d9118e30ed9ada6269a1c819c2106fd698823"}},{"ruleId":"D2","level":"warning","message":{"text":"GameCaptureController._applyConfiguration (cognitive 51): GameCaptureController._applyConfiguration has cognitive complexity 51 (threshold 15). Drivers by points: if/else 18 (44 pts), boolean chains 4, ternaries 1 (2 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/src/capture/game_capture_controller.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"3160b15abeafaa82fbd8da217c492bf495c2dff1ed25a124d33064f139aac9b8"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpeditionStrings._localizedFlagshipType (cognitive 51): ExpeditionStrings._localizedFlagshipType has cognitive complexity 51 (threshold 15). Drivers by points: ternaries 18 (35 pts), if/else 5 (7 pts), match/switch 3 (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/src/expedition/expedition_strings.dart"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56d71171cad4f7730b090f2ac2041bed78a8865035e5f3f4d113dcfd5e241ef"}},{"ruleId":"D2","level":"warning","message":{"text":"SortieResourceLedger._reconcileCharge (cognitive 51): SortieResourceLedger._reconcileCharge has cognitive complexity 51 (threshold 15). Drivers by points: boolean chains 22, if/else 7 (11 pts), ternaries 4 (9 pts), loops 3 (5 pts), match/switch 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/src/sortie_experience/sortie_resource_ledger.dart"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7cd82f16f03837ac173b48e639eaf61eab2befdf7b03185455bbf18b832f75"}},{"ruleId":"D2","level":"warning","message":{"text":"CompositionImageCard.build (cognitive 50): CompositionImageCard.build has cognitive complexity 50 (threshold 15). Drivers by points: ternaries 12 (21 pts), if/else 10 (17 pts), boolean chains 6, loops 3 (6 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/src/toolbox/composition_image_card.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"08418c002c0eaad340b246fd7c4e16bfe64ea2db85c7ad5b2236f687bb98aeb7"}},{"ruleId":"D2","level":"warning","message":{"text":"build_sortie_release._validate_client_catalog (cognitive 50): build_sortie_release._validate_client_catalog has cognitive complexity 50 (threshold 15). Drivers by points: loops 9 (29 pts), if/else 7 (18 pts), boolean chains 3 (nesting depth added 31). 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/build_sortie_release.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fec3d8f4c6728eca9d26167efbe67fbbc6abdead4ee2b6da7b70462304e712"}},{"ruleId":"D2","level":"warning","message":{"text":"GameNotificationCoordinator._drainSnapshots (cognitive 48): GameNotificationCoordinator._drainSnapshots has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (35 pts), loops 2 (5 pts), boolean chains 4, error handling 1 (4 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notification/game_notification_coordinator.dart"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecb22222308d40f8d1a2a5fe80064088cfda7457173e4a9ae085dd701c378ff"}},{"ruleId":"D2","level":"warning","message":{"text":"ShipSubtitleKc3UpdateService._get (cognitive 48): ShipSubtitleKc3UpdateService._get has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (37 pts), loops 2 (6 pts), boolean chains 4, ternaries 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/src/subtitles/ship_subtitle_kc3_update_service.dart"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc879b0810476f49b1ea6760399ea3ae3d7d68136ceaac0c6a9920d10723977"}},{"ruleId":"D2","level":"warning","message":{"text":"SenkaState.fromJson (cognitive 47): SenkaState.fromJson has cognitive complexity 47 (threshold 15). Drivers by points: ternaries 15 (16 pts), boolean chains 11, if/else 7 (10 pts), loops 7 (10 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_state.dart"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"969f88d2c5a5c1347df2594cf4ff53fad7ea4bfdd465ef3ac767fcbb52ada63e"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeGameWarningDialogSpec.parse (cognitive 47): NativeGameWarningDialogSpec.parse has cognitive complexity 47 (threshold 15). Drivers by points: boolean chains 26, if/else 20 (21 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogState.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"41261a2db0c73574c485f6766ac873409441f0ffe0b9fff0072a29d64b4414c5"}},{"ruleId":"D2","level":"warning","message":{"text":"_FleetSummaryMetrics.build (cognitive 46): _FleetSummaryMetrics.build has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 17 (21 pts), boolean chains 11, if/else 8 (10 pts), loops 2 (3 pts), match/switch 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_summary_card.dart"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c4c7d9534e80570672b49e585fe82846c976fa0b6a8394fcce37e8143c36e9"}},{"ruleId":"D2","level":"warning","message":{"text":"_RenderPortraitMasonry.performLayout (cognitive 46): _RenderPortraitMasonry.performLayout has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 10 (21 pts), if/else 8 (16 pts), boolean chains 7, loops 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/layout/hd_portrait_grid.dart"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1e75356759ca2e4980249c126b1277f225a872e08661240004d0e2b318d6a8"}},{"ruleId":"D2","level":"warning","message":{"text":"_QuestDetail.build (cognitive 46): _QuestDetail.build has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 6 (14 pts), loops 3 (6 pts), match/switch 2 (5 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/src/quest/quest_center_page.dart"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"11817c6c50a4853d9023b938416fcbd66677dfff42e47dc470625b3bee6519d0"}},{"ruleId":"D2","level":"warning","message":{"text":"_GameModsPageState._badges (cognitive 46): _GameModsPageState._badges has cognitive complexity 46 (threshold 15). Drivers by points: if/else 23 (34 pts), boolean chains 7, ternaries 2 (4 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/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c79c809c1d8283fbb7b4516288354e304200b5e255d8d76408e04597e546f4"}},{"ruleId":"D2","level":"warning","message":{"text":"GameBrowserToolbar.build (cognitive 45): GameBrowserToolbar.build has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 29 (37 pts), if/else 5, boolean chains 3 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/game_browser_toolbar.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcde7702935e9d2465f288364a52028d6f496d0e1bc99d7f7232094bed2fb83"}},{"ruleId":"D2","level":"warning","message":{"text":"LogbookDatabase._getOperationRecords (cognitive 45): LogbookDatabase._getOperationRecords has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (26 pts), ternaries 5 (11 pts), loops 1 (3 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_database.dart"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"10befd17e6db261450ce10c2290ccb5bfbb454e22ec8d041731e97ae633dc793"}},{"ruleId":"D2","level":"warning","message":{"text":"SenkaReducer._ranking (cognitive 45): SenkaReducer._ranking has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (20 pts), ternaries 6 (12 pts), boolean chains 11, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_reducer.dart"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4104a75d54be91fb9958be6ab4fb19b53052ef7f140d3d0d023c82c5543225"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModLibrary.scan (cognitive 45): GameModLibrary.scan has cognitive complexity 45 (threshold 15). Drivers by points: if/else 25 (26 pts), boolean chains 17, error handling 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibrary.kt"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a6648b6c365a93f118afcfff2c159220bed61d1dfa2234bd99bf7a36310439"}},{"ruleId":"D2","level":"warning","message":{"text":"OwnedInventoryProjection.equipmentGroups (cognitive 44): OwnedInventoryProjection.equipmentGroups has cognitive complexity 44 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 10 (15 pts), ternaries 3 (6 pts), boolean chains 4 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/owned_inventory_projection.dart"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"374415eb6aafdb48c71375ef1b3d1cce7c32cc81296471a0f98d92c29b76b4cf"}},{"ruleId":"D2","level":"warning","message":{"text":"_SortieExperienceCardState._buildTotal (cognitive 44): _SortieExperienceCardState._buildTotal has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (17 pts), ternaries 9 (16 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_experience_card.dart"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8622b43be12dbb34d557d258d2f32e26719e3f1f4f511bb6356561a8337183"}},{"ruleId":"D2","level":"warning","message":{"text":"SortieExperienceController._move (cognitive 44): SortieExperienceController._move has cognitive complexity 44 (threshold 15). Drivers by points: boolean chains 19, if/else 11 (16 pts), ternaries 7 (9 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_experience_controller.dart"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"6456776a854c7b38e91a96130b8f248104163b8449b47142bf8d4652e6de41d3"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetMetrics.fromState (cognitive 43): FleetMetrics.fromState has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 9 (18 pts), if/else 5 (14 pts), loops 5 (7 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/fleet_metrics.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d67fd2aad6b037c477a11f6fe485dd77041ebe533f8a6b9fd0b27f23a522ec"}},{"ruleId":"D2","level":"warning","message":{"text":"build_sortie_release.build_release (cognitive 43): build_sortie_release.build_release has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (32 pts), loops 4 (6 pts), ternaries 1 (3 pts), boolean chains 2 (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":"tool/build_sortie_release.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"765970e25565e7f1220c6b5da5604cd2067cc175c689a2c5de94ec114a660bef"}},{"ruleId":"D2","level":"warning","message":{"text":"_MapPainter.paint (cognitive 42): _MapPainter.paint has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 11 (23 pts), loops 8 (10 pts), if/else 5 (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/src/battle/sortie_map_section.dart"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a4d9b6ea3a9a13f7e9c44317059aa8c7dc1ea1dc475972c94ad3c78a470663"}},{"ruleId":"D2","level":"warning","message":{"text":"_ExpeditionCheckContentState._buildContent (cognitive 41): _ExpeditionCheckContentState._buildContent has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 14 (27 pts), if/else 8 (10 pts), boolean chains 2, 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/src/expedition/expedition_check_card.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"07aa2555045c299e6862f176fd83ebdd6ad20cfe422d620fb1a9feb4165c2375"}},{"ruleId":"D2","level":"warning","message":{"text":"GameApiEventPipeline._prepareAndDispatch (cognitive 41): GameApiEventPipeline._prepareAndDispatch has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 3 (14 pts), boolean chains 8, loops 2 (4 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/src/game_state/game_api_event_pipeline.dart"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78073f6cdf69110c93c2ab4a5bc6c68ae94eea7c1b1eae0e6fdba8eab0af255"}},{"ruleId":"D2","level":"warning","message":{"text":"ShipSubtitleCatalogController.load (cognitive 41): ShipSubtitleCatalogController.load has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 4 (10 pts), boolean chains 8, loops 2 (7 pts), error handling 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_catalog_controller.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebceb90d53349a08e641b58731684b9a4c197873b66d4d04cdcc1b9d2b1f98c8"}},{"ruleId":"D2","level":"warning","message":{"text":"GameResourceCacheIndex.loadLegacySnapshot (cognitive 41): GameResourceCacheIndex.loadLegacySnapshot has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 2 (8 pts), loops 4 (6 pts), boolean chains 2 (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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheIndex.kt"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed58e2209bd1700af6fd6985c4e9aad4780963ba5e04a923ff0176252446e53"}},{"ruleId":"D2","level":"warning","message":{"text":"_CompactBattlePanel.build (cognitive 40): _CompactBattlePanel.build has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 13 (21 pts), if/else 9 (11 pts), loops 5 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/live_battle_card.dart"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c60b844af0681ee9e6eda73c9871d6dcd2d37d617cd42743376daf1ae62f6f"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetTransportPoints.fromState (cognitive 40): FleetTransportPoints.fromState has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (27 pts), boolean chains 6, loops 3 (6 pts), ternaries 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_transport_points.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"003bb1e632c8195369fcd2a3fab52af24f5a6bb80e275c2cfbba08b25b90fb79"}},{"ruleId":"D2","level":"warning","message":{"text":"_GameResourceCacheSectionState.build (cognitive 40): _GameResourceCacheSectionState.build has cognitive complexity 40 (threshold 15). Drivers by points: boolean chains 16, if/else 10 (11 pts), ternaries 6 (11 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/src/settings/game_resource_cache_section.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"482ee1fd85e02323ef54c08be2dae9567b2d18d60b435d6ca7a27ed56286fa19"}},{"ruleId":"D2","level":"warning","message":{"text":"_EquipmentRow.build (cognitive 40): _EquipmentRow.build has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 14 (19 pts), boolean chains 11, if/else 7 (10 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/composition_image_card.dart"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa9059b059794e8d3631d41d0bd0405ccee37de1304a9f2419f8f58e2750194"}},{"ruleId":"D2","level":"warning","message":{"text":"_FleetSummaryCardState.build (cognitive 39): _FleetSummaryCardState.build has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 22 (25 pts), boolean chains 6, if/else 3 (4 pts), loops 4 (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/src/fleet/fleet_summary_card.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f13d6d9bf98f3bdf3242842e8eff4b4baaf41a1cc71733d346b60760d9bbf6"}},{"ruleId":"D2","level":"warning","message":{"text":"GameNameCatalog._buildEntityIndex (cognitive 39): GameNameCatalog._buildEntityIndex has cognitive complexity 39 (threshold 15). Drivers by points: loops 14 (20 pts), if/else 6 (18 pts), boolean chains 1 (nesting depth added 18). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/localization/game_name_catalog.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be820dd51e475e4c1183b9fd4269e935881833c7624be6ce36afcf84b1d8d76"}},{"ruleId":"D2","level":"warning","message":{"text":"DeckBuilderExporter.exportMap (cognitive 39): DeckBuilderExporter.exportMap has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 5 (10 pts), boolean chains 3, ternaries 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/deck_builder_exporter.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd61a82f57be29cae09dcc5261d5054f129a8e61fc3568672c861fef0c8d6af"}},{"ruleId":"D2","level":"warning","message":{"text":"GameResourceCacheManager.onMethodCall (cognitive 39): GameResourceCacheManager.onMethodCall has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 10, match/switch 1 (nesting depth added 12). 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheManager.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1564616c29ee3a847d8114ed02172c3dc486feb1a8dc95f51d5f2ae5a7fe37b0"}},{"ruleId":"D2","level":"warning","message":{"text":"build_enemy_release._validate_catalog (cognitive 39): build_enemy_release._validate_catalog has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 6 (13 pts), boolean chains 7, 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":"tool/build_enemy_release.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"028a79f03b6132f7169aee4ee0d61364b3766131d867f3ac27766afc764cef29"}},{"ruleId":"D2","level":"warning","message":{"text":"_NativeActivityGameSurfaceState._dispatchCurrentEvent (cognitive 38): _NativeActivityGameSurfaceState._dispatchCurrentEvent has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 9, error handling 1 (3 pts), ternaries 1 (2 pts), match/switch 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/src/native_activity_game_surface.dart"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"0768ab67b4289e356c5ce581c472a3df1242c0af00142b9c59129032ea57b92f"}},{"ruleId":"D2","level":"warning","message":{"text":"AppTelemetryService._collectDeviceProperties (cognitive 38): AppTelemetryService._collectDeviceProperties has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 5 (17 pts), if/else 6 (10 pts), error handling 5 (8 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/telemetry/telemetry_service.dart"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b5c8563a0719c0a6c024fcc77bda90a574abfb4fdcc58db85cf74027810781"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpUrlConnectionGameResourceFetcher.fetchWithinBudget (cognitive 38): HttpUrlConnectionGameResourceFetcher.fetchWithinBudget has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 8, 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceFetcher.kt"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"712f4a09a834d6943db3aa45be31ded441b88174681e8dd9640658d037b70f63"}},{"ruleId":"D2","level":"warning","message":{"text":"_GameWebViewState._runStartupSequence (cognitive 37): _GameWebViewState._runStartupSequence has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 7, 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/src/game_webview.dart"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f8d985338b29f374d44df167c6c12c8518f56c5ae09b21ce43d1a873f6efed"}},{"ruleId":"D2","level":"warning","message":{"text":"GameInfoNoticeController._handleModernization (cognitive 37): GameInfoNoticeController._handleModernization has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 7 (16 pts), boolean chains 11, if/else 6 (8 pts), loops 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/src/notice/game_info_notice_controller.dart"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f94ef1601c2732b84655f6a7bb90481d6b1e7e567b2ab98506d24287481d26b"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestCatalog.project (cognitive 37): QuestCatalog.project has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 7 (10 pts), boolean chains 6, ternaries 3 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_catalog.dart"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"761f8f76ee8210634887c6b51c1e5147cfe34847c11d13f2fc7f7cf6b5127023"}},{"ruleId":"D2","level":"warning","message":{"text":"ShipSubtitleUpdateService._get (cognitive 37): ShipSubtitleUpdateService._get has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (28 pts), boolean chains 4, loops 2 (4 pts), ternaries 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/src/subtitles/ship_subtitle_update_service.dart"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcfd5a7e4b48774493cdce055d00550d89d2aaa3e3dc686d4681bc66a0720791"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModsController.setResourcesEnabled (cognitive 37): GameModsController.setResourcesEnabled has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (7 pts), ternaries 2 (7 pts), boolean chains 5 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_controller.dart"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4046fc35f31dcb9491f6eb759a93954f1abffdc3dc674777418233f5f373e6"}},{"ruleId":"D2","level":"warning","message":{"text":"GadgetBypassWebViewClient.serveFromGameCache (cognitive 37): GadgetBypassWebViewClient.serveFromGameCache has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22 (25 pts), boolean chains 9, error handling 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GadgetBypassWebViewClient.kt"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dc66713672ccb6850d57cff86bda379a2e77113d7a888461f6c868707ec428"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceCalculator.compute (cognitive 36): ReferenceCalculator.compute has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (26 pts), ternaries 2 (6 pts), boolean chains 2, loops 2 (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":"tool/akashi_bonus/lib/reference_calculator.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d93c68e802743891e87e35f56c7ea05b5187915fe51b4b16d35283a915fafd5"}},{"ruleId":"D2","level":"warning","message":{"text":"_OwnedInventoryPageState.build (cognitive 36): _OwnedInventoryPageState.build has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 11 (14 pts), boolean chains 7 (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/src/inventory/owned_inventory_page.dart"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7085d401d7ecce0506cd33d1d67d84cb84bacb4c41d4e7925babc6eb13e61d"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestCatalogDataset.parse (cognitive 36): QuestCatalogDataset.parse has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 11, loops 3 (5 pts), ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_catalog_dataset.dart"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f169388ebbe9335f374efe85b8280cb5a66692a41eb66a2659a3165ae23d692c"}},{"ruleId":"D2","level":"warning","message":{"text":"_QuestCenterPageState._entries (cognitive 36): _QuestCenterPageState._entries has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (15 pts), ternaries 5 (10 pts), boolean chains 9, 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/src/quest/quest_center_page.dart"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9a3de41c895e039ada172d98141c1e0ba52b36f756cd3e21ce7fc8cb22daae"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestProgressEngine.replaceGoals (cognitive 36): QuestProgressEngine.replaceGoals has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 6, loops 5 (6 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/src/quest/quest_progress_engine.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d2a2a9ecdc3ff1f1bac01c72bbbf6f98ad5a4e844ef9081185b8c8b4f91c4a"}},{"ruleId":"D2","level":"warning","message":{"text":"_GameModsPageState._coordinateRow (cognitive 36): _GameModsPageState._coordinateRow has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 10, if/else 6 (10 pts), ternaries 9 (10 pts), loops 4 (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/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2e13f2a84a4916b42140dda24779ae0c83fc703fbaf2c00a26d79d8d695a8f"}},{"ruleId":"D2","level":"warning","message":{"text":"BattleController._applyResult (cognitive 35): BattleController._applyResult has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 9, ternaries 3, error handling 1 (2 pts), loops 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/src/battle/battle_controller.dart"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5839d3417b0a857143d0be3d28bfcd8469acac4fb0350318790cf37cbad408"}},{"ruleId":"D2","level":"warning","message":{"text":"NosakiSparkleCalculator.project (cognitive 35): NosakiSparkleCalculator.project has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (20 pts), ternaries 7 (9 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/nosaki_sparkle_calculator.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec0538d483113e2b71a26d248ee8777cbebb1e938751645e729255fbb221f32"}},{"ruleId":"D2","level":"warning","message":{"text":"HdBottomStrip.build (cognitive 35): HdBottomStrip.build has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 9 (14 pts), if/else 5 (9 pts), boolean chains 7, loops 3 (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/src/layout/hd_bottom_strip.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"74363b5a36213cd8c064fb7f9f9d2de9b4ffe29100c35b0e3e9e9d5c9e6989dd"}},{"ruleId":"D2","level":"warning","message":{"text":"_NativeActivityGameSurfaceState._runPostCreateBootstrap (cognitive 35): _NativeActivityGameSurfaceState._runPostCreateBootstrap has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 4, error handling 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/native_activity_game_surface.dart"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"240c16d54e876a0ff7d761060834bcbdebc8c7998e567553f7a8a0ee27a56b1e"}},{"ruleId":"D2","level":"warning","message":{"text":"SortieResourceLedger.returnToPort (cognitive 35): SortieResourceLedger.returnToPort has cognitive complexity 35 (threshold 15). Drivers by points: boolean chains 18, if/else 6 (13 pts), loops 2 (4 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":"lib/src/sortie_experience/sortie_resource_ledger.dart"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ebb244745830911c1a312a44ddd9f479d583e198bfd80fb8d8abbd8ae458a0"}},{"ruleId":"D2","level":"warning","message":{"text":"_ShipCard.build (cognitive 35): _ShipCard.build has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 9 (12 pts), boolean chains 5, match/switch 1 (3 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/src/toolbox/composition_image_card.dart"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"084bea77a0036db4ec87781076ad7e6586dc512326236e0777450e30c5dd9cd1"}},{"ruleId":"D2","level":"warning","message":{"text":"FcdMapUpdateService.checkAndUpdate (cognitive 34): FcdMapUpdateService.checkAndUpdate has cognitive complexity 34 (threshold 15). Drivers by points: if/else 5 (15 pts), error handling 6 (12 pts), boolean chains 6, loops 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/src/battle/fcd_map_update_service.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ba703eb4f66d11c691bc5ea7591d146d2a8051db43893150a22a07a94ff30f"}},{"ruleId":"D2","level":"warning","message":{"text":"GameResourceBaselineCatalog.decode (cognitive 34): GameResourceBaselineCatalog.decode has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 18, if/else 10 (13 pts), ternaries 1 (2 pts), loops 1 (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/src/browser/game_resource_baseline_catalog.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e51bfd6e8f914e2f9e450064cb3330c047012072d458da01c70a21aefc5aff7"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeGameSurfaceSlotState._runBoundsDrain (cognitive 34): NativeGameSurfaceSlotState._runBoundsDrain has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (21 pts), boolean chains 8, error handling 1 (3 pts), 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/src/browser/native_game_surface_slot.dart"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eea24184f58ceb382cfa70143cacc98bf1399cd395643eeacf0f6fe056f0d49"}},{"ruleId":"D2","level":"warning","message":{"text":"ApplicationQuestCatalogStorage._readCachedPairRecovering (cognitive 34): ApplicationQuestCatalogStorage._readCachedPairRecovering has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (26 pts), error handling 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_catalog_store.dart"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"778ebdf818456025c73beb00075368f0654b811d0656710ded626af89dd4e003"}},{"ruleId":"D2","level":"warning","message":{"text":"_QuestCenterPageState.build (cognitive 34): _QuestCenterPageState.build has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 11, ternaries 9 (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/src/quest/quest_center_page.dart"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e6a2699a34ab98cc8174ce4216b03311df48bcb9c4772eae245af85d85992c"}},{"ruleId":"D2","level":"warning","message":{"text":"_QuestCompletionFeedbackState._onStateChanged (cognitive 34): _QuestCompletionFeedbackState._onStateChanged has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 11, ternaries 2 (4 pts), loops 2 (3 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/src/quest/quest_completion_feedback.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4928d199fa80f4c7d835408fbe477258fcd5a70d028f8545f771bda86f218570"}},{"ruleId":"D2","level":"warning","message":{"text":"AppPalette._fallback (cognitive 34): AppPalette._fallback has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (17 pts), ternaries 7 (13 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/theme/app_palette.dart"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d42697179583c0d235139617cdf6d1c46dc8675aba1bc8cf54c99348321f90"}},{"ruleId":"D2","level":"warning","message":{"text":"GameResourceDownloadCoordinator.downloadLoop (cognitive 34): GameResourceDownloadCoordinator.downloadLoop has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 7, error handling 2 (3 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceDownloadCoordinator.kt"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac07965feb4791e184429de4458cd5023e98c6184710d7dfa04b3f43c5a4ef25"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModMp3.validate (cognitive 34): GameModMp3.validate has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 9, loops 2, match/switch 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModMp3.kt"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f111b47b2d7159e6106e41a8ae8ca85d14cb500736fa0e5913b326fe76f9ba"}},{"ruleId":"D2","level":"warning","message":{"text":"build_sortie_map_assets.build_assets (cognitive 34): build_sortie_map_assets.build_assets has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 12, if/else 6 (11 pts), loops 5 (6 pts), error handling 1 (3 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":"tool/build_sortie_map_assets.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"2baf01f3a0ce0b099d9173b50648ca9774d43827114af4559209a33728e08812"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpeditionIncomeCalculator.daihatsuBonusBreakdownForFleet (cognitive 33): ExpeditionIncomeCalculator.daihatsuBonusBreakdownForFleet has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 7 (13 pts), loops 2 (3 pts), boolean chains 1, match/switch 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/src/expedition/expedition_income_calculator.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdfa8678ade9d9e9dcfedec841b5580c92a08cc63541809f5994a0dbd970fb1"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetShipMinimalRow._statusGrid (cognitive 33): FleetShipMinimalRow._statusGrid has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 16, boolean chains 9, if/else 6 (7 pts), 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/src/fleet/fleet_ship_minimal_row.dart"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c87d2818ac7728412243cab5f37b130c20aeccfcd839290654c7179b160691f"}},{"ruleId":"D2","level":"warning","message":{"text":"_DashboardDropTargetState.build (cognitive 33): _DashboardDropTargetState.build has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 8 (18 pts), if/else 5 (8 pts), boolean chains 7 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/layout/hd_home_editor.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1e4ea25df281924cd9b364a0b54dd6e817e8dc8d2288f3c25a8df0cc016a1e"}},{"ruleId":"D2","level":"warning","message":{"text":"LogbookEventRecorder._recordConstructionDockUpdate (cognitive 33): LogbookEventRecorder._recordConstructionDockUpdate has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (27 pts), ternaries 3 (4 pts), boolean chains 1, loops 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/src/logbook/logbook_event_recorder.dart"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e5bc25a1d3e5c098cd2def79dc5bc754e6fbf5d7d1cd9cd937b84329a8f846"}},{"ruleId":"D2","level":"warning","message":{"text":"BackgroundGameRetentionCoordinator._drain (cognitive 33): BackgroundGameRetentionCoordinator._drain has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (26 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/background_game_retention_controller.dart"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2052478d9a68e32d8f0384e98272f17a3a720abad6a2e737682981c64ef523c5"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeGameWebViewEvent.decode (cognitive 32): NativeGameWebViewEvent.decode has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (4 pts), ternaries 2 (3 pts), boolean chains 2, match/switch 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/src/browser/native_game_webview_contract.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc992b02774abb90900d08a1978dadb649737ff27b2605f3e55e8c9881a693db"}},{"ruleId":"D2","level":"warning","message":{"text":"_BattleResultWarningOverlayState._showWarningDialog (cognitive 32): _BattleResultWarningOverlayState._showWarningDialog has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 13, if/else 8 (9 pts), ternaries 9, 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/src/capture/battle_result_warning_overlay.dart"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"213da286d55c57bda008ed65cf3ed44353e02e626be017c8cefde93c331e25d9"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceContextHeader.build (cognitive 32): WorkspaceContextHeader.build has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (21 pts), ternaries 5 (10 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/layout/workspace_context_header.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bb2bfb83d2d28c43fc82d11c4f6e6b4b1a1681f8bd1518c4456665a902f12c"}},{"ruleId":"D2","level":"warning","message":{"text":"_SenkaCalendarViewState._cell (cognitive 32): _SenkaCalendarViewState._cell has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 21, boolean chains 10, 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/src/senka/senka_calendar_view.dart"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bbf2cff99f22e577762054cf477f2fe3831c0dea01be0d31970e15d8908b34"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModsController._readProgress (cognitive 32): GameModsController._readProgress has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 15, if/else 7 (14 pts), error handling 3 (nesting depth added 7). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_controller.dart"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bdff22a002175dfba1609280c7e3d2f422dba6af8e3b8e3d223860f9290f84"}},{"ruleId":"D2","level":"warning","message":{"text":"AccountSession.accept (cognitive 31): AccountSession.accept has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 6, ternaries 2 (4 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/src/account/account_session.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"244107a2a8a4190ab96d8063147d3e35cf933e4fb70715fb3f0695bcf8928306"}},{"ruleId":"D2","level":"warning","message":{"text":"GameAudioController._reconcileNative (cognitive 31): GameAudioController._reconcileNative has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 6, error handling 2 (4 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/src/audio/game_audio_controller.dart"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"df22491fab6adf01bd9ca79c1a0b915d05ce518d9caff6e6864196639212b89b"}},{"ruleId":"D2","level":"warning","message":{"text":"BattleDetailReplayBuilder._parseTorpedo (cognitive 31): BattleDetailReplayBuilder._parseTorpedo has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 6 (11 pts), boolean chains 5, 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/src/battle/battle_detail_replay_builder.dart"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1a2d13eb252caf50d3f0a42aef68efd1e55945ff5554980827c898682147b3"}},{"ruleId":"D2","level":"warning","message":{"text":"_PoiBattleSimulator._rank (cognitive 31): _PoiBattleSimulator._rank has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 5, ternaries 2 (5 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/src/battle/prediction/poi/poi_battle_prediction_engine.dart"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d7b1b10677b1e73bc76f15de057534abc468186d1e75a58f853503d42d399b"}},{"ruleId":"D2","level":"warning","message":{"text":"_ShipRow.build (cognitive 31): _ShipRow.build has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 10 (12 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_information_center.dart"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ecf7fe39b566fad82dcdf9a4aab4f72f3b178e194fcd65c89c51efbdbb93da"}},{"ruleId":"D2","level":"warning","message":{"text":"_FleetMetricsStrip.build (cognitive 31): _FleetMetricsStrip.build has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 16 (18 pts), boolean chains 9, if/else 2 (3 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/src/toolbox/composition_image_card.dart"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b3fa9780d99d300cbff0542b99941a7deb4def80cbd7748292197b82b0d393"}},{"ruleId":"D2","level":"warning","message":{"text":"FileSortieMapCatalogStore.installArchive (cognitive 31): FileSortieMapCatalogStore.installArchive has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (24 pts), error handling 2 (5 pts), loops 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/sortie_map_catalog_store.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"68544044dd6250701dc9c5911976afe1fada16d0283bb1420c5ccfee2263532c"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModRepository.openResource (cognitive 31): GameModRepository.openResource has cognitive complexity 31 (threshold 15). Drivers by points: if/else 22, boolean chains 5, error handling 3, match/switch 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModRepository.kt"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"1022e4e51871396b48ca9e0ee57a7f7eed5d5a03bf2f7a3f55238c2485bb9cd2"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeGameDialogActions.onLayout (cognitive 31): NativeGameDialogActions.onLayout has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (28 pts), loops 2, 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameDialogLayout.kt"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a5f29a2e6ef5778101ba377e3adcd09c94269649d5317567ee25ab04f51504"}},{"ruleId":"D2","level":"warning","message":{"text":"AndroidCaptureEvent.decode (cognitive 30): AndroidCaptureEvent.decode has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 18, if/else 9, ternaries 2, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/game_capture_port.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a64cf8a8b00ac72781b909563061b28a965fc799340489557e53e9c1faa1968"}},{"ruleId":"D2","level":"warning","message":{"text":"_ResourceTrendPageState.build (cognitive 30): _ResourceTrendPageState.build has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 10 (15 pts), boolean chains 6, if/else 4 (5 pts), loops 2, 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/src/fleet/resource_trend_page.dart"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39f090f9555fd4de4722d84afc081250d1a963b222ce6eade9ba8ac04b2b929"}},{"ruleId":"D2","level":"warning","message":{"text":"_NativeActivityGameSurfaceState._finishPage (cognitive 30): _NativeActivityGameSurfaceState._finishPage has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (25 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/native_activity_game_surface.dart"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cada86001ec946595788bd15135921402a7c4c50eac744e12c95b0c2bf8b2e0"}},{"ruleId":"D2","level":"warning","message":{"text":"GameInfoNoticeController._handleFleetReadiness (cognitive 30): GameInfoNoticeController._handleFleetReadiness has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 9, ternaries 6 (8 pts), 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/src/notice/game_info_notice_controller.dart"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b0d33c448ecabc7e2e5755f2dbc8385a5921a5820a4192509b36de75e1d6c8"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestProgressEngine._migrateRecord (cognitive 30): QuestProgressEngine._migrateRecord has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 15, ternaries 8 (10 pts), if/else 3, loops 2 (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/src/quest/quest_progress_engine.dart"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"7586bc23e2b30807b87d75c37f5b6eaab8ab35dc5047386f5f8f126c6922b2c8"}},{"ruleId":"D2","level":"warning","message":{"text":"_GameModsPageState._scanLibrary (cognitive 30): _GameModsPageState._scanLibrary has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 5, loops 2, ternaries 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b2888b7ed41ae72194883ff9656ae51993c687ac35be2af7e7575d6d7b5c38"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModsStrings.resourceLabel (cognitive 30): GameModsStrings.resourceLabel has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 8 (10 pts), boolean chains 3, match/switch 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/src/toolbox/game_mods/game_mods_strings.dart"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"378f3f4079461f89f9a9205f3320b42c90b7f6fb9bcd0ab0782591944c909955"}},{"ruleId":"D2","level":"warning","message":{"text":"FixedCanvasScaleApplier.apply (cognitive 30): FixedCanvasScaleApplier.apply has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (17 pts), error handling 7 (8 pts), boolean chains 4, match/switch 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/FixedCanvasScaleApplier.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4800ba3bc2fe2667e90ddfd53074ed9755ded664ef41e155c07557242492fd02"}},{"ruleId":"D2","level":"warning","message":{"text":"KanxyHttpProxyMonitor.setProxy (cognitive 30): KanxyHttpProxyMonitor.setProxy has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 5, match/switch 1 (4 pts), loops 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/KanxyHttpProxyMonitor.kt"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfda623d9d78144755e9ed4e971e670494ff9badb81a38a795e41ee416d39909"}},{"ruleId":"D2","level":"warning","message":{"text":"AkashiFetcher.fetch (cognitive 29): AkashiFetcher.fetch has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 6, 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":"tool/akashi_bonus/lib/fetcher.dart"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1cb6ec9f20db5099421bb27343e53bf66e0f39b98d1fc99b301e9460888c9f"}},{"ruleId":"D2","level":"warning","message":{"text":"_BattleResultWarningOverlayState._showAdvanceWarning (cognitive 29): _BattleResultWarningOverlayState._showAdvanceWarning has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 12, error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/battle_result_warning_overlay.dart"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fbcc677fc5bd18bd30768295947ee94d887687282b2faa2f08a7a4caa5dff3"}},{"ruleId":"D2","level":"warning","message":{"text":"LandBaseAirGroupRow.build (cognitive 29): LandBaseAirGroupRow.build has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 11 (16 pts), if/else 9 (11 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/src/fleet/land_base_summary_card.dart"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"feba058d75bc9bf413398cc08bb362b78473add012b6bdb58f46829db6b9d7a6"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactResourceBarState._buildGrid (cognitive 29): CompactResourceBarState._buildGrid has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 5 (9 pts), loops 5 (8 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/resource_grid.dart"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc46baa9242506765a97cc7fc6bf8f7b514213515aac137d644277312fffd0c"}},{"ruleId":"D2","level":"warning","message":{"text":"ShipMoraleMark.build (cognitive 29): ShipMoraleMark.build has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 12 (24 pts), if/else 4, 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/src/fleet/ship_status_visuals.dart"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"aadf6daf3af187e9a4c72ba652cbf7316388090ede4c6cdf3e93e09b6a366283"}},{"ruleId":"D2","level":"warning","message":{"text":"_LogbookExperiencePageState._load (cognitive 29): _LogbookExperiencePageState._load has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 6 (10 pts), boolean chains 7, 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/src/logbook/logbook_experience_page.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"862b860a8fff78d236a21174892d356127cd5b9965d343230f010092715f0930"}},{"ruleId":"D2","level":"warning","message":{"text":"SenkaController._restore (cognitive 29): SenkaController._restore has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 8, ternaries 3 (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/src/senka/senka_controller.dart"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3e2baec4b6220d7fbc0dbb4a7d18970e24828a2390fd01410de9fa0519639b"}},{"ruleId":"D2","level":"warning","message":{"text":"SenkaReducer.reduce (cognitive 29): SenkaReducer.reduce has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 8, 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/src/senka/senka_reducer.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e0b7e60c85054053e78da29a7bae116ed120695b927ff1a9ea69839a81ef1b"}},{"ruleId":"D2","level":"warning","message":{"text":"ShipSubtitleNameCatalog.shipName (cognitive 29): ShipSubtitleNameCatalog.shipName has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 4 (6 pts), boolean chains 3, ternaries 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_name_catalog.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1e7738132a7a71bafdb7841974cbbd14fd4c5c522281fe660c7f96af8fbd1e"}},{"ruleId":"D2","level":"warning","message":{"text":"RecordBackupHandler.onMethodCall (cognitive 29): RecordBackupHandler.onMethodCall has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 5 (10 pts), match/switch 2 (3 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/RecordBackupHandler.kt"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e719a662584f53949f0e21a5f3bbe64c91f0b7731e4fc4df6e0813019d83b5"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModArchive.checkCentralDirectory (cognitive 29): GameModArchive.checkCentralDirectory has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 8, 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModArchive.kt"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a067d438528614586191fd1901f9777e1c4c4c71553a824cd69214e5ce6c00b1"}},{"ruleId":"D2","level":"warning","message":{"text":"BattleController.accept (cognitive 28): BattleController.accept has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 10, 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/src/battle/battle_controller.dart"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0406bb21a6fa8498f0f39d5c42c60e6b5d8c3a6e2a681d22a93623cd0fbbc18"}},{"ruleId":"D2","level":"warning","message":{"text":"AnchorageRepairCalculator.project (cognitive 28): AnchorageRepairCalculator.project has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 16, ternaries 9, loops 2, 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/src/fleet/anchorage_repair_calculator.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef205d61055d08fc044027ba879ab03a33a4772b6d7fcf39622f9fd171d3362"}},{"ruleId":"D2","level":"warning","message":{"text":"GameStateReducer.reduce (cognitive 28): GameStateReducer.reduce has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 18, if/else 2 (4 pts), ternaries 2 (3 pts), loops 1 (2 pts), match/switch 1 (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/src/game_state/game_state_reducer.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8060411107ca12164c546f3fce82b30edaf50cce048bd1c0dfad0efa305574"}},{"ruleId":"D2","level":"warning","message":{"text":"_GameWebViewState._applyGamePresentation (cognitive 28): _GameWebViewState._applyGamePresentation has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 6, match/switch 1 (2 pts), ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_webview.dart"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e5b5ca6de895bed8573cb1678bb9888e318b89848407bfa7a32995de4a2d18"}},{"ruleId":"D2","level":"warning","message":{"text":"_CameraAvoidanceViewportState.build (cognitive 28): _CameraAvoidanceViewportState.build has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 12, if/else 5 (8 pts), ternaries 6 (8 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/src/layout/camera_avoidance.dart"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"894ec2662f6d519417de9e3ee81f97a7cc9e1b03bdc73d6fd1dbb611dded5c78"}},{"ruleId":"D2","level":"warning","message":{"text":"_BattleDetailPageState._process (cognitive 28): _BattleDetailPageState._process has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 7 (11 pts), if/else 4 (7 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/battle_detail_page.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e28b34a242c9d099220560a6f8d5a06e3d5ad963a404650d5eccfefb55e854"}},{"ruleId":"D2","level":"warning","message":{"text":"LogbookDatabase._validateBackupSnapshot (cognitive 28): LogbookDatabase._validateBackupSnapshot has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 5 (11 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/src/logbook/logbook_database.dart"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c2c7ac8ff753f1e742b070825f61900f14664b786450c72332a4d0eec55446"}},{"ruleId":"D2","level":"warning","message":{"text":"GameInfoNoticeController._handleDevelopment (cognitive 28): GameInfoNoticeController._handleDevelopment has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 2 (5 pts), boolean chains 2, loops 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/src/notice/game_info_notice_controller.dart"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c64526d4b89a83f365f3bdf37fc9f1a754fce821bbe2753f8fe2f5a9e90ad1"}},{"ruleId":"D2","level":"warning","message":{"text":"PinnedQuestsSummary.build (cognitive 28): PinnedQuestsSummary.build has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 9 (20 pts), if/else 3 (4 pts), boolean chains 2, 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/src/quest/pinned_quests_summary.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68bba683fce3017c779aa334c2b091a5280648b0dc0be819ca46a3ae7a18e2f"}},{"ruleId":"D2","level":"warning","message":{"text":"_NodeDetailPanel.build (cognitive 28): _NodeDetailPanel.build has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 8 (15 pts), if/else 7 (8 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/src/toolbox/sortie_map_query/sortie_map_query_page.dart"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b5e8653116355fca8761eb5f4b55b5c00746ba87aa47898a0a4f00a23ae6db"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModCoordinateEndpoint.open (cognitive 28): GameModCoordinateEndpoint.open has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 8, 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModCoordinateEndpoint.kt"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11e292cba591c1ad5ae897504625cc4a6e555002638d6917bb6c6197b084eed"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModRepository.commitLibraryImport (cognitive 28): GameModRepository.commitLibraryImport has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 7, error handling 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModRepository.kt"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed1c52deea53e77a3d5157ddb078d05fd3c628af02d8dc7dc745dad5e968879"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceNavigation.build (cognitive 27): WorkspaceNavigation.build has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 16 (19 pts), if/else 3 (4 pts), match/switch 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/main.dart"},"region":{"startLine":4004}}}],"partialFingerprints":{"codehealthFindingId/v1":"815ea408452520ab224eb12dd27f764f06e1687adaa782489ca1f34c6debed9c"}},{"ruleId":"D2","level":"warning","message":{"text":"BattleController._reduce (cognitive 27): BattleController._reduce has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 4, 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/src/battle/battle_controller.dart"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00b8572298213f5763a3e4eb5c4e2203270fd6095d0438d01cd405e07f9bfe5"}},{"ruleId":"D2","level":"warning","message":{"text":"BattleShipDetails.enemy (cognitive 27): BattleShipDetails.enemy has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 2 (3 pts), ternaries 3, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_ship_details.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d1d463df32f3998a21fb885694608a855bf97e93976f8a195a0210425c770c"}},{"ruleId":"D2","level":"warning","message":{"text":"_PoiBattleSimulator._support (cognitive 27): _PoiBattleSimulator._support has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, loops 2 (4 pts), ternaries 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/src/battle/prediction/poi/poi_battle_prediction_engine.dart"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c2a2fcf7c9263f4d168ed54ebe401cd8b67dcb73e18eeabcf483c87be7ef90"}},{"ruleId":"D2","level":"warning","message":{"text":"GameFrameRatePolicy.completeWindow (cognitive 27): GameFrameRatePolicy.completeWindow has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 8, ternaries 3 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/game_frame_rate_policy.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a209ce0e2927c5f816a247fb17b05cca0c91228abc76079a53c28304a0f5080"}},{"ruleId":"D2","level":"warning","message":{"text":"_RepairCapsule.build (cognitive 27): _RepairCapsule.build has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 8 (15 pts), if/else 7 (9 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/src/fleet/repair_summary_card.dart"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f671398eeb033d0eb904d1aa321b30a4ad2a09c7bb69a94f6842b0cc9f08b7"}},{"ruleId":"D2","level":"warning","message":{"text":"_SortiePanel.build (cognitive 27): _SortiePanel.build has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 20, 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/src/senka/senka_info_view.dart"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90d19c6a0d2103d08e98031fc9f40908873dbab88d2c5689fc4420162200186"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetDisplaySettingsSection.build (cognitive 27): FleetDisplaySettingsSection.build has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 7 (12 pts), if/else 6 (8 pts), boolean chains 4, 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/src/settings/fleet_display_settings_section.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5447e8b0459de80064c815a4d25a2bfdbe7356e3482f2cbe7438469d6306bf"}},{"ruleId":"D2","level":"warning","message":{"text":"SortieExperienceController._settle (cognitive 27): SortieExperienceController._settle has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 6, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_experience_controller.dart"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3783b83e9caef7c8784874931ff6f22ad867ddc089e20744875922cac00dc1"}},{"ruleId":"D2","level":"warning","message":{"text":"_CompositionImagePageState._controls (cognitive 27): _CompositionImagePageState._controls has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 7 (10 pts), if/else 6, loops 4 (5 pts), boolean chains 4, match/switch 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/composition_image_page.dart"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7569856828144df926950073887c35db1d03fd94eaa89a6ed90b626c54987b9"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeGameWarningDialogChannel.renderChecklist (cognitive 27): NativeGameWarningDialogChannel.renderChecklist has cognitive complexity 27 (threshold 15). Drivers by points: if/else 23, boolean chains 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogChannel.kt"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e4424c2af9c9649d075b3ee27881c0bb04a35857ca003594316a22702ef502"}},{"ruleId":"D2","level":"warning","message":{"text":"ship_subtitles.bridge.onmessage (cognitive 27): ship_subtitles.bridge.onmessage has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 6, error handling 1 (nesting depth added 7). Of this number, 24 points are the body\u0027s own statements and 3 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":"assets/scripts/ship_subtitles.js"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe851d0f846e287ad5bc08937914c0d2d6713ae62878e8ef4da25ad73d9ef759"}},{"ruleId":"D2","level":"warning","message":{"text":"FcdMapDataset.parse (cognitive 26): FcdMapDataset.parse has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/fcd_map_dataset.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04dd1cd1006f8faa456ba2f378ce09ed72a024cec6aac7cdb5035fdd15c3097"}},{"ruleId":"D2","level":"warning","message":{"text":"_SortieMapSectionState.build (cognitive 26): _SortieMapSectionState.build has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 10 (12 pts), boolean chains 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/sortie_map_section.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca139419c8b35b1290673428e0991668ca9186b6cf974e62171c5fe661580cfa"}},{"ruleId":"D2","level":"warning","message":{"text":"GameStateReducer.projectFleetBattleDisplay (cognitive 26): GameStateReducer.projectFleetBattleDisplay has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 9, loops 2 (3 pts), ternaries 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/src/game_state/game_state_reducer.dart"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"2908b056648a7d6b6a06630e52427e82ef5b95d5c06b9ae8f17c8a61efdd24d7"}},{"ruleId":"D2","level":"warning","message":{"text":"_GameWebViewState.initState (cognitive 26): _GameWebViewState.initState has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 12, if/else 11 (12 pts), ternaries 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/src/game_webview.dart"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"beaca9199c6013d49b92953401cb05d688833a047794d330f7d080f657bedbf3"}},{"ruleId":"D2","level":"warning","message":{"text":"ShipEquipmentCompatibilityProjection.groups (cognitive 26): ShipEquipmentCompatibilityProjection.groups has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 9, loops 2, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/ship_equipment_compatibility_projection.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"970f92abee4224d66160fdff4af0fae3b2844fe4e2f70de2f04f407e36ef9e33"}},{"ruleId":"D2","level":"warning","message":{"text":"_LogbookTablePageState._refreshLatest (cognitive 26): _LogbookTablePageState._refreshLatest has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, loops 1 (3 pts), ternaries 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/src/logbook/logbook_page.dart"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef515b5bdc2e0deb5c07e4430e797d55ab2e9607c7e7929c48add2718a60350"}},{"ruleId":"D2","level":"warning","message":{"text":"SortieResourceLedger._recordRepair (cognitive 26): SortieResourceLedger._recordRepair has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 16, if/else 6 (7 pts), ternaries 3 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_resource_ledger.dart"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"809f97c3a5fe451033564c467772d9f9415ece19d7fcd6413fa01c62f8e3c15d"}},{"ruleId":"D2","level":"warning","message":{"text":"AndroidGameFrameReloadBridge.onPostMessage (cognitive 26): AndroidGameFrameReloadBridge.onPostMessage has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, error handling 2 (4 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFrameReloadBridge.kt"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f4edba25510b3fdb1a1ce89067f60d3ad941c1c7bf75c7446b79635a44d0be"}},{"ruleId":"D2","level":"warning","message":{"text":"_ShipPopoverState.build (cognitive 25): _ShipPopoverState.build has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 8, loops 2 (4 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_ship_details_popover.dart"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80bd25af8a1b996dea545480efdce81f2b112b6ea26eea5f4a9096642ba472b"}},{"ruleId":"D2","level":"warning","message":{"text":"GameResourceCacheController._initialize (cognitive 25): GameResourceCacheController._initialize has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (24 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/src/browser/game_resource_cache_controller.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fa594e1d2b16791a4e71b9b589e8e31b5bf5aa1af5a99167d2fd2706c92af2"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpeditionStrings.expeditionAreaName (cognitive 25): ExpeditionStrings.expeditionAreaName has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 11 (21 pts), boolean chains 2, match/switch 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_strings.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a71402cbc0726d37607a24f38c752cadbdc86631013ead1ac63b363fe9ef458"}},{"ruleId":"D2","level":"warning","message":{"text":"ImprovementRawBundle._validate (cognitive 25): ImprovementRawBundle._validate has cognitive complexity 25 (threshold 15). Drivers by points: loops 8 (11 pts), if/else 4 (10 pts), ternaries 1 (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/src/improvement/improvement_raw_bundle.dart"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"016185c1c914bb4f4041ab8a346c05521d526c1d08ea48c579cc9a610ae64f2a"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestProgressUpdateService.checkAndUpdate (cognitive 25): QuestProgressUpdateService.checkAndUpdate has cognitive complexity 25 (threshold 15). Drivers by points: error handling 5 (10 pts), if/else 5 (10 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_progress_update_service.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1afbb07f055f8475f18815ed1cf3d508ba8b22565aa83ca6f705e4ea924b6c"}},{"ruleId":"D2","level":"warning","message":{"text":"_CompositionImagePageState._loadRecords (cognitive 25): _CompositionImagePageState._loadRecords has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 8, ternaries 2 (5 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/src/toolbox/composition_image_page.dart"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"841f9dc83cd86e7e03daabbb6e2c316d01c9ff7dadb448bdcc8f49ddecbe3b4a"}},{"ruleId":"D2","level":"warning","message":{"text":"_ExpCalcPageState._loadCatalog (cognitive 25): _ExpCalcPageState._loadCatalog has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 3, ternaries 1 (3 pts), loops 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/src/toolbox/exp_calc/exp_calc_page.dart"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"58714f48f9d282e3bf8a5fe389fcf4ef1b5f91d576ebd5c8b759850dbf029d2c"}},{"ruleId":"D2","level":"warning","message":{"text":"_GameModsPageState.build (cognitive 25): _GameModsPageState.build has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 9 (12 pts), if/else 6, boolean chains 5, loops 1, 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/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8684689fa4b03e08ccca6482bffb2c5a9a7e1c2f91fcdbc90a15dcd011d496"}},{"ruleId":"D2","level":"warning","message":{"text":"_GameModsPageState._libraryPanel (cognitive 25): _GameModsPageState._libraryPanel has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 10 (12 pts), if/else 7, boolean chains 5, 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/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf8d3c6084882238731267884fff93b1c5dad9ec519b214dfa8ffb6f5d89408"}},{"ruleId":"D2","level":"warning","message":{"text":"RecordBackupHandler.handleSaveResult (cognitive 25): RecordBackupHandler.handleSaveResult has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (16 pts), error handling 3 (4 pts), boolean chains 3, 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/RecordBackupHandler.kt"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abcb3e83c25bed7245a0e714ca5a3d933080ef2108b562dda2b9a2c65ccec0a"}},{"ruleId":"D2","level":"warning","message":{"text":"AndroidGameFrameReloadBridge.reloadWhen (cognitive 25): AndroidGameFrameReloadBridge.reloadWhen has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 3, loops 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFrameReloadBridge.kt"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"629e9353d7e10fc1469eadc2567a71ec3c0f6e3fb80e5ab5d3b3abc2a34c04b6"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModCoordinateParser.ini (cognitive 25): GameModCoordinateParser.ini has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 7, 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModCoordinateParser.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c01e616d2735c4cce53d914f03c14f47d398b43b5ee43ef375246fa9d1e1e18"}},{"ruleId":"D2","level":"warning","message":{"text":"GameAudioController.toggleMuted (cognitive 24): GameAudioController.toggleMuted has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 3 (8 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/audio/game_audio_controller.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c664d8c508de83c291b87405779787003c5fcb13cb380830c0ae4b53520d9224"}},{"ruleId":"D2","level":"warning","message":{"text":"AndroidBackupDocumentPort.readLive (cognitive 24): AndroidBackupDocumentPort.readLive has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 3 (6 pts), boolean chains 2, 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/src/backup/record_backup.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cba8c39fda484bd9167161dde71bdc17ab783c786bfe1c82cdc81a0144d0416"}},{"ruleId":"D2","level":"warning","message":{"text":"GameResourceManifestConsumer._rebuild (cognitive 24): GameResourceManifestConsumer._rebuild has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 12, if/else 10 (12 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/src/browser/game_resource_manifest_consumer.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"143987b32bada17f7b6cb7b4d6587cbb5c35bf0fa5c682da1693ba4ae4cb959e"}},{"ruleId":"D2","level":"warning","message":{"text":"_FleetInformationCenterState.build (cognitive 24): _FleetInformationCenterState.build has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, match/switch 1 (2 pts), ternaries 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_information_center.dart"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cafad32b48332de40744e7f67d60ce1cbf41379c59106a3962d1fd49200d44"}},{"ruleId":"D2","level":"warning","message":{"text":"_MetricsBar.build (cognitive 24): _MetricsBar.build has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 9, ternaries 7, if/else 4 (5 pts), match/switch 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/src/fleet/fleet_information_center.dart"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfb8546becf70845da14d394b101bfb56032948fc38d721e5d4a02c04ee60d8"}},{"ruleId":"D2","level":"warning","message":{"text":"GameStateReducer._selectEventMapRank (cognitive 24): GameStateReducer._selectEventMapRank has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 6 (13 pts), boolean chains 6, if/else 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/src/game_state/game_state_reducer.dart"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d18bccb360aaeb4b7a1747709e6eceed0d2da80252b404fafe2952dd69efb7"}},{"ruleId":"D2","level":"warning","message":{"text":"LogbookEventRecorder._recordConstruction (cognitive 24): LogbookEventRecorder._recordConstruction has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 8, ternaries 2 (3 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_event_recorder.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc4046414db122687bdd5bbc1bfc192148bbad10f21409eba8b286410005fd1"}},{"ruleId":"D2","level":"warning","message":{"text":"ShipSubtitleUpdateService._checkKc3 (cognitive 24): ShipSubtitleUpdateService._checkKc3 has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 4 (7 pts), boolean chains 6, error handling 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/src/subtitles/ship_subtitle_update_service.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"877dda9a53488e45f0ad6e6b4c242ef068f9d6defa7c5d51aa73b2e1d240da6d"}},{"ruleId":"D2","level":"warning","message":{"text":"_SortieMapQueryPageState._buildCatalog (cognitive 24): _SortieMapQueryPageState._buildCatalog has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 9, ternaries 8 (9 pts), if/else 4 (5 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/sortie_map_query_page.dart"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"663a446efbeeac2151566658d51d8de0476ddc43fdc90192cee4407eebabbb86"}},{"ruleId":"D2","level":"warning","message":{"text":"BattleController._friendFleet (cognitive 23): BattleController._friendFleet has cognitive complexity 23 (threshold 15). Drivers by points: loops 4 (7 pts), ternaries 3 (7 pts), if/else 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/src/battle/battle_controller.dart"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c81cef5784e61d59fdbcaf0b7baf70f24f257aede802b0fe907ab9c909b0891"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodChannelGameResourceCachePort.setManifest (cognitive 23): MethodChannelGameResourceCachePort.setManifest has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), error handling 1 (3 pts), loops 1 (2 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/src/browser/game_resource_cache_channel.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9892df9505e57bda3939174c99d62674a41a6e4007a4602e160c8dd4f52f6fe"}},{"ruleId":"D2","level":"warning","message":{"text":"_BattleResultWarningOverlayState._onGameCaptureUpdate (cognitive 23): _BattleResultWarningOverlayState._onGameCaptureUpdate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 7, 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/battle_result_warning_overlay.dart"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"e178b60f837055056fdad583ee0c0375efe66406d7d34e2854ace53a35cb598f"}},{"ruleId":"D2","level":"warning","message":{"text":"ImprovementRawBundle.normalize (cognitive 23): ImprovementRawBundle.normalize has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 7, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/improvement/improvement_raw_bundle.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e3a0fb90d5250b9414802a4d446fb3193ac3c130806da4a08f421ed6bb02f6"}},{"ruleId":"D2","level":"warning","message":{"text":"KcwikiReportCollector.accept (cognitive 23): KcwikiReportCollector.accept has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/kcwiki_report/kcwiki_report_collector.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fbdda9caa45d4adaa9d5c91d63c183ac52b7b9d4cc0b91f3e3937b2ac08b7b"}},{"ruleId":"D2","level":"warning","message":{"text":"ShipSubtitleCatalogController._performResourceCheck (cognitive 23): ShipSubtitleCatalogController._performResourceCheck has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 3 (6 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_catalog_controller.dart"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a442bd0df647d84cd3e92b70f731dc261183b2b211721ee7f347a7bfc0f5b1"}},{"ruleId":"D2","level":"warning","message":{"text":"_MarqueeTextState.build (cognitive 23): _MarqueeTextState.build has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 6 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/widgets/marquee_text.dart"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cc5a946843fc5e579f192617ac03c44118ff96cef0def002dc0a041ff3159b"}},{"ruleId":"D2","level":"warning","message":{"text":"GameFullscreenChannel.onMethodCall (cognitive 23): GameFullscreenChannel.onMethodCall has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), error handling 4 (7 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFullscreenChannel.kt"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4322cd9fc0c1c480a198c78100c6f229819c87aa63d39bb48980d06f89618908"}},{"ruleId":"D2","level":"warning","message":{"text":"AppNotificationManager.bindItem (cognitive 23): AppNotificationManager.bindItem has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 6, match/switch 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, 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/notification/AppNotificationManager.kt"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1720cf4f58c1c9ad60fe69415b7c4ee4a58376b1e6fc48fbc52a05d029816c"}},{"ruleId":"D2","level":"warning","message":{"text":"NotificationAlarmReceiver.deliverCurrentAlarm (cognitive 23): NotificationAlarmReceiver.deliverCurrentAlarm has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (18 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/notification/NotificationAlarmReceiver.kt"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ab40359534f9e70369231926239ad6d6c369c16ebf1740daf047b9f450ec25"}},{"ruleId":"D2","level":"warning","message":{"text":"build_enemy_catalog._resolve_alias (cognitive 23): build_enemy_catalog._resolve_alias has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 4 (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":"tool/build_enemy_catalog.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b59f4fca910ebde9d38f482f23cc90acd5db8fca1d070964b5f19376a770ea"}},{"ruleId":"D2","level":"warning","message":{"text":"check_repository_hygiene.findings (cognitive 23): check_repository_hygiene.findings has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, loops 2 (3 pts), error handling 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":"tool/check_repository_hygiene.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"140262736befbd2d05dd66e189178bb8a565f344ed5741cd061242effb6f0038"}},{"ruleId":"D2","level":"warning","message":{"text":"BattleController._updateSortieMapProgress (cognitive 22): BattleController._updateSortieMapProgress has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (8 pts), ternaries 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/src/battle/battle_controller.dart"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"20392c611f2387c71402389fcdde046428a9eaf02bf7e569ebd2528ca46c93e9"}},{"ruleId":"D2","level":"warning","message":{"text":"_GameBrowserMenu.build (cognitive 22): _GameBrowserMenu.build has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 8 (12 pts), if/else 7, 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/game_browser_menu.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"244f90972aef1b722ec529ff15c067e0b80be0c0b06c5e481158b6dc71590b36"}},{"ruleId":"D2","level":"warning","message":{"text":"KanxyGameRoute._reloadIfNeeded (cognitive 22): KanxyGameRoute._reloadIfNeeded has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 6, ternaries 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/src/browser/kanxy_game_route.dart"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73de8318f08484b5ad265205ca525be0be112ebb7a62c8485e59604bef73f00"}},{"ruleId":"D2","level":"warning","message":{"text":"GameStateReducer._snapshot (cognitive 22): GameStateReducer._snapshot has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 21, 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/src/game_state/game_state_reducer.dart"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e59ccd40caf91e1b77342759a8b507ac6e1067ecc8e8d90b5aaa15e2d48a66"}},{"ruleId":"D2","level":"warning","message":{"text":"_NativeActivityGameSurfaceState._drainCaptureReconfiguration (cognitive 22): _NativeActivityGameSurfaceState._drainCaptureReconfiguration has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/native_activity_game_surface.dart"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac60db05583b94d44153f7a660a3bad30f10c08c2d5aacf6afb921b69f57026"}},{"ruleId":"D2","level":"warning","message":{"text":"GameInfoNoticeController._handleExpeditionStart (cognitive 22): GameInfoNoticeController._handleExpeditionStart has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 7, loops 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/src/notice/game_info_notice_controller.dart"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb22d2bf3057f1562863c6dc6ee5937718c9ed3b157c4bfc47164aeed7c1d3bf"}},{"ruleId":"D2","level":"warning","message":{"text":"GameNotificationCoordinator._captureManualCompletionTasks (cognitive 22): GameNotificationCoordinator._captureManualCompletionTasks has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 5 (10 pts), boolean chains 6, if/else 2 (4 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notification/game_notification_coordinator.dart"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13d081128dbba587c1751148d6adfb1c18eb137c9c26df2c05055612da284bd"}},{"ruleId":"D2","level":"warning","message":{"text":"_QuestCompletionHeaderSlotState._canDisplayMessage (cognitive 22): _QuestCompletionHeaderSlotState._canDisplayMessage has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 18, 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/src/quest/quest_completion_drawer.dart"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba6f90046f1a0f6f011b99dd8da64a9921d3644cecf97f73110490b6a4395da"}},{"ruleId":"D2","level":"warning","message":{"text":"FileShipSubtitleResourceStateStore.load (cognitive 22): FileShipSubtitleResourceStateStore.load has cognitive complexity 22 (threshold 15). Drivers by points: error handling 3 (6 pts), ternaries 2 (6 pts), boolean chains 4, if/else 2 (4 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_resource_state.dart"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e23f96bf5b6c6e77c3d349214b969e82dbb6d8ccdc747b404ee12fc8c90cb0f"}},{"ruleId":"D2","level":"warning","message":{"text":"_LandBaseCard.build (cognitive 22): _LandBaseCard.build has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 7 (9 pts), loops 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/src/toolbox/composition_image_card.dart"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9ffc0d46beb0384d7c1a4ca02c080e41e060d7e32ebe3970eae1f01718de5a"}},{"ruleId":"D2","level":"warning","message":{"text":"_ExpCalcPageState._compactPoint (cognitive 22): _ExpCalcPageState._compactPoint has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 8 (11 pts), if/else 6, boolean chains 4, 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/src/toolbox/exp_calc/exp_calc_page.dart"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"72967f123331becba07f777b90011f0e8d7018312f4db9601304dce9fa8ebdd4"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModLibrary.saveTree (cognitive 22): GameModLibrary.saveTree has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 3 (6 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibrary.kt"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c630905e4e22dbe3596230101b8fa38af979be6dded21704a61c469177df139"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModLibraryDefaultMigration.migrate (cognitive 22): GameModLibraryDefaultMigration.migrate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 4, error handling 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibraryDefaultMigration.kt"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad5788692f3e015173d4ee6931fec5cb83b7a641a842f23bcb1b9e4aa2d1196"}},{"ruleId":"D2","level":"warning","message":{"text":"BackupArchive._decodeWriterRowIds (cognitive 21): BackupArchive._decodeWriterRowIds has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 3 (6 pts), boolean chains 5, ternaries 1 (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/src/backup/record_backup.dart"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c859c59a634a4941b404cd4ee17e0dd7dda2dee084a27254d1d1b642b61a6a5"}},{"ruleId":"D2","level":"warning","message":{"text":"_BattleOverview.build (cognitive 21): _BattleOverview.build has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 7 (9 pts), if/else 7, loops 4, 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/src/battle/detailed_battle_panel.dart"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"211cd639215e48c7f775f2a62f7c5f0bd4d19a2860a0f67d44cb8b6d4ba694e2"}},{"ruleId":"D2","level":"warning","message":{"text":"_LiveBattleCardState.build (cognitive 21): _LiveBattleCardState.build has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 7 (11 pts), if/else 6 (8 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/live_battle_card.dart"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1cb9f9f6be1b73a7163c6d9c398bc8c246436c5271e770b12c0736f868c06b"}},{"ruleId":"D2","level":"warning","message":{"text":"_RepairSummaryCardState._buildDockSlot (cognitive 21): _RepairSummaryCardState._buildDockSlot has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 11 (15 pts), if/else 4 (5 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/src/fleet/repair_summary_card.dart"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2087203cbaa121c80331664605e73dd6921c1e93169e7a0fc6d51ce3c9a60bb"}},{"ruleId":"D2","level":"warning","message":{"text":"GameApiEventPipeline._acceptDocument (cognitive 21): GameApiEventPipeline._acceptDocument 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/src/game_state/game_api_event_pipeline.dart"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e934b2297cfc5ce04c01809e851a721a0f82a866810cceee788f7490340df46"}},{"ruleId":"D2","level":"warning","message":{"text":"_OwnedInventoryPageState._handleControllerChanged (cognitive 21): _OwnedInventoryPageState._handleControllerChanged has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 13, if/else 7, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/owned_inventory_page.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe508164d5a74998d27150d2f46a361578e69a277d7cc1c9a10fd1be44db16a"}},{"ruleId":"D2","level":"warning","message":{"text":"_AttackReport.build (cognitive 21): _AttackReport.build has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 12 (14 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/battle_detail_page.dart"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"3077dd08c1392db75c62c138b95fecbd424b7b410dcb9251618f16e9d07845f5"}},{"ruleId":"D2","level":"warning","message":{"text":"LogbookDatabase._onUpgrade (cognitive 21): LogbookDatabase._onUpgrade has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 2 (4 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/src/logbook/logbook_database.dart"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"786cc492c27c7fe7b6396238d7dd98c1d7438583aec35e249160c9671b5e2901"}},{"ruleId":"D2","level":"warning","message":{"text":"_NativeActivityGameSurfaceState._restartNetwork (cognitive 21): _NativeActivityGameSurfaceState._restartNetwork has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 3 (6 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/src/native_activity_game_surface.dart"},"region":{"startLine":1658}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f4eec2a8f753c13290f9acb9d027650e18c517aa81ce57601fb0c8f8ffe7a4"}},{"ruleId":"D2","level":"warning","message":{"text":"NewShipReminderController._shipMasterIds (cognitive 21): NewShipReminderController._shipMasterIds has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 2 (4 pts), boolean chains 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/src/new_ship/new_ship_reminder_controller.dart"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f4d4b8ca56e114161d3f6bea4fafaedcfb9e9330c63639cc4c60a6bac21390"}},{"ruleId":"D2","level":"warning","message":{"text":"SenkaReducer._inferMagic (cognitive 21): SenkaReducer._inferMagic has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 4 (5 pts), boolean chains 3, 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/src/senka/senka_reducer.dart"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5162216ab57e72cedc788b764853a4cc7fa1f9b797dd42812f63bf5b7a8065a"}},{"ruleId":"D2","level":"warning","message":{"text":"DataSettingsPage.build (cognitive 21): DataSettingsPage.build has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (19 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/data_settings_page.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fb4a4844d4d15c3ba3827b0eeb583fb60bb3b2e0327b8926adea771eb6f1a6"}},{"ruleId":"D2","level":"warning","message":{"text":"DataSettingsPage._clearCompositionRecords (cognitive 21): DataSettingsPage._clearCompositionRecords has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, 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/src/settings/data_settings_page.dart"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc260fbbec1261385679c7f016042d8175c28999c4d9aa453ce082cbf877cb30"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenAwakeController._reconcileNative (cognitive 21): ScreenAwakeController._reconcileNative has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 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/src/settings/screen_awake_controller.dart"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0e2388cb961b38e02860bad9f6ff2ed745b470f7c72877f9e41bdaa8e87fe5"}},{"ruleId":"D2","level":"warning","message":{"text":"ShipSubtitleCatalog.fromKc3Json (cognitive 21): ShipSubtitleCatalog.fromKc3Json has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 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/src/subtitles/ship_subtitle_catalog.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bee5ff608ba6b4d33ae277169a976d802b9f4b5ddf590c230bc3a3604c65d92"}},{"ruleId":"D2","level":"warning","message":{"text":"ShipSubtitleCatalog.fromJson (cognitive 21): ShipSubtitleCatalog.fromJson has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 5, 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/src/subtitles/ship_subtitle_catalog.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7710c1b688147ee558ff045774c0742ca2f2ee01aaceae88305a1c47770a3584"}},{"ruleId":"D2","level":"warning","message":{"text":"_ExpCalcPageState._battleOptions (cognitive 21): _ExpCalcPageState._battleOptions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 6, 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/src/toolbox/exp_calc/exp_calc_page.dart"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e908d890a22f4125f77145abf2f7f280c7a74cfa75d53d81956d35b37256fc"}},{"ruleId":"D2","level":"warning","message":{"text":"GameResourceCacheStore.enforcePolicy (cognitive 21): GameResourceCacheStore.enforcePolicy has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheStore.kt"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"46288aefdde5f5a07a2cc667f4bbed55d4f3dd141e40442cd809014fe7bf4a04"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModRepository.readState (cognitive 21): GameModRepository.readState has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, boolean chains 7, error handling 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModRepository.kt"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02cf35032a606186b6d0b82ab9dddd4dd1248a86b0857095a8488cefa2e7354"}},{"ruleId":"D2","level":"warning","message":{"text":"_SmokeAppState._serve (cognitive 20): _SmokeAppState._serve has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, 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":"tool/advance_warning_device_smoke/main.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e077e9b2ceeb78a35e3560b1e826dff2c9f9ff02b7007dbaf3f946c01e1e155"}},{"ruleId":"D2","level":"warning","message":{"text":"SortieDamageControlLedger.synchronize (cognitive 20): SortieDamageControlLedger.synchronize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (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/src/battle/sortie_damage_control_ledger.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e2be60ba0c660836ec2fd9e155492bde9f1fdac5ddaadcadbf3ebecb733311"}},{"ruleId":"D2","level":"warning","message":{"text":"DevelopmentDataset.fromJson (cognitive 20): DevelopmentDataset.fromJson has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 4 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/development/development_dataset.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ad6c085697c6713bdf7902efe84e20477d68740752916f1a110941cb8dfd02"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpeditionEvaluator._evaluateRequirement (cognitive 20): ExpeditionEvaluator._evaluateRequirement has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 4 (8 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_evaluator.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4773e1a787553cab5cec472b45412aaa8e33b6b93ddbf88bb919c0fde0a8511"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpeditionEvaluator._greatSuccess (cognitive 20): ExpeditionEvaluator._greatSuccess has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 3, 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/src/expedition/expedition_evaluator.dart"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93412a8c773f5a929f042759b40666227ca3f1702f31445d0e1ddc83ea14c4d"}},{"ruleId":"D2","level":"warning","message":{"text":"_ExpeditionSummaryCardState._buildExpeditionItem (cognitive 20): _ExpeditionSummaryCardState._buildExpeditionItem has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/expedition_summary_card.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e84d530d08b34896b9a12d50cd540ce044e2f3cbf5428023df42bed3ef6aa4c"}},{"ruleId":"D2","level":"warning","message":{"text":"_FleetFocusPanel.build (cognitive 20): _FleetFocusPanel.build has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 16, match/switch 1 (2 pts), if/else 1, 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/src/fleet/fleet_information_center.dart"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d74ba7298db7b05282f67393a452ea657a1a997575f51d7820cab29640f150"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactResourceBarState._gridRows (cognitive 20): CompactResourceBarState._gridRows has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 6, ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/resource_grid.dart"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a7537f833f885fa762aeb30500a7dc2e9dcd0a84990bf729e1bbcd1e529022"}},{"ruleId":"D2","level":"warning","message":{"text":"PinnedQuestsSummary._standardRow (cognitive 20): PinnedQuestsSummary._standardRow has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 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/src/quest/pinned_quests_summary.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6846b12c85307da5c609e5e23af9321969ec63356f5c72cd3113aadfa22b0a31"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestProgressEngine.qualifyingFleetIds (cognitive 20): QuestProgressEngine.qualifyingFleetIds has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_progress_engine.dart"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"303bfc542c326b0de0de5b040c32f4743aafe755d9327927285a4401f9ab2272"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestProgressEngine._project (cognitive 20): QuestProgressEngine._project has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (6 pts), boolean chains 5, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_progress_engine.dart"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"225f3a0ace0d76d19c2afb3620e8da5c7944fb913cae8ebf5c3730b355a8d7d8"}},{"ruleId":"D2","level":"warning","message":{"text":"GameConnectorSection._requestChange (cognitive 20): GameConnectorSection._requestChange has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 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/src/settings/game_connector_section.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f16e4575bf10611af84c8fbf80361f63adaad9bee0492b748a3e798087adad"}},{"ruleId":"D2","level":"warning","message":{"text":"NotificationSettings.== (cognitive 20): NotificationSettings.== 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/src/settings/notification_settings_store.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6235ee23860add05b00cefff982ca977319623ce34dedebe0e1eb8eea4434d"}},{"ruleId":"D2","level":"warning","message":{"text":"SortieResourceLedger.record (cognitive 20): SortieResourceLedger.record has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 6, if/else 3 (6 pts), loops 2 (4 pts), ternaries 2 (3 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/src/sortie_experience/sortie_resource_ledger.dart"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb6ac51943cf17fe670b67ea8b892dd04f3a176c46032816c2fb888ba3d92cc"}},{"ruleId":"D2","level":"warning","message":{"text":"SortieResourceLedger._observeRepairQuotes (cognitive 20): SortieResourceLedger._observeRepairQuotes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (6 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_resource_ledger.dart"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"f516e7a824791fcaecabccf47e9a472d23670360e971a3bd33f2c31946e75826"}},{"ruleId":"D2","level":"warning","message":{"text":"ShipSubtitleCatalogController._checkKc3Group (cognitive 20): ShipSubtitleCatalogController._checkKc3Group has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 2 (3 pts), loops 1 (2 pts), match/switch 1 (2 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/src/subtitles/ship_subtitle_catalog_controller.dart"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"f652f7198297cf708762e09bc95894c9bf87e4a1fa18945c333d229df791686b"}},{"ruleId":"D2","level":"warning","message":{"text":"ShipSubtitleKc3UpdateService.checkAndUpdate (cognitive 20): ShipSubtitleKc3UpdateService.checkAndUpdate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 3 (6 pts), error handling 2 (3 pts), 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/src/subtitles/ship_subtitle_kc3_update_service.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdd05d00d9e97874fad8aa253d53fcb1861f08a2e4d2eecd5fb487dc51b9d90"}},{"ruleId":"D2","level":"warning","message":{"text":"ShipSubtitleSettingsSection.build (cognitive 20): ShipSubtitleSettingsSection.build has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (5 pts), 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/src/subtitles/ship_subtitle_settings_section.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d025b07254a4c47a9c0a7029dde2459648a5adbe5baa80c754a2b4dc0354aac3"}},{"ruleId":"D2","level":"warning","message":{"text":"AppTelemetryService.start (cognitive 20): AppTelemetryService.start has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 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/src/telemetry/telemetry_service.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"2564cf9cf27f5099343ea2360ba329f97f4078e0524bd3e4c09e06cfe94dc2c0"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModsController.refresh (cognitive 20): GameModsController.refresh has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 11, if/else 3 (5 pts), ternaries 1 (3 pts), error handling 1 (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/src/toolbox/game_mods/game_mods_controller.dart"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ee60a55be5f5ff9cb328663f10093bfd2710bc003bd5a2203dd13e8364443c"}},{"ruleId":"D2","level":"warning","message":{"text":"SortieMapCatalogUpdateService._getWithRedirects (cognitive 20): SortieMapCatalogUpdateService._getWithRedirects has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 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/src/toolbox/sortie_map_query/sortie_map_catalog_update_service.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0cbd270fc13d4beefb390809f4a68d67d5a38d519cb8b37c9ef3f61983ceaa"}},{"ruleId":"D2","level":"warning","message":{"text":"ShipSubtitleBridge.onMessage (cognitive 20): ShipSubtitleBridge.onMessage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, error handling 1, match/switch 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/subtitles/ShipSubtitleBridge.kt"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a4cb6c166b144df696d6898ed480aa0f1cd68c14f491be2e2382032bbe8511"}},{"ruleId":"D2","level":"warning","message":{"text":"ship_subtitles.identify (cognitive 20): ship_subtitles.identify has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, loops 1 (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":"assets/scripts/ship_subtitles.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"3417bf4b1f7cd162896cb3f3c2955ac50fa9b7e3828ccb881bcde39c20f80ff9"}},{"ruleId":"D2","level":"warning","message":{"text":"RecordBackupService._chooseDirectoryImpl (cognitive 19): RecordBackupService._chooseDirectoryImpl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 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/src/backup/record_backup.dart"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"e067d64558fbf31934f396bdc022047f10e2e9d4119c7a285266ba459d4eb38d"}},{"ruleId":"D2","level":"warning","message":{"text":"_GameFullscreenControlsState.build (cognitive 19): _GameFullscreenControlsState.build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/game_fullscreen_controls.dart"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fe84a0a9b4665742d29874bf0d317f09547e5ae56791303d32319886827b32"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeGameResourceChecklistAdapter._onEvent (cognitive 19): NativeGameResourceChecklistAdapter._onEvent has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 7, 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/src/browser/native_game_resource_checklist.dart"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae93b79584bc40f376f79894d1a9c02e7d746fae3b26ceb97b05916b5774c698"}},{"ruleId":"D2","level":"warning","message":{"text":"_FleetShipStatusCapsuleState._textIdentity (cognitive 19): _FleetShipStatusCapsuleState._textIdentity has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 8, boolean chains 6, 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/src/fleet/fleet_ship_status_capsule.dart"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf478045703d00cd1619d03d4457b9deb2aaff81e2b501ed268c4ab9db031ea0"}},{"ruleId":"D2","level":"warning","message":{"text":"GameStateReducer._applyKnownQuestProgress (cognitive 19): GameStateReducer._applyKnownQuestProgress has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 1, match/switch 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/src/game_state/game_state_reducer.dart"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe77d5d101e49c519e7540c7eb8c8f5600c85ac37af79d3fa2b0abc73d90aca6"}},{"ruleId":"D2","level":"warning","message":{"text":"GameStateReducer._mergeLandBaseSquadrons (cognitive 19): GameStateReducer._mergeLandBaseSquadrons has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 3 (5 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/src/game_state/game_state_reducer.dart"},"region":{"startLine":2157}}}],"partialFingerprints":{"codehealthFindingId/v1":"490105b4588cb62b3c8b6a0552a614a6045c5b4c6bbca64c2240a07f1aaa57dd"}},{"ruleId":"D2","level":"warning","message":{"text":"LogbookDatabase.insertBattleRecord (cognitive 19): LogbookDatabase.insertBattleRecord has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 11, if/else 3 (5 pts), loops 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/src/logbook/logbook_database.dart"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"b602e67fbdd5659c9123149e124288040cb61b2064464a6e41d6f85276841387"}},{"ruleId":"D2","level":"warning","message":{"text":"_LogbookTablePageState._loadSortieFilterCatalog (cognitive 19): _LogbookTablePageState._loadSortieFilterCatalog has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, loops 2, 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/src/logbook/logbook_page.dart"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5fdb604eceb0a568cfa19789dc328a0162cf538141aaa06e59161f3b5e752a"}},{"ruleId":"D2","level":"warning","message":{"text":"_LogbookTablePageState._dropNames (cognitive 19): _LogbookTablePageState._dropNames has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 1 (4 pts), error handling 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_page.dart"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"750cb5a2e036a364967b6ef85d97d9f7d329dcbac154e98bc9ba8194523d63a2"}},{"ruleId":"D2","level":"warning","message":{"text":"GameInfoNoticeController._modernizationMaxDeltas (cognitive 19): GameInfoNoticeController._modernizationMaxDeltas has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 4 (5 pts), loops 3 (4 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/src/notice/game_info_notice_controller.dart"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a16393090ed9de05310ac4f1fa72cd92b7974d8833258478358a55206bbaa1e"}},{"ruleId":"D2","level":"warning","message":{"text":"GameInfoNoticeController._handleSortieCapacity (cognitive 19): GameInfoNoticeController._handleSortieCapacity has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 7, 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/src/notice/game_info_notice_controller.dart"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a08e7b1b039986dcb37e657b3e66bccca685b2343a61b91f69ae201e5d9807"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestProgressEngine._battleShips (cognitive 19): QuestProgressEngine._battleShips has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 8, loops 2 (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/src/quest/quest_progress_engine.dart"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eccc7469444f2d586d94a263c994a916f8a45f3c1edf3c7fa8696e5b02688d0"}},{"ruleId":"D2","level":"warning","message":{"text":"SenkaReducer._magicFromHistory (cognitive 19): SenkaReducer._magicFromHistory has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 3 (7 pts), loops 2 (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/src/senka/senka_reducer.dart"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"345978590b00d08efebadf959276c2b62cb5cea8247651e54a8e336176bf538e"}},{"ruleId":"D2","level":"warning","message":{"text":"SortieExperienceController._load (cognitive 19): SortieExperienceController._load has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), 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/src/sortie_experience/sortie_experience_controller.dart"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"672ae8e031a440fdf828dba6b08a6c3e48fdfda4886b7424bc8d9d1ffbd760f5"}},{"ruleId":"D2","level":"warning","message":{"text":"_CompositionImagePageState._library (cognitive 19): _CompositionImagePageState._library has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 1 (4 pts), boolean chains 1, 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/composition_image_page.dart"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c101b0484f053c73c363df34cb1ed9ebe284827385b7289c2293fa188ab0ca"}},{"ruleId":"D2","level":"warning","message":{"text":"_GameModsPageState._footer (cognitive 19): _GameModsPageState._footer has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 11, boolean chains 4, 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/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"426566ac0d5c21702cb50d5b32c3f2901bf8f5e1dead7f103377cbaf744462ee"}},{"ruleId":"D2","level":"warning","message":{"text":"FileSortieMapCatalogStore._readInstalled (cognitive 19): FileSortieMapCatalogStore._readInstalled has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/sortie_map_catalog_store.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0789ac840f92d0162ea91ba628047aaf690ae06212defe1e44d2e4356f8317"}},{"ruleId":"D2","level":"warning","message":{"text":"SortieMapCatalogUpdateService.checkAndUpdate (cognitive 19): SortieMapCatalogUpdateService.checkAndUpdate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, error handling 3 (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/src/toolbox/sortie_map_query/sortie_map_catalog_update_service.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"2493e4edefb4331f1826d7c403d869185a0fbff42b23f481cd4fcad623592c68"}},{"ruleId":"D2","level":"warning","message":{"text":"RecordBackupHandler.onActivityResult (cognitive 19): RecordBackupHandler.onActivityResult has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), error handling 3 (5 pts), boolean chains 4 (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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/RecordBackupHandler.kt"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d5b2931285ca8da14e63b126242f68534e4aff4addd77ba991ad4d097de158"}},{"ruleId":"D2","level":"warning","message":{"text":"GameFrameRateBridge.onPostMessage (cognitive 19): GameFrameRateBridge.onPostMessage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 2 (3 pts), boolean chains 1, 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFrameRateBridge.kt"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"274e9e9f1371bf946205ee6a7ec5db01eb6f8fcb8dde69b5421ba5d5144cf20c"}},{"ruleId":"D2","level":"warning","message":{"text":"GameResourceCacheStore.reconcileOrphanFiles (cognitive 19): GameResourceCacheStore.reconcileOrphanFiles has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 1, error handling 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheStore.kt"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f6af91b51a66194b2ddb84f8fc3947814971fde8d2c81e8780245887b34026"}},{"ruleId":"D2","level":"warning","message":{"text":"WebViewProxyManager.runNetworkDiagnostic (cognitive 19): WebViewProxyManager.runNetworkDiagnostic has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, error handling 1 (2 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/WebViewProxyManager.kt"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3b1a3196df048241dfdf52683b98d723120a318de901f64a9bb309fb6af914"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModManager.onActivityResult (cognitive 19): GameModManager.onActivityResult has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModManager.kt"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d938ca242648cb057eced834519287c0de03fecbffa67abf70b34298c25755"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeGameWarningDialogChannel.renderSurfaceDialog (cognitive 19): NativeGameWarningDialogChannel.renderSurfaceDialog has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogChannel.kt"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f032e55a58ea972bc8758d4c3fe935479689b38222d084c917aaea3986e518d"}},{"ruleId":"D2","level":"warning","message":{"text":"_CompactFleetGrid.build (cognitive 18): _CompactFleetGrid.build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 8, 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/src/battle/live_battle_card.dart"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d9bde934c35f9ef48d278a81118408fa47ddd3e46a8a3a3515989462bad92b"}},{"ruleId":"D2","level":"warning","message":{"text":"GameSurfaceInputGuardRoute._onAnimationStatus (cognitive 18): GameSurfaceInputGuardRoute._onAnimationStatus has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 12, 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/src/browser/game_surface_input_guard.dart"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6171e5a9c23badd05fe6aca9b80bc20d893921c445d93e8c8fda2602ede5916"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeGameSurfaceSlotState._measureAndReport (cognitive 18): NativeGameSurfaceSlotState._measureAndReport has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 8, 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/src/browser/native_game_surface_slot.dart"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"a966d78fa31af9361cbff2be79ca88ee16f2b2489977e97b3d1caf9f73a04412"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticPrivacyPolicy._validateValue (cognitive 18): DiagnosticPrivacyPolicy._validateValue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 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/src/diagnostics/diagnostic_privacy_policy.dart"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74525f1f79b86b1029e9940f15f3746cff1c961eaf026923a76fac6aa058b6d"}},{"ruleId":"D2","level":"warning","message":{"text":"_ResourceTrendPageState._load (cognitive 18): _ResourceTrendPageState._load has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, 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/src/fleet/resource_trend_page.dart"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5191cf17c74186f702eb3ba0775aac8378cacaaafdb16b32046465a26d511bd"}},{"ruleId":"D2","level":"warning","message":{"text":"TimerMechanicsService.onManualFleetChange (cognitive 18): TimerMechanicsService.onManualFleetChange has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 3 (6 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/src/fleet/timer_mechanics_service.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da01e868d9bc2a063b1f3580430ba8bcedbf36b13b2018fdbfbc7f3787eae56"}},{"ruleId":"D2","level":"warning","message":{"text":"GameWebViewCaptureUpdateCoordinator._drain (cognitive 18): GameWebViewCaptureUpdateCoordinator._drain has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 3, 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/src/game_webview.dart"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba2bb69f4d2f0be09a06ae14119c2ed04af78c6637d72b012b5b0d82372d700"}},{"ruleId":"D2","level":"warning","message":{"text":"_GameWebViewState.didUpdateWidget (cognitive 18): _GameWebViewState.didUpdateWidget has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, 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/src/game_webview.dart"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"825b1069d3567920c0e147876a2ac3c35077c8a7772b95c187fec856918f7390"}},{"ruleId":"D2","level":"warning","message":{"text":"ImprovementDatasetUpdateService.checkAndUpdate (cognitive 18): ImprovementDatasetUpdateService.checkAndUpdate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 3 (4 pts), loops 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/src/improvement/improvement_dataset_update_service.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"153e950b4582fed6b323dd3ed0b5a46b330e62104dc5efb2530fb09726e508b7"}},{"ruleId":"D2","level":"warning","message":{"text":"_LogbookTablePageState._matchesFilter (cognitive 18): _LogbookTablePageState._matchesFilter has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, ternaries 2 (4 pts), if/else 2 (3 pts), match/switch 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/src/logbook/logbook_page.dart"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a99a5338f33200576a8c14f600243e141b7e4a7d72d12b25a87f8401317e653"}},{"ruleId":"D2","level":"warning","message":{"text":"_RelationRow.build (cognitive 18): _RelationRow.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (6 pts), boolean chains 5, if/else 3 (5 pts), loops 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/src/quest/quest_center_page.dart"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"6318574749badef31f0da30986b32429dd4c186cdc2b0a2ebcd9eadfd0beed90"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestProgressEngine._record (cognitive 18): QuestProgressEngine._record has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, ternaries 2 (6 pts), loops 2 (4 pts), if/else 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_progress_engine.dart"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9405f1472d354ed549d6795d895c07267889d6be3feb53cae75e6a157e2298d"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestProgressEngine.expire (cognitive 18): QuestProgressEngine.expire has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 5, loops 3, 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/src/quest/quest_progress_engine.dart"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"232ac64b3448b88ae24beaa08d2e97acacad193494ad20e4cb26a98b63e9fded"}},{"ruleId":"D2","level":"warning","message":{"text":"_NotificationSettingsPageState.build (cognitive 18): _NotificationSettingsPageState.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 11, boolean chains 6, 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/src/settings/notification_settings_page.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"55da0ae4e70f735caab9bddd72ccf6ec6d6d7e64027cbc1989d055e5ae28ae0c"}},{"ruleId":"D2","level":"warning","message":{"text":"RecordBackupSection.build (cognitive 18): RecordBackupSection.build has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, ternaries 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":"lib/src/settings/record_backup_section.dart"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"20389e371a4d2918a75b61313c8a2aa081332d10f1dfd6eff8d779cb67ab8455"}},{"ruleId":"D2","level":"warning","message":{"text":"TopNoticeSettingsSection.build (cognitive 18): TopNoticeSettingsSection.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (10 pts), if/else 2 (4 pts), loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/top_notice_settings_section.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7e4e9f1e41ad617317797a44b31b0732dde889b8588aa9b70ff9ba2dfdd24b"}},{"ruleId":"D2","level":"warning","message":{"text":"_WarehouseSpendingSummary._resourceGroups (cognitive 18): _WarehouseSpendingSummary._resourceGroups has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (7 pts), if/else 3 (6 pts), loops 3 (4 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/src/sortie_experience/sortie_experience_resource_view.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5041162ccfba82bb1abf6179311f767399d4262143b7477ee5deeb0d1455977"}},{"ruleId":"D2","level":"warning","message":{"text":"SortieResourceLedger.fromJson (cognitive 18): SortieResourceLedger.fromJson has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 6, error handling 2 (3 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_resource_ledger.dart"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"370b726d6934a68c2b3d9daac6e2b10e91d92e7ea3fd7384b59fc1a2e970fd27"}},{"ruleId":"D2","level":"warning","message":{"text":"SortieResourceLedger._matchesPlaneDebt (cognitive 18): SortieResourceLedger._matchesPlaneDebt has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (5 pts), ternaries 3 (5 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_resource_ledger.dart"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"d198f3c480da5a42dde90c9f0e424ffbb05a253a8721b8180c190581afcdfcfa"}},{"ruleId":"D2","level":"warning","message":{"text":"ShipSubtitleRuntimeController._retry (cognitive 18): ShipSubtitleRuntimeController._retry has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 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/src/subtitles/ship_subtitle_runtime_controller.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9863a125b29ca8ef5201db4eb420e2c7aedaac83b5946024b0d282e717461be"}},{"ruleId":"D2","level":"warning","message":{"text":"AppTelemetryService._detectAndroidEmulator (cognitive 18): AppTelemetryService._detectAndroidEmulator has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 16, if/else 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/telemetry/telemetry_service.dart"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8ec4dc59bc9048fd4de1c3200cc7b574ee96cad5c80fc9ecba8c5a4d963ee2"}},{"ruleId":"D2","level":"warning","message":{"text":"_CompositionImagePageState.build (cognitive 18): _CompositionImagePageState.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (13 pts), boolean chains 3, if/else 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/src/toolbox/composition_image_page.dart"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"178881da9c3492783cc66a4bed96d1d19bc78d14f52ef5107d271e98a0240b5f"}},{"ruleId":"D2","level":"warning","message":{"text":"_CompositionImagePageState._exportRecord (cognitive 18): _CompositionImagePageState._exportRecord has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 1 (2 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/src/toolbox/composition_image_page.dart"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9278df275640fc8e9a0d86f1cd5b9e882e31f09e99e6a9c65bcea02b00d8f88"}},{"ruleId":"D2","level":"warning","message":{"text":"EnemyCatalogUpdateService.checkAndUpdate (cognitive 18): EnemyCatalogUpdateService.checkAndUpdate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, error handling 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/enemy_catalog_update_service.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1457295e0fd2869b61e9140b962dd931309ce7fb85023e8d787271d189f2f1f3"}},{"ruleId":"D2","level":"warning","message":{"text":"_OverviewPanel.build (cognitive 18): _OverviewPanel.build has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 9, if/else 3 (4 pts), loops 2 (3 pts), boolean chains 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/src/toolbox/sortie_map_query/sortie_map_query_page.dart"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"4754e75648ec3eda99889c4cc5ac88e7cead4f4cd39fcc7f77478c4522e929c5"}},{"ruleId":"D2","level":"warning","message":{"text":"GadgetBypassEngine.fetch (cognitive 18): GadgetBypassEngine.fetch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), error handling 1 (2 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GadgetBypassEngine.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"26717a71a59a257c73fbac4ca0f120dfa468a7bd34744696297e7e5a38a21c59"}},{"ruleId":"D2","level":"warning","message":{"text":"GameFullscreenChannel.refreshNotice (cognitive 18): GameFullscreenChannel.refreshNotice has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFullscreenChannel.kt"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"d016f57eb2a84dbc29b710c6d19d5d6feaddc85af79e4ef9573635687794d37f"}},{"ruleId":"D2","level":"warning","message":{"text":"GameMouseWheelBridge.onMessage (cognitive 18): GameMouseWheelBridge.onMessage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, match/switch 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameMouseWheelBridge.kt"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9b4adc17e55dfd5cb6849e327efad879c3e79bf2f3bd5b479947119ea7f15f"}},{"ruleId":"D2","level":"warning","message":{"text":"GameResourceCacheStore.commitInternal (cognitive 18): GameResourceCacheStore.commitInternal has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5, error handling 1, 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheStore.kt"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff7d5d80076d3829ee1790676d41c158eb1c8ba689b468e9430bf66bd657fd6"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModRepository.exportTree (cognitive 18): GameModRepository.exportTree has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModRepository.kt"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"1838aba869b986383d60df67505d0b1159f98fa5c872e7d594ad80989a7156ce"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityWebViewHost.create (cognitive 18): ActivityWebViewHost.create has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, match/switch 1 (3 pts), error handling 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/ActivityWebViewHost.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3afbee7b76621c2614b582347048bd18495af4f53ac62cc0b23b22da46c2f2"}},{"ruleId":"D2","level":"warning","message":{"text":"_SmokeAppState._snapshot (cognitive 17): _SmokeAppState._snapshot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7, 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":"tool/advance_warning_device_smoke/main.dart"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"50efe844d6b8b88b0b5156da958096f0fc1367c95c7ebcb3ee590aa2f5453dd2"}},{"ruleId":"D2","level":"warning","message":{"text":"BackupArchive._validateWriterMappingLimits (cognitive 17): BackupArchive._validateWriterMappingLimits has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 5, loops 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/src/backup/record_backup.dart"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"78aa7f6da95b71e0330d583c1bac39c140d1b645475f1be9970dd86db810eb01"}},{"ruleId":"D2","level":"warning","message":{"text":"BackupArchive.encode (cognitive 17): BackupArchive.encode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 2 (3 pts), boolean chains 2, 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/src/backup/record_backup.dart"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f1f4c6e2a37a64ddb95660a8c2e3c3eecf583daaa451590d9f79855a410d4e"}},{"ruleId":"D2","level":"warning","message":{"text":"BattleController._contextFromMap (cognitive 17): BattleController._contextFromMap has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (6 pts), ternaries 5, loops 2 (4 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/src/battle/battle_controller.dart"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12e9762b99954c4e2a2afeaec9e3f666cf18861b324ad21d816931b15107ce8"}},{"ruleId":"D2","level":"warning","message":{"text":"BattleController._damageControlEquipmentByShipId (cognitive 17): BattleController._damageControlEquipmentByShipId has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (5 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_controller.dart"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8afc6412d51981db48b76ee5267f6e11410de53187d716dbc6b691fe465502"}},{"ruleId":"D2","level":"warning","message":{"text":"ApplicationFcdMapStorage._writeAtomically (cognitive 17): ApplicationFcdMapStorage._writeAtomically has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), error handling 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/src/battle/fcd_map_store.dart"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c06091b392dd587a39a97087eeed0917447fe4c499eca4a81f602b15e9b762"}},{"ruleId":"D2","level":"warning","message":{"text":"DmmRegionCompatibility.scriptForPage (cognitive 17): DmmRegionCompatibility.scriptForPage has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 12, if/else 3, 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/src/browser/dmm_region_compatibility.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7d2b4da56c1628899062c7c19563b4233e961f5763efb435a4aa273b240281"}},{"ruleId":"D2","level":"warning","message":{"text":"_GameFullscreenControlsState._onNativeEvent (cognitive 17): _GameFullscreenControlsState._onNativeEvent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 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/src/browser/game_fullscreen_controls.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9a0c8c3f2405a42afd7c90c3edd684169ba7b758879005567fa32e5973a1f5"}},{"ruleId":"D2","level":"warning","message":{"text":"KanxyGameRoute.accept (cognitive 17): KanxyGameRoute.accept has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6 (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/src/browser/kanxy_game_route.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac425abd1c392bbfd458d7ce6af3a074001849d6d670a87d6a5f50e8289e4b2c"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeGameSurfaceSlotState.didChangeDependencies (cognitive 17): NativeGameSurfaceSlotState.didChangeDependencies has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (5 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/src/browser/native_game_surface_slot.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"572825451806f587fcdc88bb3e11bc7c8bdb0469931f60d8e01e92fea7359487"}},{"ruleId":"D2","level":"warning","message":{"text":"DashboardCard._flatHeaderRow (cognitive 17): DashboardCard._flatHeaderRow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 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/src/fleet/dashboard_card.dart"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"a863435d22f739d6224716ef6d14061d32f5b7db367e251eb5ff9ff83d4123b5"}},{"ruleId":"D2","level":"warning","message":{"text":"_PreSortieCheckSummaryState._buildMapsGaugeView (cognitive 17): _PreSortieCheckSummaryState._buildMapsGaugeView has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, ternaries 4 (7 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/pre_sortie_check_summary.dart"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0679ca446b4715b2fa9124bddc7d93e7904b72d6f376f33bc1795b4751151e"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactResourceBarState._buildEditableItem (cognitive 17): CompactResourceBarState._buildEditableItem has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 5, 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/src/fleet/resource_grid.dart"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5451dc438d6e6930532350fcdf60790f2dbaf9e0c93b18dcc41caf9d42acde"}},{"ruleId":"D2","level":"warning","message":{"text":"ResourceTrendPainter.paint (cognitive 17): ResourceTrendPainter.paint has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 4 (5 pts), loops 3, 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/src/fleet/resource_trend_chart.dart"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7124691be7ba636449033511e854d79ba9d9498467a2e68b1f0e94384a4ccf6"}},{"ruleId":"D2","level":"warning","message":{"text":"TimerMechanicsService._hasObservedNozakiSparkle (cognitive 17): TimerMechanicsService._hasObservedNozakiSparkle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 5, loops 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/src/fleet/timer_mechanics_service.dart"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2a30ce13e1415a0b7508b1e2c8ad278d2650d207d41beb8965ac0b7497754e"}},{"ruleId":"D2","level":"warning","message":{"text":"GameStateController._initQuests (cognitive 17): GameStateController._initQuests has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 1 (3 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/src/game_state/game_state_controller.dart"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4bc2a0a998407ff5d9ddc6d98755120cf0d529c6987a0385a960058566f511"}},{"ruleId":"D2","level":"warning","message":{"text":"GameStateReducer._consumeShips (cognitive 17): GameStateReducer._consumeShips has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"401dbe74bedea9a7efb5cc6a25be0688d238a0e4c837960d26693a3c4d5faeb8"}},{"ruleId":"D2","level":"warning","message":{"text":"GameStateReducer._parseMasterMapInfos (cognitive 17): GameStateReducer._parseMasterMapInfos has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (8 pts), boolean chains 6, if/else 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e411a86b6250eafdee52c2ce21330899be09344ccff3952f851946ed45584d"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultGameSurfaceStartupOrchestrator._drainCaptureChanges (cognitive 17): DefaultGameSurfaceStartupOrchestrator._drainCaptureChanges has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 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/src/game_webview.dart"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"60889c7d5c85d1bbcd8e80ef10c94369ef6724663ef5716f91b5360ac1a2d7d2"}},{"ruleId":"D2","level":"warning","message":{"text":"_GameWebViewState._finishPage (cognitive 17): _GameWebViewState._finishPage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, 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/src/game_webview.dart"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"42502a29ea3f31e8ad7685a8987f6ff7b11b9013c0783c56d278c0bf967bf2c7"}},{"ruleId":"D2","level":"warning","message":{"text":"_GameWebViewState._configureFrameRate (cognitive 17): _GameWebViewState._configureFrameRate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, error handling 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/src/game_webview.dart"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"8989369840f07a8be73824c55d59957f73a5ee68f304945664a34e16715c3e7b"}},{"ruleId":"D2","level":"warning","message":{"text":"_ImprovementTableState.build (cognitive 17): _ImprovementTableState.build has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10, loops 4, if/else 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/src/improvement/improvement_planner_view.dart"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc5c1e96a7bcb63bfc0a5bc68a751bdafd547d08c198c29e1f8d9024bd346ce"}},{"ruleId":"D2","level":"warning","message":{"text":"KcwikiReportConsumer._process (cognitive 17): KcwikiReportConsumer._process has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 6, loops 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/src/kcwiki_report/kcwiki_report_consumer.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c0dd2ae1227a7d2eb07e5e7d6084b461cef8a0d0e711197da76e130019a812"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpKcwikiReportTransport.send (cognitive 17): HttpKcwikiReportTransport.send has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, ternaries 1 (2 pts), 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/src/kcwiki_report/kcwiki_report_transport.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca3b70aedb620cf70109b8be6a8f3f2d0049e9e55b2de49fbdc72cf000674d6"}},{"ruleId":"D2","level":"warning","message":{"text":"LogbookEventRecorder._recordMapResourceEvent (cognitive 17): LogbookEventRecorder._recordMapResourceEvent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 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/src/logbook/logbook_event_recorder.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f228c2a89db5bc7424d58401d88994957bba7b868225082428039f8d863e3ec"}},{"ruleId":"D2","level":"warning","message":{"text":"LogbookEventRecorder._rewardItems (cognitive 17): LogbookEventRecorder._rewardItems has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 2 (6 pts), if/else 4, loops 2 (4 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/src/logbook/logbook_event_recorder.dart"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"28898a7445d281ce4dd534a569ca172e15401f1a652d54f8e1bf0ea5034055eb"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestCatalog.QuestCatalog (cognitive 17): QuestCatalog.QuestCatalog has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 6 (7 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_catalog.dart"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2cf8b809768a01f502647f1782481a9f57fc48b56136a0f88c87b55687a111"}},{"ruleId":"D2","level":"warning","message":{"text":"ApplicationQuestCatalogStorage._writeAtomically (cognitive 17): ApplicationQuestCatalogStorage._writeAtomically has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), error handling 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/src/quest/quest_catalog_store.dart"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc96a054356ad1d2634355f0e8248e17d4e4acb3a0af9d2a43c11bff6859d60"}},{"ruleId":"D2","level":"warning","message":{"text":"_SenkaCalculatorViewState._group (cognitive 17): _SenkaCalculatorViewState._group has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 9 (13 pts), if/else 3, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_calculator_view.dart"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"592f35201565ad5e8e18204a7a36627e4cd7566b489e8e4f7ef936c87b9d0dee"}},{"ruleId":"D2","level":"warning","message":{"text":"DataSettingsPage._clearLogbook (cognitive 17): DataSettingsPage._clearLogbook has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, error handling 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/src/settings/data_settings_page.dart"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9970921d7f7e0e2e1947f660e67d0b59764592611bdabfca5a56a250df34f2c"}},{"ruleId":"D2","level":"warning","message":{"text":"SortieExperienceController._returnToPort (cognitive 17): SortieExperienceController._returnToPort has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_experience_controller.dart"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e4e8bb3dc09366e8919bd0129a33b08b1aa8678716a848978a53e9e194dd0b"}},{"ruleId":"D2","level":"warning","message":{"text":"_CompositionImagePageState._deleteRecord (cognitive 17): _CompositionImagePageState._deleteRecord has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6, 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/src/toolbox/composition_image_page.dart"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9baffdc44013db858627aa1fdcdb5ffcd32111798cdf1aeea40a5b4a1e27a30"}},{"ruleId":"D2","level":"warning","message":{"text":"_ExpCalcPageState._buildTrackingTable (cognitive 17): _ExpCalcPageState._buildTrackingTable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (8 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/exp_calc/exp_calc_page.dart"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"73332d2677317755638dbc500634cb9134086822f4f934e748774ef7637d83f9"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModsStatus.resolve (cognitive 17): GameModsStatus.resolve has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 3 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_models.dart"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3af6192211a173c2be7415ce387f1889b6bffc6c6d9be9b65b2446803ac8c08"}},{"ruleId":"D2","level":"warning","message":{"text":"FileEnemyCatalogStore.save (cognitive 17): FileEnemyCatalogStore.save has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), error handling 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/src/toolbox/sortie_map_query/enemy_catalog_store.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ff1fe6bd01b273f100725c9fd65f15fdae08b597d22bedbe4ee1c0a2f61816"}},{"ruleId":"D2","level":"warning","message":{"text":"_FormationCard.build (cognitive 17): _FormationCard.build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3 (4 pts), boolean chains 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/src/toolbox/sortie_map_query/sortie_map_query_page.dart"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28f82bf2b2f36a1ccdff6ca0850d32ba1b608cd7d0a88967b7aeff137983a42"}},{"ruleId":"D2","level":"warning","message":{"text":"TopNoticeController.show (cognitive 17): TopNoticeController.show has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 8 (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/src/widgets/top_notice.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1931f1578862903fe483b0cb35adb7aa80be9ede2350e6b7754b3617a3e5f2"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModLibraryCoordinator.readPending (cognitive 17): GameModLibraryCoordinator.readPending has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 1 (2 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibraryCoordinator.kt"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce82a0a79247272cf62c27d2c407358822015fee4b8373bf770e1de22d307331"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeGameWarningDialogChannel.createWindow (cognitive 17): NativeGameWarningDialogChannel.createWindow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, match/switch 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogChannel.kt"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aab9651f161b43cedd8d7db20b8329d6815c3d7f561a0adad35385ca7307223"}},{"ruleId":"D2","level":"warning","message":{"text":"import_poi_quest_goals.apply_policy (cognitive 17): import_poi_quest_goals.apply_policy has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/import_poi_quest_goals.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1ce4ee55d0c932574a2eaa888f5015451a63a8993b20cbe7b8543c54f56d7c"}},{"ruleId":"D2","level":"warning","message":{"text":"_YahagiShellState._browserActions (cognitive 16): _YahagiShellState._browserActions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 5 (6 pts), boolean chains 2, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/main.dart"},"region":{"startLine":2319}}}],"partialFingerprints":{"codehealthFindingId/v1":"37eccd36dfe46497109f05553fc7771c83acd80381a91d0cdd0aa699512cab3b"}},{"ruleId":"D2","level":"warning","message":{"text":"TargetGroupResolver._lookupShipName (cognitive 16): TargetGroupResolver._lookupShipName has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 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":"tool/akashi_bonus/lib/name_resolver.dart"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f5e0a2b033eed7fc491f624dda701b81a48b744c1977c9288b701f871da9a8"}},{"ruleId":"D2","level":"warning","message":{"text":"GameAudioController.attachPort (cognitive 16): GameAudioController.attachPort has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, 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/src/audio/game_audio_controller.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"807ee35a350dc02ac03c60d97373ad360d72b7918b2c6181d21fa4bea3533dc6"}},{"ruleId":"D2","level":"warning","message":{"text":"BattleController._mapIdentityFromNavigation (cognitive 16): BattleController._mapIdentityFromNavigation has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 12, if/else 3 (4 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_controller.dart"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee7c311223c95af620cfd4568c5219b1f023016f8e7204f09dcb1e779b0e9aa"}},{"ruleId":"D2","level":"warning","message":{"text":"BattleController._emitFriendlyHp (cognitive 16): BattleController._emitFriendlyHp has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_controller.dart"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1f3314a45a68c2eca42662a8d9d526b3f6e129638b871bb0d8c371f28eba2c"}},{"ruleId":"D2","level":"warning","message":{"text":"_BattleShipRow.build (cognitive 16): _BattleShipRow.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 10, boolean chains 3, if/else 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/detailed_battle_panel.dart"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e8749f308c484491b4f055767187b31ea138b9be0379958c92de27cbd57016"}},{"ruleId":"D2","level":"warning","message":{"text":"_CompactBarRow.build (cognitive 16): _CompactBarRow.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/src/battle/live_battle_card.dart"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d2228d728949da6af76672ecc5a746ed1838530c08b50afa9574996af4d88b"}},{"ruleId":"D2","level":"warning","message":{"text":"_PoiBattleSimulator._friendlyShell (cognitive 16): _PoiBattleSimulator._friendlyShell has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 3, loops 2 (3 pts), 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/src/battle/prediction/poi/poi_battle_prediction_engine.dart"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"3890aff56e5e2ebe2030aea704f58081d5cc7bbd93a5ccb2e243c652cd74e7e5"}},{"ruleId":"D2","level":"warning","message":{"text":"_GameFullscreenControlsState._syncNative (cognitive 16): _GameFullscreenControlsState._syncNative has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, loops 2, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/game_fullscreen_controls.dart"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b7864dfec92accb9dbb1609b84430dc67067b7ce68d5d1914e94a8e6a3bdbf"}},{"ruleId":"D2","level":"warning","message":{"text":"_BattleResultWarningOverlayState._refreshWarning (cognitive 16): _BattleResultWarningOverlayState._refreshWarning has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 12, if/else 2 (3 pts), error handling 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/src/capture/battle_result_warning_overlay.dart"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3a71a55511e238ca6a2d10fe1555d09da1b74da118f4269ff178f07547dc40"}},{"ruleId":"D2","level":"warning","message":{"text":"GameCaptureController._acceptDocument (cognitive 16): GameCaptureController._acceptDocument has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 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/src/capture/game_capture_controller.dart"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37144327fd68e7abf9ff460c40d2146f16c5f449650f4d534f9ef0749ad139f"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpeditionEvaluator._daihatsuFill (cognitive 16): ExpeditionEvaluator._daihatsuFill has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_evaluator.dart"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb39ac2d1a475eba1357f56621084b6eb6edeebd65b368351447dac1a38bcb1"}},{"ruleId":"D2","level":"warning","message":{"text":"_FleetViewState.build (cognitive 16): _FleetViewState.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 9 (10 pts), if/else 4, 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/src/fleet/fleet_information_center.dart"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c9734151eff33f802fd4abe3e3d7dd97b7a51fbfa28bc9772d19d3277b0897"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetShipMinimalRow._identityLine (cognitive 16): FleetShipMinimalRow._identityLine has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (3 pts), ternaries 3, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_ship_minimal_row.dart"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ed743a0b7bbb1e61838a6bda3db0c01374269418a1795b2124776b3012588e"}},{"ruleId":"D2","level":"warning","message":{"text":"MasterShip.remainingModernization (cognitive 16): MasterShip.remainingModernization has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (10 pts), boolean chains 5, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state.dart"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ce66cc3ce764687c623aaea97477c54bbb9118141265ea8ab6eb354698db7d"}},{"ruleId":"D2","level":"warning","message":{"text":"GameStateController._reachedQuestGoal (cognitive 16): GameStateController._reachedQuestGoal 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/src/game_state/game_state_controller.dart"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d82065bb9a11c679db47134ff572c09642d9ef84b8595c004f2cb8b01602ed"}},{"ruleId":"D2","level":"warning","message":{"text":"GameStateReducer._parseQuests (cognitive 16): GameStateReducer._parseQuests has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (7 pts), boolean chains 4, if/else 2 (4 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7223b28af6a3fb93f905914831f5fcc17cbe7900e2b9244d399a7670f8ead8ad"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowLayoutSnapshot.fromMap (cognitive 16): WindowLayoutSnapshot.fromMap has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 11, ternaries 3, if/else 1, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/layout/window_layout_controller.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"233390bf984e91345dae7d633cb673e83ca665bd9a4b44536c65b762992e7ee5"}},{"ruleId":"D2","level":"warning","message":{"text":"GameNameDictionary.fromJson (cognitive 16): GameNameDictionary.fromJson has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (5 pts), loops 2 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/localization/game_name_dictionary.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"da273a877f819af0a28e02cb07bfdd2ac74321851ca694122b5638f76881a186"}},{"ruleId":"D2","level":"warning","message":{"text":"GameInfoNoticeController.accept (cognitive 16): GameInfoNoticeController.accept has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 5, match/switch 1 (2 pts), 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/src/notice/game_info_notice_controller.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd267f86bdbaf39b835fddcfc61c4fb466533cdd2f0487fcace5d763d02664c"}},{"ruleId":"D2","level":"warning","message":{"text":"ApplicationQuestCatalogStorage._writeCachedPair (cognitive 16): ApplicationQuestCatalogStorage._writeCachedPair has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 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/src/quest/quest_catalog_store.dart"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"4395822a488513228538102b1824d0146d0ecb9e5c0bd05b278ca44928d7392a"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestProgressDatasetStore.loadBestAvailable (cognitive 16): QuestProgressDatasetStore.loadBestAvailable has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (6 pts), ternaries 1 (2 pts), 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/src/quest/quest_progress_dataset_store.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"93803af212546d83f5f20d9759451fc7061447aeeb31b9e80f7026026715118a"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestProgressRulesController._performCheck (cognitive 16): QuestProgressRulesController._performCheck has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 2 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_progress_rules_controller.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"592c7901c739d1e2fbfc88c7250e019df0c0363ee1db83164d31e45a6a0889a8"}},{"ruleId":"D2","level":"warning","message":{"text":"SenkaController._saveIfCurrent (cognitive 16): SenkaController._saveIfCurrent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 1, error handling 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_controller.dart"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6019ddcc3d8d62c450d80c661db30de5c1a86e36bcc4617b775f5806b39ea39"}},{"ruleId":"D2","level":"warning","message":{"text":"SenkaPanel.build (cognitive 16): SenkaPanel.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 14, 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/src/senka/senka_ui.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"111b0f793b30f1b8e9b4a77c8e36a49a8bc368e720fb103318bef1ac6ae2555a"}},{"ruleId":"D2","level":"warning","message":{"text":"GitHubReleaseChecker.check (cognitive 16): GitHubReleaseChecker.check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 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/src/settings/release_check_service.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"df30fd6c77e5effc3d3fda76fa1d30899bc8ba61c761e2b1162050af69ac3d85"}},{"ruleId":"D2","level":"warning","message":{"text":"ScreenSettingsPage.build (cognitive 16): ScreenSettingsPage.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), 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/src/settings/screen_settings_page.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9869758e3e1935f88052f6f7f2366d2464dcaa499697313258bbd921b5a281e5"}},{"ruleId":"D2","level":"warning","message":{"text":"_UnitHeading.build (cognitive 16): _UnitHeading.build has cognitive complexity 16 (threshold 15). Drivers by points: 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/src/toolbox/composition_image_card.dart"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"a624a33141bf36257132391146aa47c165cb478f688dfc1e4e2ecbb34457b0c7"}},{"ruleId":"D2","level":"warning","message":{"text":"_GameModsPageState._resourceRow (cognitive 16): _GameModsPageState._resourceRow has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 10, boolean chains 3, if/else 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f48be4b614b4cf29414e296e38ce5e24f06ee341b05b933ea10c5c86d1e35e"}},{"ruleId":"D2","level":"warning","message":{"text":"FileEnemyCatalogStore.loadBestAvailable (cognitive 16): FileEnemyCatalogStore.loadBestAvailable has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 2 (3 pts), 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/src/toolbox/sortie_map_query/enemy_catalog_store.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4ccd8135f72c3168a2e6cbebf01da95c22a7fc827c8776fb6e53e1878063ce"}},{"ruleId":"D2","level":"warning","message":{"text":"EnemyCatalogUpdateService._getWithRedirects (cognitive 16): EnemyCatalogUpdateService._getWithRedirects has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/enemy_catalog_update_service.dart"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31debfcd7b5587f4c45a396558fa9aca48e39b04aee1537d561a5af6c198ab0"}},{"ruleId":"D2","level":"warning","message":{"text":"_FrozenDataTableState._anchorOffset (cognitive 16): _FrozenDataTableState._anchorOffset has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/widgets/frozen_data_table.dart"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae55b095f07dd6ae76d51893a767842447f3dfad31224ee80d56a6335db18bb"}},{"ruleId":"D2","level":"warning","message":{"text":"GadgetBypassEngine.validBody (cognitive 16): GadgetBypassEngine.validBody has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 5 (6 pts), match/switch 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GadgetBypassEngine.kt"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"440b271c043befd2fbde080b8121563e94b7390f441d4ad131c9f413f3dbcfdc"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpUrlConnectionGameResourceFetcher.downloadToTemporaryFile (cognitive 16): HttpUrlConnectionGameResourceFetcher.downloadToTemporaryFile has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceFetcher.kt"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"682d1415a9e93316bf3be69613c485a1c6ecbbe149450794f2f54ee240c47671"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModArchive.applyDependencies (cognitive 16): GameModArchive.applyDependencies has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 7, match/switch 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModArchive.kt"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"806ddb5efb5278d231618a4ef7d5704379363a1d565394cefb7a900e075fbac3"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModArchive.detectWrapperDirectory (cognitive 16): GameModArchive.detectWrapperDirectory has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModArchive.kt"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb4d56a791c3c532335521ef82c18dd1e799db51070a559b788d9b5d980feeb"}},{"ruleId":"D2","level":"warning","message":{"text":"GameModLibrary.deletePackages (cognitive 16): GameModLibrary.deletePackages has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 5, error handling 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibrary.kt"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"71761c3b5eb6c8b1fc374ac63d5b8bf5981699ff4074bb1a82fd2ab35802d5e2"}},{"ruleId":"D2","level":"warning","message":{"text":"build_sortie_map_assets._node_kind (cognitive 16): build_sortie_map_assets._node_kind has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, 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":"tool/build_sortie_map_assets.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcc0e4c779cfd962e5790bfd540ce0d0a3ba78da08e25e204f55a0308341c83"}},{"ruleId":"D2","level":"warning","message":{"text":"ship_subtitles.start (cognitive 16): ship_subtitles.start has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 11, 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":"assets/scripts/ship_subtitles.js"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d4be56fdf2e18ae345897bbd080c01f84e61ce826e5c030fad8be3ae273d41"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _YahagiShellState._buildShell: MethodTooLong \u2014 _buildShell runs 1238 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1138 over it, 12.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/main.dart"},"region":{"startLine":2455}}}],"partialFingerprints":{"codehealthFindingId/v1":"5486c153d872c4de62a0a1210c49c726f998054e751f45aad792cce20025b5c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/main.dart: FileTooLong \u2014 3993 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3493 over it, 7.99\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/main.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9b7d0917cfe5c8a8896b3266ae5cb21018e2995aba6f4c2d89358cddfa6e8b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuleBuilder.buildForPage: MethodTooLong \u2014 buildForPage runs 720 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 620 over it, 7.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":"tool/akashi_bonus/lib/rule_builder.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c9ee5642f7c6e57d894652dbba1d65beca0f18c3c8e06124b4e5bd866c7ece"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GameStateReducer: ClassTooLong \u2014 2506 significant lines (blank, comment-only and punctuation-only lines excluded), 97 methods. The bar is 400 significant lines; this is 2106 over it, 6.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/src/game_state/game_state_reducer.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c66408641fc72478e5adba23bb5c105c74c6182ebcd3aa2141ffafab8bae35"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ShipRow.build: MethodTooLong \u2014 build runs 564 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 464 over it, 5.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_information_center.dart"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfe32f07fd85b90d7e3961f51e6439323cd3504a8f398277084b5eed661379e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/fleet_information_center.dart: FileTooLong \u2014 2711 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2211 over it, 5.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_information_center.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2916f4bbe63c9f3896ca9d5d9c8dc9af98fed2af08a02c2804abc7d3eefd5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: game_state/game_state_reducer.dart: FileTooLong \u2014 2583 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: GameStateReducer (15-3221). The bar is 500 significant lines; this is 2083 over it, 5.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/src/game_state/game_state_reducer.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"829cc0e3f0d1db7e13a3fdd3235f146b36d7ce2aebe9c53cb37376b34d081eae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _InformationPanelState.build: MethodTooLong \u2014 build runs 481 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 381 over it, 4.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/main.dart"},"region":{"startLine":4534}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c19799f9b7b386696085fe129c06d749043cc2b18dbc7841d08b4b15dc3324"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _YahagiShellState: ClassTooLong \u2014 1785 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 1385 over it, 4.46\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/main.dart"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"989a09d0a2a6e8cb19efa1c786071d2a4d6834108ecd5983bc6ffcf960dada86"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MainActivity.configureFlutterEngine: MethodTooLong \u2014 configureFlutterEngine runs 424 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 324 over it, 4.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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d55421ad115fbf8ad2de8ca375c042f888c3c1aa25549a741c82261655c5025"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GameStateSerializer.deserialize: MethodTooLong \u2014 deserialize runs 411 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 311 over it, 4.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/src/game_state/game_state_serializer.dart"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e682b55fc17b44ec11a56e9bd9c4f67598f2c061e72df865d3eb8ab888de4f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LayoutSettingsController: TooManyMethods \u2014 121 methods. The bar is 30 methods; this is 91 over it, 4.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/layout_settings_controller.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee9641cf09825e6196aed14700467c30d7b2f7e316d28fc457c74d14af41491"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _CompositionImagePageState: ClassTooLong \u2014 1603 significant lines (blank, comment-only and punctuation-only lines excluded), 55 methods. The bar is 400 significant lines; this is 1203 over it, 4.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/src/toolbox/composition_image_page.dart"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2241e05e86c8a44b6ad1356c55f625c4b6dd53c9109e3893a7778beead172e75"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MainActivity: ClassTooLong \u2014 1601 significant lines (blank, comment-only and punctuation-only lines excluded), 62 methods. The bar is 400 significant lines; this is 1201 over it, 4.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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1534657702b1b46a36bd0264ebe1e465e738cfb76f249184fc52f69fa4d2ca3f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScreenSettingsPage.build: MethodTooLong \u2014 build runs 395 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 295 over it, 3.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/screen_settings_page.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"8014b007442cec1d8a2acbd895b4a6db4ddae6953df60e51654c391ea46c32f7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GameNotificationCoordinator._buildScheduledAlarms: MethodTooLong \u2014 _buildScheduledAlarms runs 381 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 281 over it, 3.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/src/notification/game_notification_coordinator.dart"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"58063992e54564fc7032f550f5e126c83eae6ef518bec0bac98d46f8bda05c78"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GameModsStrings: TooManyMethods \u2014 114 methods. The bar is 30 methods; this is 84 over it, 3.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/src/toolbox/game_mods/game_mods_strings.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d972ffc3ac81766ee2fcd0f6e18b5af7f521912de0ffed5e6e84ef7af6185a34"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inventory/owned_inventory_page.dart: FileTooLong \u2014 1828 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1328 over it, 3.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/src/inventory/owned_inventory_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5837bde03effd19b74900c4229dc17bcfef31ceee40e7b886fd930e9f81b7e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _FleetShipStatusCapsuleState.build: MethodTooLong \u2014 build runs 351 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 251 over it, 3.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_ship_status_capsule.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8210417a01fcfb70fc713c34c40bf03bd9c81f264f6e958b84c8e1122a114c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LogbookDatabase: ClassTooLong \u2014 1399 significant lines (blank, comment-only and punctuation-only lines excluded), 68 methods. The bar is 400 significant lines; this is 999 over it, 3.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_database.dart"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd5eea622a3490e1c2489a4a8b5d885a2e303bc22998dacaeb974ef27c977ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: game_mods/game_mods_page.dart: FileTooLong \u2014 1747 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1247 over it, 3.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65761bc730fd891089523f4ce6f5c1c886c87926d38fcb34eddaa0d6a031c7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: logbook/logbook_page.dart: FileTooLong \u2014 1736 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1236 over it, 3.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ffd86c2c2b1c80320922a0e729bcafc76745e93e873473b382cfb0b1846d35"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: kancollebrowser/MainActivity.kt: FileTooLong \u2014 1724 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: MainActivity (126-2278). The bar is 500 significant lines; this is 1224 over it, 3.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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"069697f20b85ec79b85f656588b0e09c18c80b2b1d17432ab88133678f204beb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/resource_grid.dart: FileTooLong \u2014 1719 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1219 over it, 3.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/src/fleet/resource_grid.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c38466530f7572072e911c24923e0b8f6eb1961e567ee855720f0f084a27c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: toolbox/composition_image_page.dart: FileTooLong \u2014 1700 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: _CompositionImagePageState (104-2187). The bar is 500 significant lines; this is 1200 over it, 3.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/src/toolbox/composition_image_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b09cc4229ca2cf82d4417dfb85996b29aaa01342d26396a5a7778be2b19aa3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ResourceTrendChartState.build: MethodTooLong \u2014 build runs 337 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 237 over it, 3.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/src/fleet/resource_trend_chart.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"286dd3bf350b80562930e76bad1748b53722ce37f83096ae31a443fc3b44f31f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _NativeActivityGameSurfaceState: ClassTooLong \u2014 1336 significant lines (blank, comment-only and punctuation-only lines excluded), 72 methods. The bar is 400 significant lines; this is 936 over it, 3.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/src/native_activity_game_surface.dart"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"584406e1eb4df663bb19dd5b9b46a7f138d532decb57acb609d4a756fe5cb4d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backup/record_backup.dart: FileTooLong \u2014 1653 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1153 over it, 3.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/src/backup/record_backup.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c1f428bb187bbea36caf1ef0dd19472b09838d4f1efdb1d2f1c479f0f1575e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: logbook/logbook_database.dart: FileTooLong \u2014 1650 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: LogbookDatabase (211-2014). The bar is 500 significant lines; this is 1150 over it, 3.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/src/logbook/logbook_database.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e604684797d742ffda37151496a1a2b41003e4b5c20805c49068e17cbc9ab71e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BattleController: ClassTooLong \u2014 1315 significant lines (blank, comment-only and punctuation-only lines excluded), 67 methods. The bar is 400 significant lines; this is 915 over it, 3.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/src/battle/battle_controller.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1b475fa95112924dc49f297697faa103fa8b10d91376f898183665d584a301"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GameStateReducer: 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/src/game_state/game_state_reducer.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9d79054c5c4b7cc898acbd43a3f42966dccb5d509692ffc97c8610e4b59c1f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _ExpCalcPageState: ClassTooLong \u2014 1252 significant lines (blank, comment-only and punctuation-only lines excluded), 44 methods. The bar is 400 significant lines; this is 852 over it, 3.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/exp_calc/exp_calc_page.dart"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38e01827d4d6c34ec6f0d2c0d5f8365782c743bfba8d16969846077775745e9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _FleetFocusPanel.build: MethodTooLong \u2014 build runs 312 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 212 over it, 3.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/src/fleet/fleet_information_center.dart"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dc13c61f9a958c6a4715f68ae14b627f25f49ba3c7f1334cd538e22714aa6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/native_activity_game_surface.dart: FileTooLong \u2014 1549 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: _NativeActivityGameSurfaceState (286-2038). The bar is 500 significant lines; this is 1049 over it, 3.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/src/native_activity_game_surface.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f794ff94a1e095927204f6e6d138f9776a9a7d08199b5a5139b203c89ef2c4a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/game_webview.dart: FileTooLong \u2014 1532 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1032 over it, 3.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":"lib/src/game_webview.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4d7dd138a1c487f52bec8c1bac84adddf9686fb7b1024909c31b3b49544ee9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GameNotificationCoordinator: ClassTooLong \u2014 1207 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 400 significant lines; this is 807 over it, 3.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notification/game_notification_coordinator.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cba24884e4366a1a35195682225a52d27400419ebcb4f5795dea512c8d7d0aa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GameModsStrings.reason: MethodTooLong \u2014 reason runs 295 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 195 over it, 2.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_strings.dart"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"9581ca22b502cc9c33cd6e5315d6b1e4cca06a852bcf60e989cf45d455be96dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sortie_experience/sortie_experience_controller.dart: FileTooLong \u2014 1449 significant lines (blank, comment-only and punctuation-only lines excluded), about 66% of them inside a single declaration: SortieExperienceController (181-1392). The bar is 500 significant lines; this is 949 over it, 2.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/src/sortie_experience/sortie_experience_controller.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66d1f95d7e42b043d52844f697b62c6bb75f2f5babdee108d8d8fe2c010539f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: quest/quest_center_page.dart: FileTooLong \u2014 1447 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 947 over it, 2.89\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_center_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c64ce625fdc1be4c71a4504ba7f5d4d0a4c86cb227bdc58284c7f3ae07406e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GameStateReducer.reduce: MethodTooLong \u2014 reduce runs 288 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 188 over it, 2.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c1e6f95701a5442d081d9a0a9deeef46396edc22e7a11487a2e2b1cc68162c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CompositionImageStrings: TooManyMethods \u2014 85 methods. The bar is 30 methods; this is 55 over it, 2.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/src/toolbox/composition_image_strings.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0abbe5859e1ba91940c16f323e612e3fb5f381dc467aaac4e3a486ee7da9543"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CompositionImagePageState._controls: MethodTooLong \u2014 _controls runs 278 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 178 over it, 2.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":"lib/src/toolbox/composition_image_page.dart"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e08a9f5e32b3230e1fb1628f8e8ed002955212725d76c35e139f85031653882"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: battle/battle_controller.dart: FileTooLong \u2014 1346 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: BattleController (35-1733). The bar is 500 significant lines; this is 846 over it, 2.69\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_controller.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c4ac4528c12c8f6fbc01e1cec9082c9b55856ac8516500e148904cc4fef0dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: exp_calc/exp_calc_page.dart: FileTooLong \u2014 1338 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: _ExpCalcPageState (110-1812). The bar is 500 significant lines; this is 838 over it, 2.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/src/toolbox/exp_calc/exp_calc_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ba5280eb0e031783d7ee2836a8ce530797e4af52cf718d8989127a341a0a81"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GameNotificationCoordinator._buildOngoingItems: MethodTooLong \u2014 _buildOngoingItems 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/src/notification/game_notification_coordinator.dart"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8262280bff484a09a7d98e62ee0b4255bc85b2b2a34aa0b18d3cf8dbf0fc29"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sortie_map_query/sortie_map_query_page.dart: FileTooLong \u2014 1301 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 801 over it, 2.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/sortie_map_query_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e1ca535d4e62a90e62a3a0603beff719e99053f14853b9d295e2f982d2f8dd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkspaceContextHeader.build: MethodTooLong \u2014 build runs 259 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 159 over it, 2.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/src/layout/workspace_context_header.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abe8c952f32556d3fd8f3a41e337abf4c82033bdf3a3f2a5c7dde389aa51cbd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GameModsStrings: ClassTooLong \u2014 1029 significant lines (blank, comment-only and punctuation-only lines excluded), 114 methods. The bar is 400 significant lines; this is 629 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/src/toolbox/game_mods/game_mods_strings.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"26088ee6361a896b99bd509b4ca9d639243b3a652549b7cbf5abdee9a131acd7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SharedPreferencesLayoutSettingsStore: 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/src/settings/layout_settings_store.dart"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"047a6b2915fa338c3eb5142930a73cfe65b5145595306f96a5f9be1399c27b01"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ShipPopoverState.build: MethodTooLong \u2014 build runs 254 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 154 over it, 2.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/src/battle/battle_ship_details_popover.dart"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9757c5d65e2875e20148dcac8509d29775d37ac48beba35523728c7f97a8e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: notification/game_notification_coordinator.dart: FileTooLong \u2014 1241 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: GameNotificationCoordinator (18-1554). The bar is 500 significant lines; this is 741 over it, 2.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/src/notification/game_notification_coordinator.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfeb48892cea90f736621b44b9823668aa820a855ed31c7b127b663cc2d539a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LayoutSettingsController: ClassTooLong \u2014 988 significant lines (blank, comment-only and punctuation-only lines excluded), 121 methods. The bar is 400 significant lines; this is 588 over it, 2.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/layout_settings_controller.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fda0884972598bc4ea617013435a8a26551c5ab0f2f11dd6b86e94eeb2685ca"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RecordBackupService: ClassTooLong \u2014 976 significant lines (blank, comment-only and punctuation-only lines excluded), 73 methods. The bar is 400 significant lines; this is 576 over it, 2.44\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/backup/record_backup.dart"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"a923f7d80bf63016786deb6273ef53b1dd7a41362fd01f55d128a25d4c7a9c06"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RecordBackupService: TooManyMethods \u2014 73 methods. The bar is 30 methods; this is 43 over it, 2.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/backup/record_backup.dart"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"847faf4662b0e1684797313870aa8a84180e0b51bd90dc61fb4f17e9e463cb76"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: capture/battle_result_warning_overlay.dart: FileTooLong \u2014 1215 significant lines (blank, comment-only and punctuation-only lines excluded), about 78% of them inside a single declaration: _BattleResultWarningOverlayState (96-1301). The bar is 500 significant lines; this is 715 over it, 2.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/src/capture/battle_result_warning_overlay.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78488fe8ddac181ae144f43e830285dbd6ec3c91d669d32655964b7d9bfce182"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _NativeActivityGameSurfaceState: TooManyMethods \u2014 72 methods. The bar is 30 methods; this is 42 over it, 2.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/native_activity_game_surface.dart"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc064a3410756ec876f2f0649fa824f94c2c49c0abec6e27954646408938ba4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SortieExperienceController: ClassTooLong \u2014 956 significant lines (blank, comment-only and punctuation-only lines excluded), 60 methods. The bar is 400 significant lines; this is 556 over it, 2.39\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_experience_controller.dart"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"66971d21d86b3247c53447b663a8834b44e872aeeb3bc05e0751fdff6955e823"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _NotificationSettingsPageState.build: MethodTooLong \u2014 build runs 236 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 136 over it, 2.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/src/settings/notification_settings_page.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed78f477b6348e019e8d50f56a49a4e78b2ed5da40c3b56012ad8e5088f94893"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _BattleResultWarningOverlayState: ClassTooLong \u2014 943 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 400 significant lines; this is 543 over it, 2.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/src/capture/battle_result_warning_overlay.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"367e318c563b52ce6cd2b8845280ec90a91ef783ee1ff0c8025893445f3aab60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: quest/quest_progress_engine.dart: FileTooLong \u2014 1178 significant lines (blank, comment-only and punctuation-only lines excluded), about 77% of them inside a single declaration: QuestProgressEngine (39-1171). The bar is 500 significant lines; this is 678 over it, 2.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/src/quest/quest_progress_engine.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02effa01762d24a8137a2899fdffbf707b497615053a99618e37a5614fed000c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutSettingsController.load: MethodTooLong \u2014 load runs 235 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 135 over it, 2.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/src/settings/layout_settings_controller.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37aad589c5e2ced33be287247f603ea1f14b1957a2c165913a793be55f8d6fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: improvement/improvement_planner_view.dart: FileTooLong \u2014 1172 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 672 over it, 2.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/improvement/improvement_planner_view.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"696892d05fd1fb9ca0fc83156e662ec45cdf70ddcace620147fb8e3fcffeb170"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _BattleResultWarningOverlayState._showWarningDialog: MethodTooLong \u2014 _showWarningDialog runs 234 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 134 over it, 2.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/src/capture/battle_result_warning_overlay.dart"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"c396e4a657bd51fdf7c6b00776cc4f8dc632554ccf0ef2a0aa7dd5195f8b21df"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _LogbookTablePageState: ClassTooLong \u2014 933 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 533 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/src/logbook/logbook_page.dart"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"998d834ef88ebffdc2a11d4daf65a24c5b77245df18ac4bdc812f781d6a2b030"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TargetGroupResolver.resolve: MethodTooLong \u2014 resolve runs 231 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 131 over it, 2.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":"tool/akashi_bonus/lib/name_resolver.dart"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"8727ea9fd623495c69a302f152c08b663925b32bdcc079044296ee3a22817e71"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: senka/senka_state.dart: FileTooLong \u2014 1153 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 653 over it, 2.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/src/senka/senka_state.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"493f7e2a3bb3be99e7f424feefedc18fc5aa65baef41f1fc414f3310893496b6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BattleSettingsPage.build: MethodTooLong \u2014 build runs 228 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 128 over it, 2.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/battle_settings_page.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8eae02916213d0d4caf8d9f638a06206cce43ca54f0faef0ea1e483f6ee9b3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LogbookDatabase: TooManyMethods \u2014 68 methods. The bar is 30 methods; this is 38 over it, 2.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/src/logbook/logbook_database.dart"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a528172a3c4cc1bd4646e68256952e5cd4e470de58e022fd9be1b7518121fda"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: QuestProgressEngine: ClassTooLong \u2014 904 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 504 over it, 2.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/src/quest/quest_progress_engine.dart"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c695c3e0cdf8e74ec7f76b1be91885f72f8ff729b0d0101ddd0b2be2ae5eb9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BattleController: TooManyMethods \u2014 67 methods. The bar is 30 methods; this is 37 over it, 2.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_controller.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50e0cd5a98bd373d1328396276640b292690db172508a28c71c4485e937b6fb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SortieExperienceCardState._buildTotal: MethodTooLong \u2014 _buildTotal 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/src/sortie_experience/sortie_experience_card.dart"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d00889013122936a5f1ba4487d42874b408e80e0a4c9944c0ef32de7fe966e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _QuestDetail.build: MethodTooLong \u2014 build runs 221 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 121 over it, 2.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_center_page.dart"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc58c26f586fe215ac4e1683a68e30f6f0034a21b0b7324bd8864c509c7dec4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _OwnedInventoryPageState.build: MethodTooLong \u2014 build runs 214 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/owned_inventory_page.dart"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e02cde29020907bf9d39263feb90f3c4566b89c57eedd0a37be7a59f0dbc150"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _GameWebViewState: ClassTooLong \u2014 850 significant lines (blank, comment-only and punctuation-only lines excluded), 41 methods. The bar is 400 significant lines; this is 450 over it, 2.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_webview.dart"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"463a23a2ac1b602efa976da9880184b636b8774ca087433eb5cf9a251d46cd61"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _LogbookExperiencePageState._buildTable: MethodTooLong \u2014 _buildTable 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/src/logbook/logbook_experience_page.dart"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"2850edbdf96607fcaa5cf1c498acf3089871376e6daf03da2715a52c9c96f6b4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SortieMapQueryPageState._buildCatalog: MethodTooLong \u2014 _buildCatalog runs 211 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 111 over it, 2.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/src/toolbox/sortie_map_query/sortie_map_query_page.dart"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"64807f4fbaec3d87333320a2ebd7fce1dd82aed4c8764ac02e1659bd9357ab2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: game_state/game_state.dart: FileTooLong \u2014 1038 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 538 over it, 2.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e493387bd1ef37e5726749b45eb6c4fd0ebdd818ea423e008a703168a85ae911"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MainActivity: TooManyMethods \u2014 62 methods. The bar is 30 methods; this is 32 over it, 2.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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4364ec28d3fcf40d8cad9f06ab230bc037cb98b6c0d40948bd44aff14a2260e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: game_mods/game_mods_strings.dart: FileTooLong \u2014 1032 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: GameModsStrings (7-1201). The bar is 500 significant lines; this is 532 over it, 2.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/src/toolbox/game_mods/game_mods_strings.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa7581d33d164894059237321058d228b7f85847f02c46d16fecee09243fb97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sortie_experience/sortie_experience_card.dart: FileTooLong \u2014 1024 significant lines (blank, comment-only and punctuation-only lines excluded), about 74% of them inside a single declaration: _SortieExperienceCardState (56-1017). The bar is 500 significant lines; this is 524 over it, 2.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/src/sortie_experience/sortie_experience_card.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0560d96a55fcbe237cc1176a1fe25f04d70ebb9b0beb16512898973be3e697"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/layout_settings_controller.dart: FileTooLong \u2014 1010 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: LayoutSettingsController (17-1338). The bar is 500 significant lines; this is 510 over it, 2.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/src/settings/layout_settings_controller.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba090dc6ce759b6262c32a3251e6418ba4eed3c30f9993b8d5722ead01eca3b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FleetShipMinimalRow._statusGrid: MethodTooLong \u2014 _statusGrid runs 202 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 102 over it, 2.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/src/fleet/fleet_ship_minimal_row.dart"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca1ed388ddffc5a5f6b1272db1142b87b36aca6925479491eefc53f1a40dad8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GameModRepository: TooManyMethods \u2014 60 methods. The bar is 30 methods; this is 30 over it, 2.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModRepository.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d06d68f4f468f489b2a1dd03095274ebf797e9541d458b50a1101111a81aac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SortieExperienceController: TooManyMethods \u2014 60 methods. The bar is 30 methods; this is 30 over it, 2.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_experience_controller.dart"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a699636d7927af2f0ab135ecb3da203fb5b72baa0cfa4fd04035c19b358e82"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NosakiSparkleCalculator.project: MethodTooLong \u2014 project runs 200 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/nosaki_sparkle_calculator.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"311a994e8f27067b847699d58d599ffbcb2c5e6962630df7bc8c4e5cf61262fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/land_base_summary_card.dart: FileTooLong \u2014 992 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 492 over it, 1.98\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/land_base_summary_card.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"505d0c766e9f85d15d5a11feae6095d5f093fd9781c9c059d22239101bfcf865"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: toolbox/composition_image_card.dart: FileTooLong \u2014 985 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 485 over it, 1.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/composition_image_card.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a9df3e26b1fad74dce57398444ab82701171a2c880906abfd009198c510a79"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NativeGameWarningDialogChannel: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogChannel.kt"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e246ac8bfb3ad5921af8255d91f5e3d8f2b28b6ea2f10baa14a5cfe9974a81"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SortieExperienceCardState._shipTable: MethodTooLong \u2014 _shipTable runs 196 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_experience_card.dart"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fbd0145e84f12e8583c7ce49ae4e532dfc3051397af6d1fa7f4b9e60cab94e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NativeGameWarningDialogChannel: ClassTooLong \u2014 782 significant lines (blank, comment-only and punctuation-only lines excluded), 59 methods. The bar is 400 significant lines; this is 382 over it, 1.96\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogChannel.kt"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f5d20dc5bbe4357eca6163f9f1d74ab8e824dc04546d1550ab7ec3bed096a7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CompactResourceBarState: ClassTooLong \u2014 780 significant lines (blank, comment-only and punctuation-only lines excluded), 44 methods. The bar is 400 significant lines; this is 380 over it, 1.95\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/resource_grid.dart"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"003e78e18e22fedff4534e23ed2346aa1b4af4b3239f849fdad0e334d7c4214d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConstructionSummaryCard._buildConstructionSlotAt: MethodTooLong \u2014 _buildConstructionSlotAt runs 195 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/construction_summary_card.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f0baa78455e6b3d07ec8142faab14dba4edb45d37af303db9f222ab0930f0d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AboutContentWidget.build: MethodTooLong \u2014 build 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/src/settings/about_dialog.dart"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bb3bf11233359e7a0e0dfa675e130fd131292949a04ccc0317042e13289c87"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RuleBuilder: ClassTooLong \u2014 771 significant lines (blank, comment-only and punctuation-only lines excluded), 5 methods. The bar is 400 significant lines; this is 371 over it, 1.93\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/akashi_bonus/lib/rule_builder.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ef42a7a1d972d7a24047b345f8eaf4018eb07951d6e24744c50e38fece17ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nativewebview/NativeGameWebViewChannel.kt: FileTooLong \u2014 960 significant lines (blank, comment-only and punctuation-only lines excluded), about 64% of them inside a single declaration: NativeGameWebViewChannel (316-1158). The bar is 500 significant lines; this is 460 over it, 1.92\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWebViewChannel.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb43e514fb3c119b49bf522bf61fd97051510c8ee67238252a76692a7d9cec3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: QuestProgressEngine.process: MethodTooLong \u2014 process runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_progress_engine.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"627cabd8acc2818eb561e3b7a59f2e7d3cd5ad9abc0a9ea32b7d798fbb4297ba"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _SortieExperienceCardState: ClassTooLong \u2014 757 significant lines (blank, comment-only and punctuation-only lines excluded), 8 methods. The bar is 400 significant lines; this is 357 over it, 1.89\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_experience_card.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"56aa45e0e3cbcf237396f2751b9bf3e5f77f1e191b97c6f38d09771d2de59c5a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: senka/senka_info_view.dart: FileTooLong \u2014 937 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 437 over it, 1.87\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_info_view.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1117f23cf7f98ca4c98569d18e9f9a1276bc6b0d26eff65eac731adedf7f47f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: battle/live_battle_card.dart: FileTooLong \u2014 921 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 421 over it, 1.84\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/live_battle_card.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72646077e5afc1b195036cfbd7e7543485c37c1c0d8a8aaaeaff549b6c2363f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LandBaseAirGroupRow.build: MethodTooLong \u2014 build runs 184 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/land_base_summary_card.dart"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf90c65a70e74b0806b68d710fc85c84f8ee5ba8404f43a05ba623cfaa8b6da"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _CompositionImagePageState: 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/src/toolbox/composition_image_page.dart"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1662165baa7109548a2720dd068694af32695891b4d219fc4f3cb29204e64a26"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FleetDisplaySettingsSection.build: MethodTooLong \u2014 build runs 179 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/fleet_display_settings_section.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"33235541c4e9eeabccb08efb05eb242199c3cf70d0d50771351bfaf98d1e4e3d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BattleController._applyBattlePhase: MethodTooLong \u2014 _applyBattlePhase runs 178 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 78 over it, 1.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":"lib/src/battle/battle_controller.dart"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7876684f90253431778be8cdca8910926a9be2a346f85af4600c967ae81af1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GameModLibrary: 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibrary.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80d8546f2806230486ac589b32efb65fdcf32a635588ac7f376a3b1fac11ae7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SortieExperienceStrings: 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/src/sortie_experience/sortie_experience_strings.dart"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabed00a78e153292ab34b8b612cdf373bfcd9b94edf1117a97c051965e90198"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GameModRepository: ClassTooLong \u2014 702 significant lines (blank, comment-only and punctuation-only lines excluded), 60 methods. The bar is 400 significant lines; this is 302 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModRepository.kt"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec44f8f05c2750a5744bdb1998993865eb21cdcfaeeaccd9ff39a95553d6419"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _FleetSummaryCardState.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/src/fleet/fleet_summary_card.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8e45688372fe4471d421ecf572bbe64c75a4251e63fc2c9fbe2807f2fe1b7a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _FrozenDataTableState.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/src/widgets/frozen_data_table.dart"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3dc4e77d08c3a169d7f64718d482a32a857a4b26370f59646fe1d8e037b704"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _GadgetBypassSectionState.build: MethodTooLong \u2014 build runs 174 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/gadget_bypass_section.dart"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dd9d7f969981922ac2036730be3e6f9616f58943736aec81159d6259f6ad4a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ShipDialogState.build: MethodTooLong \u2014 build runs 174 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/exp_calc/exp_calc_ship_picker.dart"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b53c94872273dabdefd872e9e88538f5eaffe17b39d5988eb0c779926dbe003"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _OverviewPanel.build: MethodTooLong \u2014 build runs 174 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/sortie_map_query_page.dart"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c54659697335157cc2c19f7574234c32ad5982e3f7a95abe98297a701961e54"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompositionImageCard.build: MethodTooLong \u2014 build runs 173 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/composition_image_card.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a4adee257a39d39cdf3229a2de64e97f103c950d2f0e78afbeeae5ba747b1b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ResourceTrendPainter.paint: MethodTooLong \u2014 paint 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/src/fleet/resource_trend_chart.dart"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9b277832cb4ca8ea7e944c8a8088e34a3b2cc32a5ffd1f99b746d85b2ceaaa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SortiePanel.build: MethodTooLong \u2014 build 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/src/senka/senka_info_view.dart"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc070a21fe95a117cd7b3425298562f140b83e9c117db6949967bb2dcf7391a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkspaceNavigation.build: MethodTooLong \u2014 build runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\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/main.dart"},"region":{"startLine":4004}}}],"partialFingerprints":{"codehealthFindingId/v1":"998e206050100366e1d795764c68177aa6bd74bc3e537fa92d6595a2f51559ef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _LogbookTablePageState._tableSpec: MethodTooLong \u2014 _tableSpec runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_page.dart"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c201e94f1b646749bda6c9be283743a070710d2207de7a9cadda29e4dcbf82"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GameStateSerializer: ClassTooLong \u2014 668 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 268 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_serializer.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8c177ba6949bd35b2ed90c095ea6f687ba824dae87ef00f7681f6131a9fd11"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EquipmentDevelopmentController: 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/src/development/equipment_development_controller.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ed9d2f9cdc1f1982ade1f897eeff6ae3386c9f7505dd242f4244a99ebd4aea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nativewebview/NativeGameWarningDialogChannel.kt: FileTooLong \u2014 832 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: NativeGameWarningDialogChannel (54-1084). The bar is 500 significant lines; this is 332 over it, 1.66\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogChannel.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c480f011db79d3186c9fe862e132841def1c18d911bc4400220194f2ca963ca4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _ShipRow: ClassTooLong \u2014 664 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 264 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/src/fleet/fleet_information_center.dart"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b381b8f52f24c94947dd0d7b1989d2bb16cb1b7cddf4f88e1c1d81aa32a1a2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: QuestProgressEngine._events: MethodTooLong \u2014 _events runs 166 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_progress_engine.dart"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c992b0235fb76e93605777d596d62f10d54a6baf5efb19b12f64133199d23c9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GameModsStrings.resourceLabel: MethodTooLong \u2014 resourceLabel 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/src/toolbox/game_mods/game_mods_strings.dart"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcd1a953ebe57e9f156ad3b8f158004563afc2c6afa8cb80d48ab9d62722f6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/fleet_ui_strings.dart: FileTooLong \u2014 823 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 323 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_ui_strings.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bdc19910f6a0e8bb1cef77a502c35650691b7847088dca52fb0b6c2e51c4e2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GameModLibrary: ClassTooLong \u2014 655 significant lines (blank, comment-only and punctuation-only lines excluded), 53 methods. The bar is 400 significant lines; this is 255 over it, 1.64\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibrary.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0667c45ad257204c0e86b62c2d94088856704e3b949e3524eb48da1b955018"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GameModsController: 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/src/toolbox/game_mods/game_mods_controller.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcaf915eb038d6aef653b655694d110073c15bbd8f1f9daa6fb4d27cd8c1e9c0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _BattleDetailPageState._process: MethodTooLong \u2014 _process runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.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/src/logbook/battle_detail_page.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"b664543bd7d1ed1cfc2833cbb33dac64d727d7517da889c04f7ddd889b3acdf6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _SenkaCalculatorViewState: ClassTooLong \u2014 651 significant lines (blank, comment-only and punctuation-only lines excluded), 13 methods. The bar is 400 significant lines; this is 251 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/src/senka/senka_calculator_view.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30a1b9f32d1fb31ef132cb8e639fae5965c53d336c783c4e8741cee895f6f97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/rule_builder.dart: FileTooLong \u2014 812 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: RuleBuilder (51-1050). The bar is 500 significant lines; this is 312 over it, 1.62\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/akashi_bonus/lib/rule_builder.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6c5a32a7a91bd046baedede675462a3de88e3685a48d3bb232a1c8e122635e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SenkaState.fromJson: MethodTooLong \u2014 fromJson runs 161 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_state.dart"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6437fc551df50197fc1e4c37fac68fbaf2d808173574e9b1fb35be5e9b47f8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SortieMapSectionState.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/src/battle/sortie_map_section.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"0479547d8e29e8f306186f6c6e1d45b51e495732e1428ece6825fa329ff55da3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ImprovementTableState.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/src/improvement/improvement_planner_view.dart"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"886f4f916c99531eb49b79232c657a8d90b34e640284097bfc05d233b9096795"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _NetworkSettingsSectionState.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/src/settings/network_settings_section.dart"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"03041d404828ebc05ef9889592b1d2f273d6dfa3162d847a873435a94a80983f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/repair_summary_card.dart: FileTooLong \u2014 790 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 290 over it, 1.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/repair_summary_card.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2c8c7db5038d84a6f60f163266eabfcfd09eb8d2a85e093b9bee40978882fe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BattleDetailStrings: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_detail_strings.dart"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"2847099146913bc3498ed4edaf077b93c643be0e53dd2399dc5ea838bf3926e5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NativeGameWebViewChannel: ClassTooLong \u2014 613 significant lines (blank, comment-only and punctuation-only lines excluded), 44 methods. The bar is 400 significant lines; this is 213 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWebViewChannel.kt"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"641aabb4183466fc7faeb73af06c682bc112303504aab77156460f1cbb52d623"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mods/GameModRepository.kt: FileTooLong \u2014 750 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: GameModRepository (24-928). The bar is 500 significant lines; this is 250 over it, 1.50\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModRepository.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db26333f281f32f9bb5d571d4743082f9e9a990aa8aa470cf301faad702b1c7e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CompactBattlePanel.build: MethodTooLong \u2014 build 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/src/battle/live_battle_card.dart"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82a5968c2c8f7fed59d1410e047b3f11d48eed128302b0f95144dd97d6dc836"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GameBrowserToolbar.build: MethodTooLong \u2014 build 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/src/browser/game_browser_toolbar.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db787dca153f23f74d8e5ced01337980c284d68e3e648b4d183191a551c000a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExpeditionStrings.conditionLabel: MethodTooLong \u2014 conditionLabel 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/src/expedition/expedition_strings.dart"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"2994bf1c6f0cf0fe550dcb10efd2913309a2a0c34f686607945e66d5db34b3b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: senka/senka_calculator_view.dart: FileTooLong \u2014 741 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: _SenkaCalculatorViewState (30-917). The bar is 500 significant lines; this is 241 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/src/senka/senka_calculator_view.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb3512fa6bc6e2afa20f5039e67ce3d780dc6fe731a7d9bf31396b9127d01ad"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TopNoticeSettingsSection.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/src/settings/top_notice_settings_section.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"186bac23c1e7952785f42e80aa1144c37bb1ad0f07cce838c2084aa63495485b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NativeGameWebViewChannel: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWebViewChannel.kt"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a0f3c3f30975644a92ed0069315cafca777249222cf357e13976f3209c2332"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CompactResourceBarState: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/resource_grid.dart"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bf09b8bb18d2695e8a15a4b83d92bf4394d2209fd42ccc91af4dadd62b328e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GameStateController: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_controller.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc249d0cd54dcd35fff5450be5a734ae274edf62917e7176241e080d2e7dfc4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RecordBackupStrings: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/localization/record_backup_strings.dart"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"212976a2c12f7e39e4ee80019191cec0cbf021d1509823d04b7b739619f3bbd6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _ExpCalcPageState: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/exp_calc/exp_calc_page.dart"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f53e65fe97682ac651db96456c400b12231ec89c1f5869a2920b68f3dbfc10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sortie_experience/sortie_resource_ledger.dart: FileTooLong \u2014 731 significant lines (blank, comment-only and punctuation-only lines excluded), about 72% of them inside a single declaration: SortieResourceLedger (130-786). The bar is 500 significant lines; this is 231 over it, 1.46\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_resource_ledger.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7077c8d502a386a028c3b6975d209aee7e22617aa110ec696b717450a40d5ff4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BackupArchive.decode: MethodTooLong \u2014 decode runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/backup/record_backup.dart"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fb895d4dbb18b6c39ad1b6d813d184ff2f551e9693e042460e44fb1429a09d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _QuestCenterPageState.build: MethodTooLong \u2014 build runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_center_page.dart"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9dbbb95c3e9a09dfb8549b2cc43524d3c4ec4f679e545a8beac236734feebad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mods/GameModLibrary.kt: FileTooLong \u2014 719 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: GameModLibrary (46-907). The bar is 500 significant lines; this is 219 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibrary.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5c514fa3b7c747df9206b6dc2bf4d92a99be1a53e79b136a2ea73c6bd51d99"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GameModArchive.unpackChecked: MethodTooLong \u2014 unpackChecked 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModArchive.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1b78f3f3b2ac3f174a71855a88832eb09627895393e5ce8ac9a7db98af4d56"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MapGaugeRow.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/src/fleet/pre_sortie_check_summary.dart"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"8acdf1dfe6c27a5ed78f288e9a9cd9f85d35379c952930db0e6bf78157bc5d45"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _GameResourceCacheSectionState.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/src/settings/game_resource_cache_section.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"721c1443e71ae7ec0bc3a4630f93a36dac14388deb8041d50c19b440ad37c49c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GameInfoNoticeController: ClassTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded), 26 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/src/notice/game_info_notice_controller.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f667f8ce3d6bc053d9941d93fc22d0e88fe40547f5e97ba44ccbf26ae22b616"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expedition/expedition_check_page.dart: FileTooLong \u2014 709 significant lines (blank, comment-only and punctuation-only lines excluded), about 77% of them inside a single declaration: _ExpeditionCheckPageState (45-789). The bar is 500 significant lines; this is 209 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/src/expedition/expedition_check_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"712b48428fd6728c22cc8dacc2f0eba9571eb8a7659e0f889fb266bc5ccf17e3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LogbookEventRecorder: ClassTooLong \u2014 565 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 165 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/src/logbook/logbook_event_recorder.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07e133b9bc03741b49fd0484c98f6f74b6c69255a080fe08899a0dff30148f1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CompositionImagePageState._save: MethodTooLong \u2014 _save runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/composition_image_page.dart"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e7117ac2d57f2db210b4ea4a84c7e52d7f2fd9fb71319681ea2fbee64d1e3f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _LogbookTablePageState: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_page.dart"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"671dd2c21130743450c99caa5f347c3525c43ce33c68337611ef651729462497"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/resource_trend_chart.dart: FileTooLong \u2014 699 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 199 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/resource_trend_chart.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fb98470fbc302868d385101079f994964db2a72686922bc8408bc299b4c41e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: logbook/battle_detail_page.dart: FileTooLong \u2014 694 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 194 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/battle_detail_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e434aa9fdce66b9753d9dedae52791f589a6fca223060b3bb58edb1d6fecd9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _DevelopmentSecretaryPickerDialogState.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/src/development/development_secretary_picker.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ca60015adc05e176c64df0261ce4d04b6214548b9e75e3f91317694ea1afbf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataSettingsPage.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/src/settings/data_settings_page.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab18d5e33fa28eed802475d3a49b4bc242dc9d5667a2a7d11b754a2d32a6c58"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SenkaState: ClassTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded), 17 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/src/senka/senka_state.dart"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f1885dfdd6afb47100a223339ded067c07a18decde4c4caa43fb5dbeeb478e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inventory/equipment_compatibility_drawer.dart: FileTooLong \u2014 687 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 187 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/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e77ec7c61b3d428a3a0b5b878e5c71b8ea3b217ae9c82da5c50f04af5c7f37f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _ExpeditionCheckPageState: ClassTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 149 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_check_page.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7f0ef6240744393355361fd702f5efa7b0ce038f41f83cd12fb9ade5745626"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ShipParameterDetails.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/src/fleet/fleet_information_center.dart"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1ceeb338158f6907bb6b1aa8b440dd831980a9d09d3b0afb3c15e34c51ace9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ShipInventoryTable.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/src/inventory/owned_inventory_page.dart"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"463e13e259c0810b15c123a1a4f7f45cd3adc6fb5036b46c21a40d7c4df11846"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GameResourceCacheStore: 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheStore.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8aed130575006deea01fcfe9369a257ef318ce6fe457daf254f6520580a10a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _GameWebViewState: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_webview.dart"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ccdc6cfa8fafabc2fdaa728ef50e6a23c4920ee847b76b4019c5343fe4433a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/fleet_ship_status_capsule.dart: FileTooLong \u2014 683 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: _FleetShipStatusCapsuleState (56-730). The bar is 500 significant lines; this is 183 over it, 1.37\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_ship_status_capsule.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b65c2e10a1095bdea60aa9eea4cf519725bd2b88b41ab4f231388f7f7f0141f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CompositionImagePageState.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/src/toolbox/composition_image_page.dart"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c048686fc6805783f6637ad412cac436cd8d8e98d7876e2be0b9e725346c72"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _PoiBattleSimulator: ClassTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 143 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/src/battle/prediction/poi/poi_battle_prediction_engine.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff313dc822016b4a4a23ffa2dd98d8b8287df54684afb21df6dfaef4051f9da"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _FleetMetricsStrip.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/src/toolbox/composition_image_card.dart"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"49188cddb48f7d1fed435e3aead1170dac38e02bd345eb8fd3da982748cb447c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: browser/GameResourceDownloadCoordinator.kt: FileTooLong \u2014 673 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 173 over it, 1.35\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceDownloadCoordinator.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfdae4eec8f98ad5f4271e85ce44a59e079a76479260eb09247e432ee2dbef2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: game_state/game_state_serializer.dart: FileTooLong \u2014 672 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: GameStateSerializer (6-840). The bar is 500 significant lines; this is 172 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/src/game_state/game_state_serializer.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54117b25fe933589f8827ec5c3a9407306c9287ab7d37aeedbda2353d4f55d1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GameModsController: ClassTooLong \u2014 537 significant lines (blank, comment-only and punctuation-only lines excluded), 49 methods. The bar is 400 significant lines; this is 137 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/src/toolbox/game_mods/game_mods_controller.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6f47b5e0704c3b6918313bd90f11c4da3bce7cdfa8c166238118ac03e659aa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AppPalette: 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/src/theme/app_palette.dart"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e4ae6cf7f3eb34c6c81ad1cf8136402e4ffef7b5bbf588d60ea9bcccad6d2c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GameResourceCacheManager.onMethodCall: MethodTooLong \u2014 onMethodCall 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheManager.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91f5ae13074afd7eb9e23326f066b1f99ff19b74667d2c3d475acca76310e06"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _GameWebViewState.initState: MethodTooLong \u2014 initState 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/src/game_webview.dart"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc94a0c142df895f7c0ee3dbcff95006780a2c97f5566b0e17831edaac4dabb9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SenkaCalculatorViewState._reward: MethodTooLong \u2014 _reward 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/src/senka/senka_calculator_view.dart"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"944cc21600c97d7d31648daf747290d785c4f26477def310cf61292ed0747435"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ExpCalcPageState._compactPoint: MethodTooLong \u2014 _compactPoint 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/src/toolbox/exp_calc/exp_calc_page.dart"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab1affa82a70e1eca1171145764ae33f6dce98525a0c95a5d87f6f1b336c184"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _InformationPanelState: ClassTooLong \u2014 531 significant lines (blank, comment-only and punctuation-only lines excluded), 9 methods. The bar is 400 significant lines; this is 131 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/main.dart"},"region":{"startLine":4461}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b2a6333cd4fbd84e990d8b97b53b5b5292d3900b97edb32f0119d9913c2bac"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SortieResourceLedger: ClassTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 129 over it, 1.32\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_resource_ledger.dart"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a66df3a3050caad8e016631065edc9571e1351a63cbf892d3ddd67b4625394c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/operation_status_views.dart: FileTooLong \u2014 660 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 160 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/src/fleet/operation_status_views.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7267c3fed75402f035fbd266b67c17bd074fefc8ef8c66d13f5d00dd39f280"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AttackReport.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/src/logbook/battle_detail_page.dart"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"7555dbd6c0da08044666092c0168dd1b7ad8c2483146e8baea724d0a69262026"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BattleController._applyResult: MethodTooLong \u2014 _applyResult 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/src/battle/battle_controller.dart"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f72d183676d271d8d70714a00fd9a96c1bb3ae85088e3941310ec2c224b793"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _FleetViewState.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/src/fleet/fleet_information_center.dart"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"13accedf08649257ff0f841735f363d8c229274e32dc7faed84de3c9c2e8c29a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GameStateController: ClassTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded), 44 methods. The bar is 400 significant lines; this is 117 over it, 1.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/src/game_state/game_state_controller.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d13e1d71f8ab76cb01d6060c0c6b6f2a1c4fd49f8a2eb3e773a09d23ec1e6a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _FleetShipStatusCapsuleState: ClassTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 116 over it, 1.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/src/fleet/fleet_ship_status_capsule.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4350f5f735574cf1427d9b1cfdd2879e481693e5a8acece9856ca51a7217695"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SenkaState.copyWith: MethodTooLong \u2014 copyWith 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/src/senka/senka_state.dart"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1001f58a9a5390ca9b2ec7d468efd67f88d7fc2db85b3e2535e3cdfc2f21c97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expedition/expedition_check_card.dart: FileTooLong \u2014 642 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 142 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_check_card.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e2eaae96ed8b97a5583cc7148c99095e56becef748157c2ef68e82303af90f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExpeditionStrings: ClassTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 400 significant lines; this is 113 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/src/expedition/expedition_strings.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d5da2495480a5acb9f705a6156e6b9359ffc2f70dd19ec513c1eff39f48292"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/layout_settings_store.dart: FileTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded), about 79% of them inside a single declaration: SharedPreferencesLayoutSettingsStore (175-903). The bar is 500 significant lines; this is 140 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/src/settings/layout_settings_store.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f0a8e3d107d7ad339b80f61be25e6c31bedf9762b7d546ee78ebd2ceded3eb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: YahagiApp.build: MethodTooLong \u2014 build runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\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/main.dart"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c76ea5a2bd5f5da1bf7ad61dafcac4641db33d8da6686270e7b4310b94e979"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SortiePanel._sortieData: MethodTooLong \u2014 _sortieData runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_info_view.dart"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"444e7184ef02c8b1d4a8bdf49716d833e31be51754b7b1df455fff1c8d1517dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SortieExperienceController.accept: MethodTooLong \u2014 accept runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_experience_controller.dart"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfc3c6f59dbefda5b9af6acefbb489bf90348b9f39841e7da2eda3476d5353a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _FleetExportPageState.build: MethodTooLong \u2014 build runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/fleet_export_page.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3a3bddc98e26acb1492d54c73151c001ae0536f56f4c34ef8205eaed8ca763"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sortie_map_query/sortie_map_catalog_store.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/src/toolbox/sortie_map_query/sortie_map_catalog_store.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c787c41b7bf1d057e731bf0940cc7b0977d605e941139abc9d4f298960082a4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ShipSubtitleCatalogController: ClassTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded), 29 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/src/subtitles/ship_subtitle_catalog_controller.dart"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b74c8ff31e6c86d489229ff0af267d0856675c6a1440c9a3c73ea8a9081ce3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _RelationRow.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/src/quest/quest_center_page.dart"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"47160868481ce1eb733f913c4d5765396742d766ff18cb6a875f3b7916713228"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SharedPreferencesLayoutSettingsStore: ClassTooLong \u2014 507 significant lines (blank, comment-only and punctuation-only lines excluded), 77 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/src/settings/layout_settings_store.dart"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a928bf1d578a43649266b5a1e5255ded72ae49cbadc1b0295935de2d80dc3179"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/fleet_ship_minimal_row.dart: FileTooLong \u2014 633 significant lines (blank, comment-only and punctuation-only lines excluded), about 62% of them inside a single declaration: FleetShipMinimalRow (194-704). The bar is 500 significant lines; this is 133 over it, 1.27\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_ship_minimal_row.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc9c183128e911fbcc8194c5d3c8222f9407296acdb6a19d3dbf25455431d60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inventory/ship_equipment_compatibility_drawer.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/src/inventory/ship_equipment_compatibility_drawer.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac966914a3a7d1936640378b7ea1f9dda384cc689fd4f4351108df70a2ed31b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GameModLibrary.scan: MethodTooLong \u2014 scan 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibrary.kt"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9aa90e86a84aa8fdf759e62bc351c0a44265f165da0f53ff96667e74d3f4be6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _GameFullscreenControlsState.build: MethodTooLong \u2014 build 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/src/browser/game_fullscreen_controls.dart"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdbf0d4150f71bf9b2a84634803b975b2af811f5f94fd39493a64fbb7c6bdf7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HdBottomStrip.build: MethodTooLong \u2014 build 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/src/layout/hd_bottom_strip.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a4a1cf168c566aebda86bfd9f2c2854c983b8538cc03949734183dab935d76"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ExpCalcPageState._routePanel: MethodTooLong \u2014 _routePanel 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/src/toolbox/exp_calc/exp_calc_page.dart"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29f74cf97ef406a68854a649f85e6954311aea22ca646795771f51cecb59aea"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BattleDetailReplayBuilder: ClassTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded), 23 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/src/battle/battle_detail_replay_builder.dart"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb6be955675fd21514f731087d790b5f7566c6a43040fd92f068a4bd683e535"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: battle/battle_detail_replay_builder.dart: FileTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: BattleDetailReplayBuilder (10-640). The bar is 500 significant lines; this is 126 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/src/battle/battle_detail_replay_builder.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44aad67c939acf027e5245baf0407ac0b6b16e5196d569da9a9e651dec20b26e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _FleetSummaryMetrics.build: MethodTooLong \u2014 build runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_summary_card.dart"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"b250bf52d7f420467a6b1ced37ce4752fa84c08d8f8f75272467fb71c7fc9cd6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GameStateReducer._start2: MethodTooLong \u2014 _start2 runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"282ad9dd5ff118413d2759be125d627150e3822a6647075d5c6e1a10c734e2f7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GameNotificationCoordinator: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notification/game_notification_coordinator.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e19f1f7771769783e72a38b40f4e73a027d2068d57039d3491caf1fae240e8e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _DevelopmentOutputTableState.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/src/development/development_output_table.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"574b29b8b900ecf0f0e848fa5cf410f5973e7bb107cb93d3c51177c6205f06d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: subtitles/ship_subtitle_catalog_controller.dart: FileTooLong \u2014 614 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: ShipSubtitleCatalogController (46-683). The bar is 500 significant lines; this is 114 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/src/subtitles/ship_subtitle_catalog_controller.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d606d3a84cc6ee93c97f66b670d533f00ea1fe158dca4b54ccf49e76d852c32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: logbook/logbook_event_recorder.dart: FileTooLong \u2014 611 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: LogbookEventRecorder (9-722). The bar is 500 significant lines; this is 111 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/src/logbook/logbook_event_recorder.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbb01fcd455f9f1580dc91dae2de494abf765b145f2a3a173659d0e6c84a85d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GameModPng.inspect: MethodTooLong \u2014 inspect runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModPng.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce8c2ad6ede7f57baf66a0d8f5878e27487e4c16f9bd51785fd7c6d2f1429cd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GameStateSerializer.personalData: MethodTooLong \u2014 personalData runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.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/src/game_state/game_state_serializer.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a645bcb11a0d1e6b0696b4804667d1c7bc57d99cf014c757587907273b05f952"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: battle/battle_pills.dart: FileTooLong \u2014 606 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 106 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_pills.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b02e661ef21225b42749c9850a902622710e1b0d66dfdb5eb6dd8cfba5b990a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CompactFleetGrid.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/src/battle/live_battle_card.dart"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7ea0c9343f1be82ad2e5e6cd5d0475f0633bbc7e2727c59dee097b694134a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _GameBrowserMenu.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/src/browser/game_browser_menu.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"970ac49cffec3909f6ee3e34c956fac6d2bbbfb75bf2f5c7a37a8f89e1fae272"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompactResourceBarState._buildBar: MethodTooLong \u2014 _buildBar 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/src/fleet/resource_grid.dart"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1bba600736a08c241216a4d364655c23f44130bfc689993cc68a51dd33504c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ShipSubtitleCatalogController.load: MethodTooLong \u2014 load 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/src/subtitles/ship_subtitle_catalog_controller.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d91a2b864d983eb9fb9416ac61352dbd639772d275d8e2347631e714fa2eca1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _EquipmentRow.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/src/toolbox/composition_image_card.dart"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd2ca286bcb3c08c5112690d4867bf042e72f4b97b067756671f23f5fcea827"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/resource_trend_page.dart: FileTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 104 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/resource_trend_page.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b108656e7f88b96f651bbaa8b5de4bc2d582563010f506c36c836bb0de7e6f26"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/anchorage_repair_view.dart: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 101 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/src/fleet/anchorage_repair_view.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3975a8316251f3bbacdb21555ab071be1524286d133fd854682d4642a5e73a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RecordBackupHandler: 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/RecordBackupHandler.kt"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"754a5e5be3d0dae4f1680bf208480d7573810cab74e6a0279c8934bc4f65750d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GameResourceCacheIndex: 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheIndex.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d533d5f31823292740601d7ee92bc4ebb978eef7e90c0bde9a9184384a32f9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _YahagiShellState: 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/main.dart"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"390208e0959b20101de1b0587d686768478a543863855438f40d72a4060abfa6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NativeGameSurfaceSlotState: 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/src/browser/native_game_surface_slot.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f58b2bca2a212c2a46e0b8d0804f057470f1399f5df7e1278b41ad1edac82d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MethodChannelNativeGameWebViewPort: 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/src/browser/native_game_webview_port.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7464a2318400d6f3db7d9393737657bd0014b7714cafe9162c7085e6cc6a1af0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SenkaController: 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/src/senka/senka_controller.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b27f9c3c34418529c92e68e15758033f038f20f19a9b69f8f547393837fcb08"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _DevelopmentEquipmentPickerState.build: MethodTooLong \u2014 build 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/src/development/development_equipment_picker.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3994d497e6014a70b65c2bde0806faae4b5f0c2d72b8eb8bd7157a1aac08ee47"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: quest/quest_completion_drawer.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/src/quest/quest_completion_drawer.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88da510970300df7576852b18ba048eae01402c206acca2a97ff48124c3bf9f6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DevelopmentRecipeTable.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/src/development/development_recipe_table.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0106cc24b22e77b193be6bd1505e722504e7a388318362e8be1e673e72e66c8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _EquipmentCompatibilityDrawerState.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/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"abacce4870302350ee581e946343f170f6b3944c24c0206c59d6f46331dee6ad"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _EquipmentInventoryTableState.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/src/inventory/owned_inventory_page.dart"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edf613e077870b6b12663b74cd0a9a334e72db7e49866d08d03780436026e0b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GameRuntimeSettingsPage.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/src/settings/game_runtime_settings_page.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a25ef472999c5f73714ad9b01249c93785296cc01b70a22ebccd9714e9b93f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: browser/native_game_surface_slot.dart: FileTooLong \u2014 592 significant lines (blank, comment-only and punctuation-only lines excluded), about 77% of them inside a single declaration: NativeGameSurfaceSlotState (108-709). The bar is 500 significant lines; this is 92 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/src/browser/native_game_surface_slot.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66af844a6211ae6035dad465a77d3f8f43ca3e14a11b797ae34768b366ea77e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: notice/game_info_notice_controller.dart: FileTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: GameInfoNoticeController (32-819). 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/src/notice/game_info_notice_controller.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99433e104418a367ebf0523370c875d00555a934be68446102b3359b9e879ce7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _BattleResultWarningOverlayState: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/battle_result_warning_overlay.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed45c1783c649d41ba279af30e9da7cc941f8e9e5a092037d612e783cb695b5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExpeditionStrings: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_strings.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"734af8facb39e973c920b5db039d9b4be9ed4b11ede46ff436bfc2704dd8d40b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: poi/poi_battle_prediction_engine.dart: FileTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: _PoiBattleSimulator (55-759). 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/src/battle/prediction/poi/poi_battle_prediction_engine.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83e00341ead1634a07d16f392a1bb102b26db3d2cd31c7a5190584d6f130a1a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ShipMoraleMark.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/src/fleet/ship_status_visuals.dart"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4e95ca14d978f7f08d0eaece94ef0c7f99dc2cd5c99a2f9c76c5d3193d22fb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ScreenSettingsPage: ClassTooLong \u2014 459 significant lines (blank, comment-only and punctuation-only lines excluded), 5 methods. The bar is 400 significant lines; this is 59 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/src/settings/screen_settings_page.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29283aaae7158d7b32540eb67268fb3bbda8d94d32a5c600ce58e5934fe819a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/fleet_summary_card.dart: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 73 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/src/fleet/fleet_summary_card.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b70aeb638d37f16a0ecb4f4ab8df91e737463a7f2ca71b89370aa4b4c884f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/pre_sortie_check_summary.dart: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 73 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/src/fleet/pre_sortie_check_summary.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d6b5201e8570daefeeea61f6d452eca11c73dd2bc59343e5cf936dd96ff6f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/network_settings_section.dart: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: _NetworkSettingsSectionState (28-675). The bar is 500 significant lines; this is 73 over it, 1.15\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/network_settings_section.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd1cb2977cfea3bf54ead2604d0196a70d8b2199d0b8dfd7f6637c7145011ba"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _NetworkSettingsSectionState: ClassTooLong \u2014 458 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 58 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/src/settings/network_settings_section.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c05784c51668114861d61c53d8d9d949a7d36553e4ac08d508881747c965a6c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SelectedEquipmentDetails.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/src/fleet/fleet_information_center.dart"},"region":{"startLine":1851}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0ae04301419bda72969d026e4fe2ffa8e2df18d6ec376a7158bc3515e2b760"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _RepairCapsule.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/src/fleet/repair_summary_card.dart"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c512f5916a1fbfa31508aa9d0e9841a182ae5b37b09b740aaa5debc451d640"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NativeGameSurfaceSlotState: ClassTooLong \u2014 455 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 55 over it, 1.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/native_game_surface_slot.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bb40492e6cae57315bb0b40d2b6234b7668e77e08debf1404d303cabab05a8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GameResourceDownloadCoordinator: 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceDownloadCoordinator.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfc495639e64c04c099de43547618474453ed2d56edfd5e59547bf773833a4f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BattleController._reduce: MethodTooLong \u2014 _reduce 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/src/battle/battle_controller.dart"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"8815ebc635bef95a4235d8872c9fe0282d60a3f57cc43de5c7bdbb3e7950c761"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImprovementRawBundle.normalize: MethodTooLong \u2014 normalize 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/src/improvement/improvement_raw_bundle.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f16a194c18a1d4070eb63dc25840e53007811c05435f5b83881e18469e1e51f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ShipEquipmentCompatibilityDrawerState.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/src/inventory/ship_equipment_compatibility_drawer.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a453f65277bbe4a7caeef37f2ba64e778b54649d4851cfca0cf16488cf114f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backup/RecordBackupHandler.kt: FileTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: exportStore (27-797). The bar is 500 significant lines; this is 60 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/RecordBackupHandler.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2acf2912efaedb3430f58bc82828a2bf872629ef837bcff649ea57933005a1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RecordBackupService.restore: MethodTooLong \u2014 restore 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/src/backup/record_backup.dart"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba0e5e6d1115ed00fcf417ffae14f40c343903abf7fa6ed90db871d86dbf0c9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _MapPainter.paint: MethodTooLong \u2014 paint 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/src/battle/sortie_map_section.dart"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"671c9c673f7090d619e745c492a3de614a55a71caddc6612b39db2a005f201ed"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SenkaReducer: ClassTooLong \u2014 446 significant lines (blank, comment-only and punctuation-only lines excluded), 16 methods. The bar is 400 significant lines; this is 46 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/src/senka/senka_reducer.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f753ad123f552e0ae6034feac4efbda01d6726dac3d2a1725119bec2ed32cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GameStateReducer._parseShips: MethodTooLong \u2014 _parseShips 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/src/game_state/game_state_reducer.dart"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e36147cad4a54769b2e31d2732af3b6f3911c44aee594d68488c0cf027ab5a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _NativeActivityGameSurfaceState._dispatchCurrentEvent: MethodTooLong \u2014 _dispatchCurrentEvent 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/src/native_activity_game_surface.dart"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92d000a83e1865eeff1dfb3b4e27303610de5fd7a6d6814d09bb8416386a0dd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _QuestQueryDialogState.build: MethodTooLong \u2014 build 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/src/quest/quest_query_controls.dart"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e8a2777016c412c44ad72911011f8b255e3c8e2415c2f14ca1007963db415a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _BattlePredictionOrderSheetState.build: MethodTooLong \u2014 build 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/src/settings/battle_prediction_settings_section.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afe19e28c6b6d0c10558dff1c585a460d66286510526bd4472ced4b27357f10"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppPalette._mapped: MethodTooLong \u2014 _mapped 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/src/theme/app_palette.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fa3ceeb9a7ba5ba77b45564b542f2dc43e8eced1318edb55b07f49d0883c42"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layout/workspace_context_header.dart: FileTooLong \u2014 551 significant lines (blank, comment-only and punctuation-only lines excluded), about 64% of them inside a single declaration: WorkspaceContextHeader (31-498). The bar is 500 significant lines; this is 51 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/src/layout/workspace_context_header.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd378bb4d71cef97ec31c16f703c23f397059943be84e7a20638cfdd1567af8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: game_state/game_state_controller.dart: FileTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: GameStateController (24-709). The bar is 500 significant lines; this is 50 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/src/game_state/game_state_controller.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e393b2bae7594b17ea4d3acd2e4ce7113c28e87dfbdc6411c6073103c804c5b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExpeditionEvaluator._evaluateRequirement: MethodTooLong \u2014 _evaluateRequirement runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_evaluator.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91386709965a885561c894458a54a106c7cc5905f08e50f81355854bd614ef6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/detail_parser.dart: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 46 over it, 1.09\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/akashi_bonus/lib/detail_parser.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e363022691a036170732a35b86d84899b3930280a2b4ca85cede65baa05203"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: game_mods/game_mods_controller.dart: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: GameModsController (12-712). 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/src/toolbox/game_mods/game_mods_controller.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f77ae56469241f1c923b692326bb3056b4555f924b6fef26a85b73366b2a9a2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DataSettingsPage: ClassTooLong \u2014 433 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 33 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/src/settings/data_settings_page.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f978fdc8bbffe577e3a956fa46c15acb3d506cf0c06a5dc9987bffc46d61ca57"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _OwnedInventoryPageState: ClassTooLong \u2014 430 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 30 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/src/inventory/owned_inventory_page.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98223dec5bf26fb9a26c6e895d2272db4820933c9a3cde7434b051dfca880a9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SenkaController: ClassTooLong \u2014 428 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 28 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_controller.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2987907a14e2a0156d6ba8a8b261263830a514da628065d4e0e02722cb9fdda"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GameStateReducer._battleResult: MethodTooLong \u2014 _battleResult runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":3070}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68660fad4a517b5af12f7af25a4d547729d9f5aa479cafb2e63704a67ed8b90"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ServerOverview.build: MethodTooLong \u2014 build runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_info_view.dart"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8b041bf71e557bd246c03822885f4c5c281e6cbdd70a105177dfbcb5b67c93"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _PoiBattleSimulator: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d42b4850d77c86984c97396d456118608cc014a54919da44ddc8199dcb30b2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExpCalcStrings: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/exp_calc/exp_calc_strings.dart"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07e33f470eea7a3e24f51e640bca47ccebf4008fcc529eff67f4b5777c0baae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: battle/battle_ship_details_popover.dart: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 30 over it, 1.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":"lib/src/battle/battle_ship_details_popover.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7235c880d0d230da1eac556c282e2bd51345591ce5dda949f8a227b76958783"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _BattleShipRow.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/src/battle/detailed_battle_panel.dart"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f32f06b23c4e5853381281450a2c2d06c6b96bb7c7b64d9bb6f50902ec22ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _PreSortieCheckSummaryState._buildShipsCheckView: MethodTooLong \u2014 _buildShipsCheckView runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/pre_sortie_check_summary.dart"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"7534cc539011f714f27da595c40a571e6ee46854eef0e76ab9774cfff3d28d7c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GameCaptureController: ClassTooLong \u2014 420 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 20 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/src/capture/game_capture_controller.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac78c7f8baa39e2f1990bd20edee2a748a4d04703d4cc8da25a6aee15f0915e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeGameWarningDialogChannel.renderChecklist: MethodTooLong \u2014 renderChecklist 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogChannel.kt"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"3834ed0416b5b9a346deeb8aa6334ab6f8a81bdecf6301bf77b5daca2343e9d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: battle/detailed_battle_panel.dart: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 23 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/detailed_battle_panel.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c073869444b3416fb0c4fa380989e125bdb33351658e67940ff541a107ddbb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DashboardCard.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/src/fleet/dashboard_card.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8405d1a1938413da878c7edbcc7b471c3b89b0eff60584199706e2a602d298"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompactResourceBarState._buildGrid: MethodTooLong \u2014 _buildGrid 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/src/fleet/resource_grid.dart"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"6055afb094eca014f7530d31d5c24b7e2decdc531641224ac84ef09ead27d7f1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GadgetBypassWebViewClient: 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GadgetBypassWebViewClient.kt"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5bb79b070c4cc7e1c5092f35e3236fa72eecaf35c9aa2089b49a88cef4481c0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GameBrowserController: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/game_browser_controller.dart"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c3ed3fd6e74c440a2bcc65e1c93bb5834912f82a0ab59fd88b8a97bc4a9ff0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GameCaptureController: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/game_capture_controller.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"839114095c7d466bda7fd98d3f8ee6cbd00c2625b234196d1e59b3c31d761f5d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LogbookEventRecorder: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_event_recorder.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f662ddf26921952cb2a413bbe009451776ac0626c5d7a776f37f4318cb2c76d6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _GameModsPageState: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe478733b648c6c6082a31bf8f0ea0c522801292772ce2c0380ee0c81bfb948"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SortieMapQueryStrings: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/sortie_map_query_strings.dart"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0a266b128ee90c4a0c2f6e52b4a4abfdb69bc472af0906b09010cb042f3f86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expedition/expedition_strings.dart: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: ExpeditionStrings (6-551). The bar is 500 significant lines; this is 16 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/src/expedition/expedition_strings.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4abe51dbf2893eb66a4204a416ff0bb76fc7f56d3e63b90b66d5cbf517e4a34"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _EquipmentCard.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/src/fleet/fleet_information_center.dart"},"region":{"startLine":3278}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd8dfa8e56b6604959bc7e877758e415c3ed6f87c482a6d5027f9d89451b7e8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: YahagiApp: ClassTooLong \u2014 410 significant lines (blank, comment-only and punctuation-only lines excluded), 8 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/main.dart"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"278b4fe62f95e610b782b1be4cde3f3426c440943d744077e10b9aaaa83e08f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/nosaki_sparkle_view.dart: FileTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 10 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/src/fleet/nosaki_sparkle_view.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a3434e72d9f43fef9e4bf4b266d6cbaccbb1ec5297c802e261916fc6ac7ac3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GameStateController.accept: MethodTooLong \u2014 accept 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/src/game_state/game_state_controller.dart"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"9427c9e06ff3ee6d7d27fbb2f13c1cacdcd52b7d5d7da225b87eeed1dfeebf88"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _NotificationSettingsPageState: ClassTooLong \u2014 406 significant lines (blank, comment-only and punctuation-only lines excluded), 11 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/src/settings/notification_settings_page.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca2ecc8dcf2be29d12a45ea699d5f4a029b8d755a57021e5d0f13cffeb3d0be"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Companion.parse: MethodTooLong \u2014 parse 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogState.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"68bb6d530185411dd6dac0beb08c884be70381ef42801167603300c455504d5b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _CustomFontSettingsSectionState.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/src/settings/custom_font_settings_section.dart"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1634b8e7113cb5f778f8042e171b223bd778f50b29db97d2f2409d5697e98e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (54 shared lines): lib/src/inventory/equipment_compatibility_drawer.dart:763-889 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:718-834 \u2014 These two members are variants of one another: 54 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/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acefbbc13d54ac4d95f41dc26cd98554fe725eab288f83d28fb1ace7a1c4a82"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): lib/src/fleet/anchorage_repair_view.dart:780-816 | lib/src/fleet/fleet_information_center.dart:1319-1339 | lib/src/fleet/fleet_ship_status_capsule.dart:738-757 | lib/src/fleet/land_base_summary_card.dart:519-537 | lib/src/fleet/land_base_summary_card.dart:579-596 | lib/src/fleet/nosaki_sparkle_view.dart:661-697 | lib/src/logbook/battle_detail_page.dart:494-511 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/anchorage_repair_view.dart"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cb4a7a5787e6d5c75ec962ff297e7febfb4964238028b90639d04c58f50b7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): lib/src/settings/enemy_catalog_update_section.dart:16-66 | lib/src/settings/fcd_map_update_section.dart:15-64 | lib/src/settings/quest_catalog_update_section.dart:15-64 | lib/src/settings/sortie_map_catalog_update_section.dart:16-68 | lib/src/subtitles/ship_subtitle_update_section.dart:14-72 \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/src/settings/enemy_catalog_update_section.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb16f7ce60ee3c23aa9202d69760bd7d6cf12cc2d12c6c306457a98bb8fdaed"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/src/localization/record_backup_strings.dart:11-21 | lib/src/toolbox/composition_image_strings.dart:16-26 | lib/src/toolbox/exp_calc/exp_calc_strings.dart:7-17 | lib/src/toolbox/sortie_map_query/sortie_map_query_strings.dart:15-25 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/localization/record_backup_strings.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"768e12a0afc2d40449ae04652fb34b9488fbd20bcc4567e300ade28a04c4944d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/src/settings/about_support_settings_page.dart:50-74 | lib/src/settings/battle_settings_page.dart:27-329 | lib/src/settings/network_settings_page_new.dart:42-104 | lib/src/settings/sound_settings_page.dart:14-53 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/about_support_settings_page.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e0a34e2ac6f6fe411f28ad338f1271cc0c0f1eb8d394400e346ff4241a6736"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/src/settings/display_mode_section.dart:12-62 | lib/src/settings/enemy_catalog_update_section.dart:16-66 | lib/src/settings/game_frame_rate_settings_section.dart:16-80 | lib/src/settings/sortie_map_catalog_update_section.dart:16-68 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/display_mode_section.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc89b512cbf5342fa394824911c1752e5cf43ee938ddf9c422bcf2446b670df5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (153 corresponding lines): lib/src/inventory/equipment_compatibility_drawer.dart:57-217 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:59-211 \u2014 These two members are one piece of code written twice and then edited apart: 153 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dad403066b01de2430b47629622932c5f821085f915b16e511fa04f9e095761"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): lib/src/subtitles/ship_subtitle_kc3_update_service.dart:139-207 | lib/src/subtitles/ship_subtitle_update_service.dart:225-299 \u2014 These two members are one piece of code written twice and then edited apart: 69 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_kc3_update_service.dart"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"2942e917e9095bf86f5db0bfe942cbaaa994316fab4881df890cec01ad44fb38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): lib/src/fleet/repair_summary_card.dart:315-384 | lib/src/fleet/repair_summary_card.dart:427-496 \u2014 These two members are one piece of code written twice and then edited apart: 70 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/repair_summary_card.dart"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8767ddf978c1ba72f1f4f1fe441369de5d8faccd100446a4bf551d595a80fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (93 corresponding lines): lib/src/inventory/equipment_compatibility_drawer.dart:463-555 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:387-479 \u2014 These two members are one piece of code written twice and then edited apart: 93 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"711bb4a70f33bbb8b7994eba0fafcabae6ec317fca9b41ee32bd29a7edc91a16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): lib/src/toolbox/sortie_map_query/enemy_catalog_update_service.dart:164-235 | lib/src/toolbox/sortie_map_query/sortie_map_catalog_update_service.dart:206-286 \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/src/toolbox/sortie_map_query/enemy_catalog_update_service.dart"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"0486fbd791979a14290b069894a50d122441f2cb46261ffcf92405caf72f06b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (73 corresponding lines): lib/src/fleet/anchorage_repair_view.dart:344-416 | lib/src/fleet/nosaki_sparkle_view.dart:64-136 \u2014 These two members are one piece of code written twice and then edited apart: 73 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/anchorage_repair_view.dart"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedfe83f886721c3c3510fb23faaf10160e8600b2b0ce86e9b75daa424350eb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): lib/src/fleet/repair_summary_card.dart:268-313 | lib/src/fleet/repair_summary_card.dart:386-425 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/repair_summary_card.dart"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dd1dab81ab7b8c8a3d1dbea512bf4677e15a7dcc45d237c7203fcc87e7a1cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibraryCoordinator.kt:216-239 | android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModRepository.kt:713-740 \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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibraryCoordinator.kt"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee94a5d25aa2f3e89f0daae32e9b1e76d5c7bd9ccea15596923edbb709735d1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): lib/src/improvement/improvement_dataset_update_section.dart:14-65 | lib/src/settings/quest_progress_update_section.dart:14-76 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/improvement/improvement_dataset_update_section.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0198166c1ee7ab13b0f04c26b7f0213fdaf4c31ac6e232ae131beddd5ac44430"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): lib/src/battle/battle_pills.dart:651-700 | lib/src/battle/battle_pills.dart:708-751 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_pills.dart"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e36afeecd72b1705dcb9bc4a58d6f6b844904270ca4473c156b5da2a5ebb6fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): lib/src/battle/fcd_map_update_service.dart:244-286 | lib/src/quest/quest_progress_update_service.dart:210-261 \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/src/battle/fcd_map_update_service.dart"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f41396a9a1b3a1d28e6e7f782f9db910d93752c70341422a14dacd9df7d6d81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): lib/src/battle/live_battle_card.dart:266-315 | lib/src/fleet/pre_sortie_check_summary.dart:486-530 \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/src/battle/live_battle_card.dart"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e63a53cffc541d8f7105aeda9107cd766b62ab4409540515d26befba8df6a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): lib/src/game_state/game_state_reducer.dart:1996-2031 | lib/src/game_state/game_state_reducer.dart:2045-2088 \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/src/game_state/game_state_reducer.dart"},"region":{"startLine":1996}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b22e7ceb95d24c538755b01d6309b597800d6f0ae96306752efdb17988472df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 51\u002B corresponding lines): lib/src/settings/game_connector_section.dart:56-106 | lib/src/settings/game_rendering_mode_section.dart:75-127 | lib/src/settings/game_resource_cache_section.dart:268-324 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 51 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/game_connector_section.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"386fd5ad0006f8a6abc00dcf221d197669cdf1cea9925fdb6ff191f8db9345b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): lib/src/layout/workspace_context_header.dart:510-555 | lib/src/layout/workspace_context_header.dart:567-607 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/layout/workspace_context_header.dart"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f35b336e564c04d274caddf7c19b345c79caccb2c1eb0076baf54842ac3f998"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): lib/src/settings/enemy_catalog_update_section.dart:68-98 | lib/src/subtitles/ship_subtitle_update_section.dart:74-117 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/enemy_catalog_update_section.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c1d30fc8003627ae31835967ee02f1a2dabb347977d165ff18a9ea07c69f6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): lib/src/fleet/resource_grid.dart:1039-1079 | lib/src/fleet/resource_grid.dart:1081-1136 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/resource_grid.dart"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed37281a65449e704ae386866f93a2ce67c3aa1c620ee3a3a86168c809b68b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): lib/src/senka/base_senka_section.dart:58-92 | lib/src/settings/network_settings_page_new.dart:106-150 \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/src/senka/base_senka_section.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0432b747358290dedad015253a9595ce076fcc8dc8e25e2c013e6683bf53786"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): lib/src/fleet/anchorage_repair_view.dart:548-580 | lib/src/fleet/nosaki_sparkle_view.dart:335-367 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/anchorage_repair_view.dart"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eebd25919ec3e95f884ce6643740e72863325abdfa6dc377ca8986b11b080aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 31\u002B corresponding lines): lib/src/improvement/improvement_dataset_update_section.dart:67-97 | lib/src/settings/quest_catalog_update_section.dart:66-97 | lib/src/settings/quest_progress_update_section.dart:78-109 | lib/src/settings/sortie_map_catalog_update_section.dart:70-106 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/improvement/improvement_dataset_update_section.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36582a8bc11050c509bf9178d2fb944b19cdb3b613183bf6dbe01ae4d88babc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): lib/src/battle/fcd_map_store.dart:240-267 | lib/src/quest/quest_catalog_store.dart:352-371 | lib/src/toolbox/sortie_map_query/enemy_catalog_store.dart:55-76 \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/src/battle/fcd_map_store.dart"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41537949ee690a84a4e1d0736b35505c919f6da916c1b957c97e08895d718e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt:1950-1981 | android/app/src/main/kotlin/app/yahagi/kancollebrowser/composition/CompositionImageHandler.kt:165-196 \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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa46d008888d9e12c74fa77c4da0b16eee4153d31c0f2fd56454c4736a75452"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 35\u002B corresponding lines): lib/src/settings/diagnostic_user_section.dart:98-136 | lib/src/settings/diagnostic_user_section.dart:138-173 | lib/src/settings/diagnostic_user_section.dart:175-209 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 35 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/diagnostic_user_section.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c2c8ad151fc065a894f4a4fe39abef04b2c5c4092d2adfe6086a5dd17794be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): lib/src/improvement/improvement_dataset_update_service.dart:123-146 | lib/src/quest/quest_catalog_update_service.dart:214-243 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/improvement/improvement_dataset_update_service.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ad0af1937567964863ca3ccd379e74d78a7e10bdac1a6a76285b20dce81e97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): lib/src/capture/game_capture_controller.dart:494-523 | lib/src/game_state/game_api_event_pipeline.dart:139-174 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/game_capture_controller.dart"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"111f81b31e82aba4126e34ee820ce24fb95409a246142ecf3b6ad69d0cae9754"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): lib/src/fleet/fleet_summary_card.dart:356-394 | lib/src/sortie_experience/sortie_experience_card.dart:1138-1180 \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/src/fleet/fleet_summary_card.dart"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b865968789d1b5f9f6f8b7c2ee254da8088d8974a64508c39907a15311170295"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): lib/src/fleet/operation_status_views.dart:662-704 | lib/src/fleet/operation_status_views.dart:720-763 \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/src/fleet/operation_status_views.dart"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"070fa914c66d7a8d09c1c424eb09293c9e13f78caaabcf4a7985753ad929d329"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): lib/src/game_webview.dart:656-688 | lib/src/native_activity_game_surface.dart:882-925 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_webview.dart"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8602972ebda1361706c5e954c195348b3f8005ebee3f108dd6f8db44411a0cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): lib/src/quest/quest_center_page.dart:1636-1679 | lib/src/quest/quest_center_page.dart:1687-1725 \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/src/quest/quest_center_page.dart"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"66386d712ccc24fb70c6f6c3f45f11428330b26ee14655a11443a35b3b2231f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): lib/src/fleet/ship_portrait.dart:138-168 | lib/src/fleet/slot_item_portrait.dart:10-34 \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/src/fleet/ship_portrait.dart"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b35826f03301ea2f2da5eb977006dc4cf087fa44682e13671ec6c853ff4d27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): lib/src/inventory/equipment_compatibility_drawer.dart:423-455 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:348-379 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d98091951f03a8e319ada911c9e9534c653a0721b5eabdd4780839c53c15e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): lib/src/fleet/fleet_information_center.dart:1365-1413 | lib/src/fleet/fleet_information_center.dart:3532-3575 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_information_center.dart"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53ec9ed414bc3c9c2b46618317d05881dbdc93cefd72711f1376a8b0995da46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): lib/src/inventory/equipment_compatibility_drawer.dart:587-618 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:514-545 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"43be5b4855b7df33c9014c2e942778697bb08417c0cb24df670b985d40fa2ff8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): lib/src/layout/flat_text_toggle.dart:27-75 | lib/src/layout/flat_underline_tabs.dart:16-62 \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/src/layout/flat_text_toggle.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d402c5cb777d6e52f40fbde29313d9a92de2d67574f0d36c56de2a6ece03d72b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): lib/src/inventory/owned_inventory_page.dart:614-646 | lib/src/inventory/owned_inventory_page.dart:1123-1155 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/owned_inventory_page.dart"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9dde103c4a4a3583abc7c0cd5f994a061ded9d8dc2a5f0f6daae7b75cb3e82a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): lib/src/game_state/game_state_reducer.dart:2754-2775 | lib/src/game_state/game_state_reducer.dart:2777-2805 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":2754}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b7130e35505f49081c6e1348680d6c76b56368e370988318532aed2a7d6c86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/src/backup/record_backup.dart:1932-1952 | lib/src/backup/record_backup.dart:1954-1980 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/backup/record_backup.dart"},"region":{"startLine":1932}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ded65bc0fe85077a46b5be8a21b78bbd211c7f2127b4678c47d439ac2f8162a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): lib/src/subtitles/ship_subtitle_catalog_store.dart:51-80 | lib/src/subtitles/ship_subtitle_kc3_store.dart:48-77 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_catalog_store.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a97c2a4f10229f08f4b5ff31c77b62e0d1a4d86d46afba98c35fb50ed0902b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWebViewChannel.kt:762-805 | android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWebViewChannel.kt:811-852 \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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWebViewChannel.kt"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f3999ea6c205866d80cb5bb6cd231f373c08f61dab7d62ee5221ba146a8143"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): lib/src/inventory/equipment_compatibility_drawer.dart:229-250 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:223-248 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebba3566b6e0dcf8fc01c4f49a31bbc6a1e6f4396b9c70af3f6029a17d27be7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): lib/src/inventory/owned_inventory_page.dart:1368-1406 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:627-660 \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/src/inventory/owned_inventory_page.dart"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c5952718675e9eb856cbe877be4bea5d61a8bfd9a19b4850c501141f05f9ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): lib/src/inventory/owned_inventory_sort_state.dart:26-50 | lib/src/inventory/owned_inventory_sort_state.dart:98-122 \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/src/inventory/owned_inventory_sort_state.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ddc7edb5ff1fba158d3f4110e10fc525de9c30770ecd3282f02f2c683b7ead"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/RecordBackupHandler.kt:540-562 | android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/RecordBackupHandler.kt:593-612 \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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/RecordBackupHandler.kt"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a180da38077ac9563d90162bc81130e4af289ad4adca69adc2bd7981b53a74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): lib/src/settings/app_exit_settings_section.dart:12-36 | lib/src/settings/game_mouse_wheel_settings_section.dart:11-35 \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/src/settings/app_exit_settings_section.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"91500ec5eda2766cc4b04ceac5ea57666798260ee6b0df128d4a39569c5888e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): lib/src/battle/battle_records_page.dart:134-164 | lib/src/fleet/fleet_information_center.dart:308-336 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_records_page.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa22f71508bef1ca69044a0443d33dd31eb594c9afc7996382d699628abd7de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): lib/src/inventory/equipment_compatibility_drawer.dart:663-694 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:588-613 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"da35c2a99c9b7a6a7b139393c77d5057582985f0fbba9914b7b14f407b724345"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/src/fleet/operation_status_views.dart:108-126 | lib/src/fleet/operation_status_views.dart:263-281 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/operation_status_views.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d3917bb23760192144a24869e991c4d6f080bd9e2e5aa9f589fdcc14e3bf20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): lib/src/settings/game_resource_cache_section.dart:376-403 | lib/src/toolbox/game_mods/game_mods_page.dart:1982-2009 \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/src/settings/game_resource_cache_section.dart"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fdcfca6b8235fff4f154d31aec63952c1a26c13485d2a3a0f1999a96a8afa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): lib/src/game_state/game_state_reducer.dart:2452-2466 | lib/src/game_state/game_state_reducer.dart:2497-2508 | lib/src/game_state/game_state_serializer.dart:830-839 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":2452}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6cc21bf709efcae2fe8c54b43f2ac26df1da67172bd17ad195d2616683a953"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/src/backup/record_backup.dart:1436-1451 | lib/src/backup/record_backup.dart:1453-1465 \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/src/backup/record_backup.dart"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf0b5fcdc1a7a440cb841ab59ae44407be1b9564c448bb76f42a14dac2d831d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/src/expedition/expedition_check_card.dart:66-83 | lib/src/expedition/expedition_check_page.dart:79-96 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_check_card.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e5859e6c8840acb42c14cc524ff38cedee74401fcb0d0a22890a484111a625"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/src/game_state/game_state_reducer.dart:2399-2417 | lib/src/game_state/game_state_reducer.dart:2704-2722 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d13e008474dd4bddcb5c8acd1219cc071fe185ea6f2c28561783140e871279"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): lib/src/logbook/logbook_database.dart:1362-1396 | lib/src/logbook/logbook_database.dart:1617-1643 \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/src/logbook/logbook_database.dart"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dca6009da85ca7b0dace4fadd2fc4fc45ee330feb4fc8aff62bb1a015b1ae14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/src/subtitles/ship_subtitle_catalog_store.dart:111-126 | lib/src/subtitles/ship_subtitle_kc3_store.dart:108-122 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_catalog_store.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14cb74ee91fd2f2a4759d3e1c03c829b8ad2997de5dd111f55a93d750aa6e8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): lib/src/inventory/owned_inventory_page.dart:2292-2312 | lib/src/logbook/logbook_page.dart:1740-1762 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/owned_inventory_page.dart"},"region":{"startLine":2292}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ee664d7d07d6ef17d654407bf7d0bda9e47cf33458a242fec03edcf30ce84b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/src/inventory/owned_inventory_sort_state.dart:52-72 | lib/src/inventory/owned_inventory_sort_state.dart:124-141 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/owned_inventory_sort_state.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b04faffbb9946e6b2d4885e4237d1087b1852c61abae784f9e37295dcf30436"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart:225-238 | lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart:311-325 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"523b41127532fa3c097fec55970c96a68d11a2293910a6c5a0e8c01b90edc2b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): lib/src/battle/battle_pills.dart:621-643 | lib/src/fleet/land_base_summary_card.dart:545-566 | lib/src/improvement/improvement_planner_view.dart:1040-1060 | lib/src/toolbox/fleet_export_page.dart:325-343 \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/src/battle/battle_pills.dart"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c8c815ae5be239fd241caae06701629134dfbed30adccf5d0a96c316f34600"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): lib/src/battle/battle_pills.dart:590-613 | lib/src/battle/battle_pills.dart:762-784 | lib/src/battle/battle_pills.dart:819-844 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_pills.dart"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22d302537353cc9fe71a2f78c1879b7e43dc2c4783bf7b910742b79c99e284f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): lib/src/inventory/equipment_compatibility_drawer.dart:897-920 | lib/src/inventory/equipment_compatibility_drawer.dart:926-947 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bad37b2a3b7306d37c7c9d562c38ff37b71c11f571944e5ecf3f5407b40f83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/src/game_state/game_state_reducer.dart:2839-2852 | lib/src/game_state/game_state_serializer.dart:778-794 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":2839}}}],"partialFingerprints":{"codehealthFindingId/v1":"61834764d3716783103a12e153d561cb55b89c04ba178d157d8e7ead1cb0e4f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): lib/src/toolbox/game_mods/game_mods_strings.dart:49-68 | lib/src/toolbox/game_mods/game_mods_strings.dart:957-980 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_strings.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f80ac8a621ccc8cd95c44c14f37e6ec87d84804be2e6a57961e49c590fc9507"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): lib/src/battle/fcd_map_update_service.dart:160-181 | lib/src/quest/quest_catalog_update_service.dart:245-266 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/fcd_map_update_service.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbeac6aefc97698e1249efa0923a4fd688390fcaee99cc89ef957e460c472bba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 20\u002B corresponding lines): lib/src/fleet/game_mod_portraits.dart:25-44 | lib/src/settings/battle_prediction_settings.dart:130-154 | lib/src/settings/layout_settings_store.dart:211-230 | lib/src/settings/layout_settings_store.dart:242-264 | lib/src/settings/layout_settings_store.dart:475-494 | lib/src/settings/layout_settings_store.dart:858-878 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/game_mod_portraits.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce4a1f2dbbe72f8cf5ed08542aa4a21851e58e81234825c094f60e6fdce3d65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/src/senka/senka_controller.dart:318-327 | lib/src/senka/senka_controller.dart:329-338 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_controller.dart"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf03e21433e000a8be6ea7a3badd42e818c9c3cb33a2d9d50879f25f2949db15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/src/backup/record_backup.dart:825-840 | lib/src/backup/record_backup.dart:842-858 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/backup/record_backup.dart"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d97bec3ce3555a2bcacd07933ee2bb5b896ddccdef55e6b91749e714f9cf49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/src/logbook/logbook_database.dart:1645-1657 | lib/src/logbook/logbook_database.dart:1686-1698 \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/src/logbook/logbook_database.dart"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad1f0a775b2f16eb8c6148ac9a87fc005b2ce38cf11c6d716a22e9aa369eebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/src/fleet/fleet_ship_minimal_row.dart:797-814 | lib/src/quest/quest_center_page.dart:1614-1628 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_ship_minimal_row.dart"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c323e329def793cd91dfdfc2a91ed0d07a8b9301c9a7e00ee40c0546f6d322"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/src/senka/senka_controller.dart:416-424 | lib/src/senka/senka_controller.dart:426-434 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_controller.dart"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d6da87c6bfba0fd39ade8e8c1e0cf0a38d81cca24092966c92bdf7e8fb9310"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/src/toolbox/game_mods/game_mods_page.dart:2010-2024 | lib/src/toolbox/game_mods/game_mods_page.dart:2026-2040 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc0a0d3ba96876e891f08fed32d7f2988f0f4846853be781d81b109c607797a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): lib/src/game_webview.dart:1506-1530 | lib/src/native_activity_game_surface.dart:535-558 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_webview.dart"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"defa71244cbff8ff29ebf2ad5a861699321db1c4a18395a0026ffabe4977cb7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): lib/src/battle/live_battle_card.dart:330-351 | lib/src/expedition/expedition_check_page.dart:816-835 | lib/src/fleet/anchorage_repair_view.dart:277-301 | lib/src/fleet/pre_sortie_check_summary.dart:545-566 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/live_battle_card.dart"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"77171d43a103396c5558035299c754bbd4fb0e8faa9e37ca96e6c33abc28367d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/src/new_ship/new_ship_reminder_controller.dart:121-135 | lib/src/new_ship/new_ship_reminder_controller.dart:137-147 \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/src/new_ship/new_ship_reminder_controller.dart"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef647179423e9d5f356033652a1d8e76dfe04a4c1ef5fd69a94d60ada450684"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/src/browser/gadget_bypass_controller.dart:59-73 | lib/src/browser/gadget_bypass_controller.dart:75-95 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/gadget_bypass_controller.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6374eb14f98d235a2e24033889424b8ca4a40fd26b41be865e1097279d5dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/src/fleet/timer_mechanics_service.dart:157-180 | lib/src/fleet/timer_mechanics_service.dart:292-309 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/timer_mechanics_service.dart"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2b5f1d4edad8ee8773d1ad3a12e3d5759c06958383bef8d95de5363a15fcde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/src/battle/fcd_map_controller.dart:65-77 | lib/src/quest/quest_catalog_controller.dart:48-65 \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/src/battle/fcd_map_controller.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c81efb8c6c3f566ddd59620de8dd26e29c02040d475787942891bd48d1d9cb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/src/game_state/game_state_reducer.dart:808-825 | lib/src/game_state/game_state_reducer.dart:827-843 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94026099a439d2fb6813a93fd7c81a9e398ee6c51e30194c71e21b8867fe667"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): lib/src/improvement/improvement_planner_view.dart:863-882 | lib/src/inventory/owned_inventory_page.dart:2262-2280 | lib/src/logbook/logbook_experience_page.dart:538-559 | lib/src/logbook/logbook_page.dart:1669-1687 \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/src/improvement/improvement_planner_view.dart"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebd9678c7cb04008bc8e1deeed7f1adfe1128f41ae85d59e9c0c3e99ec572b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/src/improvement/improvement_planner_view.dart:1248-1263 | lib/src/improvement/improvement_planner_view.dart:1297-1316 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/improvement/improvement_planner_view.dart"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2b9d613caf8e4051fba18a8dee75dbc7b09b1cf860e76e7b001aa8a0a4e2b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/src/toolbox/sortie_map_query/enemy_catalog_update_service.dart:136-150 | lib/src/toolbox/sortie_map_query/sortie_map_catalog_update_service.dart:177-192 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/enemy_catalog_update_service.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde6babf06a77cae2db6f05104a450967b11821a93e461f65924434e9af329b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/src/senka/senka_state.dart:76-86 | lib/src/senka/senka_state.dart:131-141 \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/src/senka/senka_state.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90cda56b24925de31c4613b042903bc2e39f96a2298e8c34821035fa12c193c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): lib/src/inventory/owned_inventory_page.dart:1168-1185 | lib/src/layout/workspace_context_header.dart:717-733 | lib/src/logbook/logbook_page.dart:413-427 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/owned_inventory_page.dart"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a5eef3284b5028ca425cc8eb79e0d6806fc003edbeaa188db185df678eda70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/src/browser/gadget_bypass_store.dart:114-125 | lib/src/settings/network_settings_store.dart:49-62 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/gadget_bypass_store.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2791eb4621265cb8bd0f94e78a0b2c605e714a336d17ac7d204d16ca3ed64c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): lib/src/fleet/minimal_status_glow.dart:89-105 | lib/src/fleet/ship_status_visuals.dart:59-75 | lib/src/fleet/ship_status_visuals.dart:196-211 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/minimal_status_glow.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4bdadbc73101b5733d2186cd8ffdede5ccd288bb95dc62ed135714625668e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/src/toolbox/sortie_map_query/enemy_catalog_controller.dart:39-53 | lib/src/toolbox/sortie_map_query/sortie_map_catalog_controller.dart:48-65 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/enemy_catalog_controller.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3d8644233044afaa3657c3f2f242a059842b1d064519f4891dac9e60cf1913"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): lib/src/development/development_dataset.dart:222-231 | lib/src/development/development_dataset.dart:233-242 | lib/src/development/development_dataset.dart:319-328 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/development/development_dataset.dart"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3899faa876b619ed73df72aad4e0f0c724b238a753472ce7ed9827d5dd05f40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/src/backup/record_backup.dart:1426-1434 | lib/src/backup/record_backup.dart:1467-1475 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/backup/record_backup.dart"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6694911936dd7c760cf927ac27c1088c4e5c3bc33adac9ba945b7ea0dab49c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/src/settings/layout_settings_store.dart:293-303 | lib/src/settings/layout_settings_store.dart:342-349 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/layout_settings_store.dart"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"411fcef6d7d6373db5be6582edac92a2cc213d1d13d059a644e124071030691f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): android/app/src/main/kotlin/app/yahagi/kancollebrowser/fonts/CustomFontRepository.kt:93-103 | android/app/src/main/kotlin/app/yahagi/kancollebrowser/fonts/CustomFontRepository.kt:105-114 \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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/fonts/CustomFontRepository.kt"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b78a92aff5fcd6c05caeb94d89ac485f90dc50617c9014ea0d7d3b25a1b740"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/src/browser/game_browser_controller.dart:175-193 | lib/src/browser/game_browser_controller.dart:195-213 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/game_browser_controller.dart"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9fac92807e8a1208ab9ce65bbedd39611a4ad0d6adb1f2c7854724eb22fceb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/src/browser/native_game_surface_slot.dart:674-686 | lib/src/browser/native_game_surface_slot.dart:691-700 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/native_game_surface_slot.dart"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f38cd3661f2af2be822aa9ae1786bc11709e2c411d0054b01d53e706f734841"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): android/app/src/main/kotlin/app/yahagi/kancollebrowser/fonts/CustomFontManager.kt:91-104 | android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModManager.kt:346-362 \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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/fonts/CustomFontManager.kt"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c047bfa91a3006c53f265fbe6216e2579fae87fb494d37337231aaa5965526"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/src/inventory/owned_inventory_page.dart:265-277 | lib/src/inventory/owned_inventory_page.dart:279-291 \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/src/inventory/owned_inventory_page.dart"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f351f5b9eab04a84dab5fa5abe2539b54f2e918f12002adbd38927d11730b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/src/quest/quest_center_page.dart:1853-1867 | lib/src/quest/quest_center_page.dart:1880-1893 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_center_page.dart"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e2f5379b829daaed0c14d29010bebc2837a223a8d2484724a00639a5a9d481"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/src/subtitles/ship_subtitle_catalog_store.dart:88-104 | lib/src/subtitles/ship_subtitle_kc3_store.dart:85-101 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_catalog_store.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdec12080065cfe5fdeea9ea9d93d3e557e71992a226db4676f5271a8e758158"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/BackupShareCache.kt:44-56 | android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/PendingBackupExportStore.kt:268-279 | android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheStore.kt:585-597 | android/app/src/main/kotlin/app/yahagi/kancollebrowser/fonts/CustomFontRepository.kt:156-167 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/BackupShareCache.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbfc782ed85bce74b8e2d506fdd29824cf4abb523a61a4a774a2e6647215bf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/src/battle/battle_controller.dart:252-266 | lib/src/battle/battle_controller.dart:268-287 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_controller.dart"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cbe469583fc183e6f92d64880410b62bf87643cd55eb4d8e41a42e0c872901"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/src/game_state/game_state.dart:958-971 | lib/src/senka/senka_state.dart:51-65 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state.dart"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9aa22f67e8b1950d232964abb23715f350b3c8a755360b944884eef0e4f6a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/src/browser/game_surface_input_guard.dart:106-115 | lib/src/browser/game_surface_input_guard.dart:117-124 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/game_surface_input_guard.dart"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f59447acd6d5b684836dc3226273ac10457332e2a81e39f17f1687ef6d8de30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/src/browser/native_game_surface_visibility.dart:102-109 | lib/src/browser/native_game_surface_visibility.dart:111-122 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/native_game_surface_visibility.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f850ea866d91ff88d98dd75a86251d57b7e4769c17c2a168927123a76fe533f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/src/settings/layout_settings_controller.dart:1276-1286 | lib/src/settings/layout_settings_controller.dart:1288-1298 \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/src/settings/layout_settings_controller.dart"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7e723a36323f2418528757426261ec7f95d38d06567dd52447e99dfff0c2e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/src/diagnostics/diagnostic_event.dart:58-73 | lib/src/diagnostics/diagnostic_event.dart:207-220 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/diagnostics/diagnostic_event.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"5116be91e0177d02e7b160cff5fcfce8e94dcd788208fe966d07d7162a2bb837"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): lib/src/game_state/game_state.dart:828-837 | lib/src/quest/quest_center_page.dart:1869-1878 | lib/src/quest/quest_center_page.dart:1895-1903 \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/src/game_state/game_state.dart"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2252744b1a16b4102eba8f2c97eb3fd2f08d4115ce4dc2aeb08cdd150ec03e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/src/battle/battle_controller.dart:1634-1639 | lib/src/logbook/logbook_event_recorder.dart:686-690 \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/src/battle/battle_controller.dart"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4e25781f358c3f1cf466c1c2b9766bc83268a208ffd913438f2ec05ea015dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/src/toolbox/composition_image_strings.dart:403-409 | lib/src/toolbox/sortie_map_query/sortie_map_query_strings.dart:46-56 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/composition_image_strings.dart"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c004e606cfeb6428562e798f2f334aa3a985551498b9038b74b1a7d0304c96c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/src/toolbox/fleet_export_page.dart:309-317 | lib/src/toolbox/sortie_map_query/sortie_map_query_page.dart:1541-1549 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/fleet_export_page.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"c287ed12a04b3305707cdbb5224fc7f37f49cb2984ece8e87eff9bf17417d107"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/src/settings/layout_settings_controller.dart:963-972 | lib/src/settings/layout_settings_controller.dart:977-991 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/layout_settings_controller.dart"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ed762eda03cf366119963b41ea64a6730c516125683a24139ae1bcdda9bff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/src/diagnostics/diagnostic_controller.dart:128-132 | lib/src/quest/quest_catalog_store.dart:227-232 \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/src/diagnostics/diagnostic_controller.dart"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cea2313a0ab66e8ff8df063806f5ed648370164b3bc3f1dc69e1f244a8bee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/src/expedition/expedition_selection_store.dart:21-32 | lib/src/expedition/expedition_selection_store.dart:34-44 \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/src/expedition/expedition_selection_store.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"211856d4dd7d6a9363df4e8a98334176b98176e268b5bb2e64abf9e1368b9037"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/src/senka/senka_store.dart:206-210 | lib/src/settings/battle_prediction_settings.dart:365-376 \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/src/senka/senka_store.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"098ccfee5a74ce23f8a7e71d6b546b047fe83a254b46dca24941600219d819a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): tool/akashi_bonus/lib/models.dart:142-149 | tool/wiki_bonus/lib/models.dart:132-137 \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":"tool/akashi_bonus/lib/models.dart"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"644c686b1203843fec7def7b9f39ab477b7c3865ada6dab0c8098526dc7228c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/src/expedition/expedition_strings.dart:9-17 | lib/src/toolbox/sortie_map_query/sortie_enemy_details_strings.dart:33-43 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_strings.dart"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a0225cdf7ce148bc5f074dda0ef347c36899174fca126605082e5cbfcebd5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/src/toolbox/game_mods/game_mods_controller.dart:455-464 | lib/src/toolbox/game_mods/game_mods_controller.dart:509-519 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_controller.dart"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"521cc27e70e93dea43f483d1fa261f33031ad95e4c6bdf879e2e599d96aca505"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/src/development/development_dataset.dart:25-33 | lib/src/development/development_repository.dart:24-35 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/development/development_dataset.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21fda0748f7c2328a1f201c78750e4f901876675f85f776fe33019fe110bddb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): lib/src/fleet/anchorage_repair_calculator.dart:329-343 | lib/src/fleet/nosaki_sparkle_calculator.dart:396-408 \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/src/fleet/anchorage_repair_calculator.dart"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"e460bbee028b0a80b14f20c5201ea20b5ed227218162353ec91975f9b9738d12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/src/inventory/equipment_compatibility_drawer.dart:219-227 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:213-221 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e3074d05d198d1d63c19a6c37fbba3534fcb4f5e769803b5a6f951ea626588"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): tool/akashi_bonus/lib/cross_source_checker.dart:47-55 | tool/akashi_bonus/lib/rule_builder.dart:32-40 \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":"tool/akashi_bonus/lib/cross_source_checker.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b5c2cd58d0bf1a0b8f441ed00c33dd301cee22495dfadb5a7b8968ff2fdccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/src/battle/battle_records_page.dart:290-294 | lib/src/diagnostics/diagnostic_export_service.dart:150-154 \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/src/battle/battle_records_page.dart"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b2411e77a02ab80f554975beadcc1284d096f557d28836be7b1cda04ab0666"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/src/settings/layout_settings_controller.dart:743-753 | lib/src/settings/layout_settings_controller.dart:755-765 \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/src/settings/layout_settings_controller.dart"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"33dbfd6ab74932299dcaf547392ed7e6d3e7b1695899064c96fc1b54b648b578"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): lib/src/settings/display_mode_store.dart:13-21 | lib/src/settings/layout_settings_store.dart:540-548 | lib/src/settings/layout_settings_store.dart:808-816 | lib/src/settings/safety_settings_store.dart:48-56 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/display_mode_store.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba893f14f9809668923cbda7986ab0e5711e494088182804373b7a7e1ee4aa05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModCoordinateEndpoint.kt:69-74 | android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/KanxyGameCoordinateEndpoint.kt:97-108 \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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModCoordinateEndpoint.kt"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f86d34b0190c8053a32b10dbaa0350f5853d5f0e3e7c4c4214f89ef5b3cd41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/src/browser/gadget_bypass_channel.dart:107-119 | lib/src/browser/network_proxy_channel.dart:59-68 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/gadget_bypass_channel.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"970f2339e065184ed6b608fdedd83e365f4567d45b2a59c4fccc521f9161b327"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/src/fleet/fleet_ship_status_capsule.dart:680-685 | lib/src/settings/data_settings_page.dart:282-287 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_ship_status_capsule.dart"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa434c3f872ce642451fc0a9982228e7698220c96acf044da498d50ef3a0edd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): tool/akashi_bonus/lib/models.dart:233-237 | tool/wiki_bonus/lib/models.dart:209-213 \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/akashi_bonus/lib/models.dart"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2dc529065c6e43a75adec910be37527a942380f4c04fecace011f8a171f24ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): lib/src/battle/battle_detail_strings.dart:163-169 | lib/src/localization/record_backup_strings.dart:141-147 | lib/src/toolbox/exp_calc/exp_calc_strings.dart:55-61 | lib/src/toolbox/game_mods/game_mods_strings.dart:528-534 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_detail_strings.dart"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c752328dc13b8e42d0bc5b48ea4189fe1275c12e798605c7b489368237a286"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/src/expedition/expedition_check_card.dart:53-64 | lib/src/expedition/expedition_check_page.dart:53-64 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_check_card.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"111b1bf80bb2cfcc3248469795d5acbbb20bd1ebdbb58e63a933bd0f6b9aca66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/src/logbook/logbook_experience_record.dart:22-30 | lib/src/sortie_experience/sortie_experience_controller.dart:54-63 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_experience_record.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fc4f56ffe0c41d335684206f1415863bc8c34f732490c6dc1b25e50a7b4883"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/src/audio/game_audio_store.dart:23-30 | lib/src/capture/capture_mode_store.dart:20-27 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/audio/game_audio_store.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4606779afa0755235e1ff1560832dc8d21bc60917066b2d5bfd106fbc10a72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/src/battle/battle_detail_strings.dart:144-146 | lib/src/toolbox/composition_image_strings.dart:394-402 \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/src/battle/battle_detail_strings.dart"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8136457e12a749911e6908a044a18804b4c07369a8154e9796576874b59ab49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/src/browser/native_game_webview_contract.dart:311-321 | lib/src/diagnostics/diagnostic_platform_port.dart:203-209 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/native_game_webview_contract.dart"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5331aa7ae16c0871ae9c3a13966a78dd14cfd51177169e892f4f4140bd12dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/src/expedition/expedition_check_page.dart:587-597 | lib/src/toolbox/composition_image_page.dart:2176-2186 \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/src/expedition/expedition_check_page.dart"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb6461b1ba33e1c2880057c6419cb9beb9a93d00bfdda0494bdfa1cefe968a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/src/quest/quest_progress_dataset_store.dart:24-31 | lib/src/quest/quest_progress_engine.dart:21-28 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_progress_dataset_store.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0f260eecd35167b981aaa107c13d42188690b0bf7b90311d50b02e479490b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/src/settings/game_runtime_settings_page.dart:219-230 | lib/src/settings/screen_settings_page.dart:601-607 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/game_runtime_settings_page.dart"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bde5e7f6147055f52691b34c365748afcdbab5c399414a850fb883db483f847"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/src/subtitles/ship_subtitle_catalog_store.dart:106-109 | lib/src/subtitles/ship_subtitle_kc3_store.dart:103-106 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_catalog_store.dart"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cddafa44e57e967564c4d729ec265c54bbfd07c8fb5b19504a0ba931b72db5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): lib/src/backup/record_backup.dart:52-59 | lib/src/kcwiki_report/kcwiki_report_settings.dart:26-33 | lib/src/settings/battle_prediction_settings.dart:73-80 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/backup/record_backup.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0283f1bab942a126586eb5d306551096dbc6c9cc83b74ecfabf87d5780b4ad06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/src/browser/game_screenshot_controller.dart:16-23 | lib/src/browser/native_game_surface_preview.dart:17-26 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/game_screenshot_controller.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d28f074a53ecec76fb489a6bcbf084a75d3b858b57e060fed9fe7937ae30c7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/src/battle/battle_ui_text.dart:24-32 | lib/src/localization/ui_text.dart:21-29 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_ui_text.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61deeb6e48382650a19b0fd6a69a5050645b7f33670e62ca12f78d14a1179ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/src/sortie_experience/sortie_experience_controller.dart:168-175 | lib/src/browser/game_resource_cache_store.dart:35-41 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/sortie_experience/sortie_experience_controller.dart"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dc6dad56185cd51457a9b962981ed8feb82d2362c5ce6940b172b06fcc1d8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 2\u002B corresponding lines): lib/src/battle/battle_controller.dart:1678-1680 | lib/src/battle/battle_detail_replay_builder.dart:623-625 | lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart:751-752 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_controller.dart"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8aa015a9033b31cd5cb837aa3c44d1b7995b4e978c05c6fba1353d4438e204"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/src/improvement/improvement_planner_view.dart:1568-1577 | lib/src/inventory/owned_inventory_page.dart:2064-2075 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/improvement/improvement_planner_view.dart"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1951e92d6ef3b940d5c01612c48c715ea9a84f6ace9f16a68c137ed9e2b57a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): android/app/src/main/kotlin/app/yahagi/kancollebrowser/capture/CaptureMessageValidator.kt:197-207 | android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModArchive.kt:427-435 \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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/capture/CaptureMessageValidator.kt"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a889fcf5947892ce54e67bcd1139b392bdd039661513c9e503e03696653836cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): lib/src/battle/battle_controller.dart:1716-1721 | lib/src/game_state/game_api_decoder.dart:65-72 | lib/src/game_state/game_state_reducer.dart:2877-2884 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_controller.dart"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f33dfcf90c0bdaeb378021e33e58d1f809d0329ae0d9ff9863b4c3902b5a2b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/src/battle/fcd_map_store.dart:60-65 | lib/src/quest/quest_catalog_store.dart:52-57 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/fcd_map_store.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ffa32595edfc590389d8db71ce204e4cdbddd878caf8afd9d9a70081221f74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/src/inventory/equipment_compatibility_drawer.dart:49-55 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:50-57 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df9bf90541b173e084d77eea5cef2fbc71b25b74224cb5132c4543a710efe18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/src/browser/native_game_surface_slot.dart:702-708 | lib/src/native_activity_game_surface.dart:1402-1411 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/native_game_surface_slot.dart"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa68da33478abcf09f92ef9066d978e7d4a44c99522787eda9e9f8554349d42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): tool/akashi_bonus/lib/models.dart:79-85 | tool/wiki_bonus/lib/models.dart:76-83 \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":"tool/akashi_bonus/lib/models.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"905ba91bac1aa48aa670211e1dea2fe3f58853e0ba1f4997125b39126d75f3b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/src/theme/custom_font_port.dart:42-46 | lib/src/toolbox/game_mods/game_mods_port.dart:41-47 \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/src/theme/custom_font_port.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"39337bf5e5c48150ccd02ca15365cd65061769c4a015548691f80f1f89558371"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/src/fleet/fleet_information_center.dart:657-665 | lib/src/fleet/fleet_ship_status_capsule.dart:87-95 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_information_center.dart"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27a56e5accf98ddc4f5f1b8c1be2d52e357dd8995862aa8de4d29ccbe43e627"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/src/battle/battle_controller.dart:102-107 | lib/src/new_ship/new_ship_reminder_controller.dart:74-79 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_controller.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecbce665d08c5b9b98275571f85f2a0a4045b9126dca39c8181d2fe5e509556"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/src/battle/battle_ship_details_popover.dart:158-165 | lib/src/fleet/fleet_metric_details_popover.dart:133-140 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_ship_details_popover.dart"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d657eeb51baa8b983acbb77c37f3bf3e6d474bc58c30dcc3a2f791a28d79d4a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): lib/src/quest/quest_catalog_update_service.dart:179-188 | lib/src/quest/quest_progress_update_service.dart:142-151 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_catalog_update_service.dart"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0bc04a8bf2e6c69fd45d5491b6cf160950402aaff886f4f2110770d66e4988"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lib/src/battle/battle_controller.dart:1693-1694 | lib/src/battle/battle_detail_replay_builder.dart:633-634 \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/src/battle/battle_controller.dart"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d2ca4265b60921d9922cd6639347ad46c935125a9791d2c813c3f937603162"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/src/battle/formation_memory.dart:41-44 | lib/src/notification/notification_timer_anchor_store.dart:206-209 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/formation_memory.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"708eea52af9709a5ac64d5f0b60a3f41383f292fce27c31e481519ea98677ffc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lib/src/browser/game_resource_manifest_consumer.dart:130-131 | lib/src/logbook/logbook_event_recorder.dart:683-684 \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/src/browser/game_resource_manifest_consumer.dart"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b490202469481916a422e94f0880ade324d45fd574e730fcad5c8fe6571b5361"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/src/logbook/logbook_experience_strings.dart:63-65 | lib/src/sortie_experience/sortie_experience_strings.dart:91-93 \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/src/logbook/logbook_experience_strings.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe715d1724efda3d3131e614bf9648660917358048b182021ba732510eae8590"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/src/settings/layout_settings_store.dart:818-824 | lib/src/settings/safety_settings_store.dart:75-81 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/layout_settings_store.dart"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e67b88834bcd03748c5d3f5d24d0810fccf20245ca554e0278b412cf2d2ffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 2\u002B corresponding lines): lib/src/battle/battle_controller.dart:1682-1683 | lib/src/battle/battle_detail_replay_builder.dart:627-628 | lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart:749-750 | lib/src/browser/game_resource_manifest_builder.dart:183-184 | lib/src/game_state/game_state_reducer.dart:2835-2837 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 2 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/src/battle/battle_controller.dart"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e6258bd478d663464020f3e613573c542da09c742f21e56a4e6fbed57937a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 2\u002B corresponding lines): lib/src/battle/battle_detail_strings.dart:141-143 | lib/src/sortie_experience/sortie_experience_strings.dart:220-221 | lib/src/toolbox/composition_image_strings.dart:375-376 | lib/src/toolbox/game_mods/game_mods_strings.dart:526-527 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_detail_strings.dart"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"683f7bdb706134ba3522ded5f708dc8ea1503122a56c2a96ed8d549843cc715f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/src/battle/live_battle_card.dart:108-111 | lib/src/fleet/pre_sortie_check_summary.dart:94-97 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/live_battle_card.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bab1c80a71cc5d2b46fbf87532a1b39be22eec5245f5f4e3c04694c055ceec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/src/fleet/anchorage_repair_calculator.dart:323-325 | lib/src/fleet/nosaki_sparkle_calculator.dart:390-392 \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/src/fleet/anchorage_repair_calculator.dart"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9f97eb5f112465ed48d8122e5dfee5dbcb50e73cdd7dee71d1bc272f761283"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lib/src/battle/battle_detail_replay_builder.dart:630-631 | lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart:753-754 \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/src/battle/battle_detail_replay_builder.dart"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"676df2b58f7759817c28de29c518f36e2b9cfe0530aabc557d47f85840e6dc04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/src/browser/native_game_resource_checklist.dart:41-43 | lib/src/browser/native_game_warning_dialog.dart:46-48 \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/src/browser/native_game_resource_checklist.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c73a0664f6d6edf7d0ff81f395e87714e8f54b4f6c7269b1dab952c904a298"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): lib/src/fleet/fleet_ship_minimal_row.dart:233-234 | lib/src/fleet/land_base_summary_card.dart:1143-1144 \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/src/fleet/fleet_ship_minimal_row.dart"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6561bd66b6990862de48b8c97734526e6d84e8e4872430e37753bd84a3565d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (66\u201367 lines \u00D7 2): lib/src/fleet/anchorage_repair_view.dart:656-721 | lib/src/fleet/nosaki_sparkle_view.dart:449-515 \u2014 before extracting anything, compare \u0060lib/src/fleet/anchorage_repair_view.dart\u0060 and \u0060lib/src/fleet/nosaki_sparkle_view.dart\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/anchorage_repair_view.dart"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8763287295710f808009a0c6d7c921eabaaf8af467b0900b548895b9421891"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): lib/src/notification/game_notification_coordinator.dart:967-1015 | lib/src/notification/game_notification_coordinator.dart:1040-1088 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/notification/game_notification_coordinator.dart:967\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notification/game_notification_coordinator.dart"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cefdffb151fc80b1372c84933e4edf39a55d39f2327ccb6230222603d85dc9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43\u201344 lines \u00D7 2): lib/src/fleet/anchorage_repair_view.dart:355-397 | lib/src/fleet/nosaki_sparkle_view.dart:75-118 \u2014 before extracting anything, compare \u0060lib/src/fleet/anchorage_repair_view.dart\u0060 and \u0060lib/src/fleet/nosaki_sparkle_view.dart\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/anchorage_repair_view.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/anchorage_repair_view.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d9c95c51d40ef977689bca6fd4dfb307f9610bdaf999e6a20408f426af945e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): lib/src/inventory/equipment_compatibility_drawer.dart:82-118 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:79-115 \u2014 before extracting anything, compare \u0060lib/src/inventory/equipment_compatibility_drawer.dart\u0060 and \u0060lib/src/inventory/ship_equipment_compatibility_drawer.dart\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/inventory/equipment_compatibility_drawer.dart:82\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"299acb86e74f6ad32b7aaf8825e30ae29954df3ed046deb8a850a988dc2bf8a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): lib/main.dart:5142-5174 | lib/src/settings/diagnostics_section.dart:213-245 \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/main.dart"},"region":{"startLine":5142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d248082d28df616c9a372a68b99a28d714eeafd1820115d6d6118a8a6580a1a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201332 lines \u00D7 5): lib/src/toolbox/game_mods/game_mods_strings.dart:617-648 | lib/src/toolbox/game_mods/game_mods_strings.dart:702-729 | lib/src/toolbox/game_mods/game_mods_strings.dart:731-758 | lib/src/toolbox/game_mods/game_mods_strings.dart:802-832 | lib/src/toolbox/game_mods/game_mods_strings.dart:1009-1040 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/toolbox/game_mods/game_mods_strings.dart:617\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_strings.dart"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa9dfe201f6b0ff7e2b63bbfb14254c4fd7fc7e28d91fbf3a475d9a97ea1b95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): lib/src/fleet/anchorage_repair_view.dart:591-622 | lib/src/fleet/nosaki_sparkle_view.dart:378-409 \u2014 before extracting anything, compare \u0060lib/src/fleet/anchorage_repair_view.dart\u0060 and \u0060lib/src/fleet/nosaki_sparkle_view.dart\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/anchorage_repair_view.dart"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e759b34e7e17a92c3f4aa15042e3fa4d34ea5f0fcc732aa7f4543a02c0b33ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): lib/src/fleet/repair_summary_card.dart:320-350 | lib/src/fleet/repair_summary_card.dart:432-462 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/repair_summary_card.dart:320\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/repair_summary_card.dart"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc17aa7947634c23674f77c58a729a1c79e071f9b35f70a9a33b173646b5d86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): lib/src/settings/game_connector_section.dart:76-106 | lib/src/settings/game_rendering_mode_section.dart:97-127 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/settings/game_connector_section.dart:76\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/game_connector_section.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"57da2d7f7b5099da8ad2d5421f7e0e74ad168ef1ce8d248f874b1acb5bac1acd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): lib/src/fleet/anchorage_repair_view.dart:489-517 | lib/src/fleet/nosaki_sparkle_view.dart:289-317 \u2014 before extracting anything, compare \u0060lib/src/fleet/anchorage_repair_view.dart\u0060 and \u0060lib/src/fleet/nosaki_sparkle_view.dart\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/anchorage_repair_view.dart:489\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/src/fleet/anchorage_repair_view.dart"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3731b423437050b0ce9e8593c5b5c1729817885f66c821b7c7ee0292b70d78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 3): lib/src/toolbox/game_mods/game_mods_strings.dart:746-772 | lib/src/toolbox/game_mods/game_mods_strings.dart:774-800 | lib/src/toolbox/game_mods/game_mods_strings.dart:858-885 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/toolbox/game_mods/game_mods_strings.dart:746\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/src/toolbox/game_mods/game_mods_strings.dart"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d4713faf6ea2af34902ee406d3040db248afd0126700ae63568910caf358ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): lib/src/capture/game_capture_controller.dart:497-523 | lib/src/game_state/game_api_event_pipeline.dart:147-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/src/capture/game_capture_controller.dart:497\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/game_capture_controller.dart"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc72f9c45be06ffc74e2b03cf15be397238331705672b63a10dd784d8bf527f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): lib/src/fleet/anchorage_repair_view.dart:745-772 | lib/src/fleet/nosaki_sparkle_view.dart:539-566 \u2014 before extracting anything, compare \u0060lib/src/fleet/anchorage_repair_view.dart\u0060 and \u0060lib/src/fleet/nosaki_sparkle_view.dart\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/anchorage_repair_view.dart"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"df128575e3146e66b5f969b0791df52c578121c41ab19539913b7c458c135f1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 4): lib/src/toolbox/game_mods/game_mods_strings.dart:633-658 | lib/src/toolbox/game_mods/game_mods_strings.dart:740-765 | lib/src/toolbox/game_mods/game_mods_strings.dart:852-877 | lib/src/toolbox/game_mods/game_mods_strings.dart:1088-1114 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/toolbox/game_mods/game_mods_strings.dart:633\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/src/toolbox/game_mods/game_mods_strings.dart"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0cf9a92fa8fa5f92b98ae9aac5c98dbbefb710766a839f27e80480c4849095"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): lib/src/inventory/equipment_compatibility_drawer.dart:168-194 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:158-184 \u2014 before extracting anything, compare \u0060lib/src/inventory/equipment_compatibility_drawer.dart\u0060 and \u0060lib/src/inventory/ship_equipment_compatibility_drawer.dart\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/inventory/equipment_compatibility_drawer.dart:168\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba16b8ef7ecf936d1eddbb824b7f9a3573ad670531927efe4fff105b168e86a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201353 lines \u00D7 2): lib/src/toolbox/game_mods/game_mods_strings.dart:661-693 | lib/src/toolbox/game_mods/game_mods_strings.dart:888-940 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_strings.dart"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01490ac362fdaf0dc630550dfeefd8756134711beeea8905b3ddb5ed687674c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201326 lines \u00D7 4): lib/src/toolbox/game_mods/game_mods_strings.dart:745-770 | lib/src/toolbox/game_mods/game_mods_strings.dart:774-798 | lib/src/toolbox/game_mods/game_mods_strings.dart:857-882 | lib/src/toolbox/game_mods/game_mods_strings.dart:1093-1114 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/toolbox/game_mods/game_mods_strings.dart:745\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_strings.dart"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e85c461ee9d444d91f9bfe6ccedbb93ef702d8345aa745892abe3592f9a717"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): lib/src/logbook/logbook_page.dart:965-989 | lib/src/logbook/logbook_page.dart:994-1018 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/logbook/logbook_page.dart:965\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_page.dart"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e05ee10be6d67e2d3cf43d297a947318877b84773d6f66bcc4e815e701ba41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): tool/akashi_bonus/lib/rule_builder.dart:338-361 | tool/akashi_bonus/lib/rule_builder.dart:663-687 \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/akashi_bonus/lib/rule_builder.dart:338\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":"tool/akashi_bonus/lib/rule_builder.dart"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb38a2c5326b15b7ae0bd672f1242d8497acf41820cb8a03bd3f71eea17d4f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): lib/src/senka/base_senka_section.dart:120-143 | lib/src/settings/data_settings_page.dart:576-599 | lib/src/settings/network_settings_page_new.dart:152-175 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/base_senka_section.dart"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f0c315e8af376cc442acbc0f0114be15335cda05e7761dd53d8709c0f743ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): lib/src/toolbox/game_mods/game_mods_page.dart:928-951 | lib/src/toolbox/game_mods/game_mods_page.dart:990-1013 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/toolbox/game_mods/game_mods_page.dart:928\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/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fc6193014cc4093e91bb1887b5722c0ba2c296dd8b2bc8af56197bcb7d14be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): lib/src/development/development_equipment_picker.dart:126-148 | lib/src/expedition/expedition_mission_picker.dart:246-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/src/development/development_equipment_picker.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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/development/development_equipment_picker.dart"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b229db0a3645e36d4b87f2c8733fc5640d9f6e59a609678e4be5744eddba3525"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): lib/src/inventory/equipment_compatibility_drawer.dart:504-526 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:428-450 \u2014 before extracting anything, compare \u0060lib/src/inventory/equipment_compatibility_drawer.dart\u0060 and \u0060lib/src/inventory/ship_equipment_compatibility_drawer.dart\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/inventory/equipment_compatibility_drawer.dart:504\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"2827a57d22420e7d95233c1996025237a69f783b79c2cf237f1f35d1e78d33df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): lib/src/toolbox/exp_calc/exp_calc_page.dart:1711-1733 | lib/src/toolbox/exp_calc/exp_calc_page.dart:1763-1785 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/toolbox/exp_calc/exp_calc_page.dart:1711\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/exp_calc/exp_calc_page.dart"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fb016ca56fb3cb1b0786413a1269802f787399e25f1bb6cf38edd5760eab5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): lib/src/fleet/fleet_information_center.dart:1028-1049 | lib/src/fleet/fleet_ship_status_capsule.dart:386-406 \u2014 before extracting anything, compare \u0060lib/src/fleet/fleet_information_center.dart\u0060 and \u0060lib/src/fleet/fleet_ship_status_capsule.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/fleet_ship_status_capsule.dart:386\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_information_center.dart"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"de56e54830b7d20be824e0e616bc9e95c13058a5ecc99b3208140e608a4a2cba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): lib/src/inventory/equipment_compatibility_drawer.dart:633-654 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:559-580 \u2014 before extracting anything, compare \u0060lib/src/inventory/equipment_compatibility_drawer.dart\u0060 and \u0060lib/src/inventory/ship_equipment_compatibility_drawer.dart\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a5cdecc17e4426ba2353dbf922e37cfe3213fad278c8540022c31ade3e7f20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): lib/src/notification/game_notification_coordinator.dart:384-405 | lib/src/notification/game_notification_coordinator.dart:426-447 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notification/game_notification_coordinator.dart"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"f280ccccbad2264c08e3e4f1cb151aed56f743d398a323f3d312f24a6a6008ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): lib/src/settings/app_exit_settings.dart:27-48 | lib/src/settings/game_mouse_wheel_settings.dart:27-48 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/app_exit_settings.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"255a7bb0e434b1fdb005ef32b721f8e4af2c2b1bddcb1ee67f439d83f15f1b84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): lib/src/fleet/repair_summary_card.dart:282-302 | lib/src/fleet/repair_summary_card.dart:400-420 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/repair_summary_card.dart:282\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/repair_summary_card.dart"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd392e7d5e0b0d7917af8ae3ca1378575e345ac76d235a5482703a4790b3295"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): lib/src/notification/game_notification_coordinator.dart:747-767 | lib/src/notification/game_notification_coordinator.dart:823-843 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/notification/game_notification_coordinator.dart:747\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notification/game_notification_coordinator.dart"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e320203e0809a33260bc956a36e3ddced0864b4e5e930e5248851373145739"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): lib/src/settings/settings_ui_helpers.dart:128-148 | lib/src/settings/settings_ui_helpers.dart:178-198 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/settings/settings_ui_helpers.dart:128\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/settings_ui_helpers.dart"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f66f55a64414cec375b0fe6f8fc60308d6608141f4b1b7985e92ccf9167e22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 3): lib/src/notification/game_notification_coordinator.dart:649-668 | lib/src/notification/game_notification_coordinator.dart:981-999 | lib/src/notification/game_notification_coordinator.dart:1054-1072 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/notification/game_notification_coordinator.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/src/notification/game_notification_coordinator.dart"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2a490a479929ab84e7a775f6d83b340033f2a868dd281a91ae53d3ebca28a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201320 lines \u00D7 2): lib/src/expedition/expedition_strings.dart:294-313 | lib/src/expedition/expedition_strings.dart:324-338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/expedition/expedition_strings.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_strings.dart"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d87d4f613ab14932877413857e4c829d40a52c9599df49128584414705f0ea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): lib/src/inventory/equipment_compatibility_drawer.dart:599-618 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:526-545 \u2014 before extracting anything, compare \u0060lib/src/inventory/equipment_compatibility_drawer.dart\u0060 and \u0060lib/src/inventory/ship_equipment_compatibility_drawer.dart\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/inventory/equipment_compatibility_drawer.dart:599\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"058ca627ef72ba57e05da4d111fa3b26b5519a9470d968b3d54f0fc2efde1294"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): lib/src/inventory/owned_inventory_page.dart:884-903 | lib/src/inventory/owned_inventory_page.dart:951-970 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/inventory/owned_inventory_page.dart:884\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/src/inventory/owned_inventory_page.dart:971\u0060 calls \u0060SizedBox\u0060 and \u0060lib/src/inventory/owned_inventory_page.dart:904\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/owned_inventory_page.dart"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd77198d3dae6b43370e70f9a636343d68f91570897f25744b12485cfe62aa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): lib/src/settings/enemy_catalog_update_section.dart:45-64 | lib/src/settings/sortie_map_catalog_update_section.dart:48-66 \u2014 before extracting anything, compare \u0060lib/src/settings/enemy_catalog_update_section.dart\u0060 and \u0060lib/src/settings/sortie_map_catalog_update_section.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/settings/enemy_catalog_update_section.dart:45\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/src/settings/sortie_map_catalog_update_section.dart:47\u0060 calls \u0060SizedBox\u0060, \u0060IconButton\u0060 and \u0060lib/src/settings/enemy_catalog_update_section.dart:45\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/enemy_catalog_update_section.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e353fe0fb370b7952bd860989b8b078e6d2538c9cbb3235ea28758c7d88de3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): lib/src/toolbox/sortie_map_query/sortie_map_query_page.dart:595-614 | lib/src/toolbox/sortie_map_query/sortie_map_query_page.dart:714-733 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/toolbox/sortie_map_query/sortie_map_query_page.dart:595\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/sortie_map_query_page.dart"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b82095bc656b52cd0c2ea705df27feb71f422fb769346117bfb6714e96d7559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): lib/src/fleet/operation_status_views.dart:584-602 | lib/src/fleet/operation_status_views.dart:664-682 | lib/src/fleet/operation_status_views.dart:722-740 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/operation_status_views.dart:584\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/src/fleet/operation_status_views.dart"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c27a9106bf07824ec973da6b31d32d9ab80c8a088fc7904387e6079878eb17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): lib/src/battle/battle_pills.dart:595-613 | lib/src/battle/battle_pills.dart:766-784 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/battle/battle_pills.dart:595\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_pills.dart"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d28228b252177881b90c1e49ad1bee13e87ef33f9f82ae741f6bdbf66c7b30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): lib/src/battle/detailed_battle_panel.dart:464-496 | lib/src/battle/live_battle_card.dart:937-969 \u2014 before extracting anything, compare \u0060lib/src/battle/detailed_battle_panel.dart\u0060 and \u0060lib/src/battle/live_battle_card.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/battle/detailed_battle_panel.dart:464\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/src/battle/detailed_battle_panel.dart"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"413bfe0f1bbd95d4aaf0be67f7ebcc7423047f7da4dffce3ec6766030305849d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): lib/src/game_state/game_state_serializer.dart:800-818 | lib/src/quest/shared_preferences_quest_store.dart:117-135 \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/src/game_state/game_state_serializer.dart:800\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/src/game_state/game_state_serializer.dart"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"73626740d9acc00a40415031a6b671511de3f192e1026a13f06e8d5af9619b4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): lib/src/inventory/equipment_compatibility_drawer.dart:437-455 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:361-379 \u2014 before extracting anything, compare \u0060lib/src/inventory/equipment_compatibility_drawer.dart\u0060 and \u0060lib/src/inventory/ship_equipment_compatibility_drawer.dart\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/inventory/equipment_compatibility_drawer.dart:437\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb63d9e8828341ba90f150623939d8a1fbd0ac71ddd6c65f58c8b9aed7225ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): lib/src/settings/network_settings_section.dart:66-84 | lib/src/settings/network_settings_section.dart:113-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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/network_settings_section.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dadeca2e66a0a627d83ad4a8a9b3a80ca909e734897408b2783060e0392662a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): lib/main.dart:4711-4728 | lib/main.dart:4735-4752 | lib/main.dart:4757-4774 \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/main.dart:4711\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/main.dart"},"region":{"startLine":4711}}}],"partialFingerprints":{"codehealthFindingId/v1":"030c6aff370ab22f1631423e5fdeab8e6abb2195220e66fe01b205f597174c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/src/capture/battle_result_warning_overlay.dart:844-861 | lib/src/capture/battle_result_warning_overlay.dart:873-890 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/capture/battle_result_warning_overlay.dart:844\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/battle_result_warning_overlay.dart"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8c2a1a447ae4133e66f1f34ead8338b8ca1424ddbe5ee34b7bda0d7f219b98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/src/fleet/fleet_information_center.dart:2617-2634 | lib/src/fleet/fleet_information_center.dart:2954-2971 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/fleet_information_center.dart:2617\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_information_center.dart"},"region":{"startLine":2617}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fab0d2ffe037280e247935a341a4406498395769ab04d4ccc793149c57202d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/src/logbook/logbook_event_recorder.dart:355-372 | lib/src/logbook/logbook_event_recorder.dart:449-466 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_event_recorder.dart"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"625c884348bdc7314f1abc3cd045545a85dc5cae1eec0ae6f67f1f2f5eb0ee67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): lib/main.dart:4685-4701 | lib/main.dart:4710-4726 | lib/main.dart:4734-4750 | lib/main.dart:4756-4772 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/main.dart"},"region":{"startLine":4685}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5954d515c70f40266eb74215dfcb222eb565da0c64aeb093e47d67ef6e61af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 4): lib/src/notification/game_notification_coordinator.dart:676-692 | lib/src/notification/game_notification_coordinator.dart:916-932 | lib/src/notification/game_notification_coordinator.dart:1007-1022 | lib/src/notification/game_notification_coordinator.dart:1080-1096 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/notification/game_notification_coordinator.dart:676\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notification/game_notification_coordinator.dart"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b41e2e5966b6232bbcf14817cc36a296bbe93b820d3085f8a70d4b0c0206a9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/src/fleet/fleet_ship_status_capsule.dart:798-814 | lib/src/fleet/fleet_ship_status_capsule.dart:835-851 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_ship_status_capsule.dart"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"2617ecb6de7b9e271b6dc432adbf964a45d725fdc19152935d923e6a8736123f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): lib/src/fleet/timer_mechanics_service.dart:165-180 | lib/src/fleet/timer_mechanics_service.dart:293-309 \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/src/fleet/timer_mechanics_service.dart"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d7e9d1a2a5057a8927f8f60afaa2c3885791f1bee0ca77273ec4ac8f1e2a8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/src/inventory/equipment_compatibility_drawer.dart:869-885 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:789-805 \u2014 before extracting anything, compare \u0060lib/src/inventory/equipment_compatibility_drawer.dart\u0060 and \u0060lib/src/inventory/ship_equipment_compatibility_drawer.dart\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/inventory/equipment_compatibility_drawer.dart:869\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a672d9653b9475d4ccaffda1742e3793804cca85af7b22cd96b6829cf6eb91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/src/logbook/logbook_database.dart:1377-1393 | lib/src/logbook/logbook_database.dart:1451-1467 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_database.dart"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da2c267b9fe3f8218c29cad39954fd63ccd7c41fa4763f3e81dd552ce9b6dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): lib/src/logbook/logbook_page.dart:1337-1353 | lib/src/logbook/logbook_page.dart:1538-1553 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/logbook/logbook_page.dart:1337\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_page.dart"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d611a98503eb7a0a612a7d33de84e3f5cd3400e96ff5f1c8a922fc707f9d85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/src/subtitles/ship_subtitle_catalog_store.dart:64-80 | lib/src/subtitles/ship_subtitle_kc3_store.dart:61-77 \u2014 before extracting anything, compare \u0060lib/src/subtitles/ship_subtitle_catalog_store.dart\u0060 and \u0060lib/src/subtitles/ship_subtitle_kc3_store.dart\u0060 as WHOLE FILES: this scan already matched 4 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/src/subtitles/ship_subtitle_catalog_store.dart:64\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/src/subtitles/ship_subtitle_catalog_store.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ccb6de58a8e3c0dba7a57b4ea01c33a8d92797582e6694c1e8b5989e0dda21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): tool/akashi_bonus/lib/rule_builder.dart:541-557 | tool/akashi_bonus/lib/rule_builder.dart:574-590 \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/akashi_bonus/lib/rule_builder.dart:541\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":"tool/akashi_bonus/lib/rule_builder.dart"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5c91ec8fe5819179e282ea2104bbbf4d64875ae52074822e8bcb0a67706bf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): lib/src/layout/workspace_context_header.dart:264-279 | lib/src/layout/workspace_context_header.dart:431-446 | lib/src/quest/quest_center_page.dart:592-607 \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/src/layout/workspace_context_header.dart:264\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/layout/workspace_context_header.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"3841bdcccd835f8e10c94b8a16bf98d4b779c71a3826c639ab5e869424c6b678"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): lib/src/logbook/logbook_page.dart:962-977 | lib/src/logbook/logbook_page.dart:991-1006 | lib/src/logbook/logbook_page.dart:1020-1035 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/logbook/logbook_page.dart:962\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_page.dart"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22851c4c8bbba3c1af8f630c22aee4e865eba0147b5ec77fd6df26719d43922"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/src/fleet/fleet_information_center.dart:2566-2581 | lib/src/fleet/fleet_information_center.dart:2589-2604 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/fleet_information_center.dart:2566\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_information_center.dart"},"region":{"startLine":2566}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c1c66b797ef8ee34b5ef8678a4c63d5dfb08851f1b3ba13e47ab6904ee5a6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): lib/src/fleet/repair_summary_card.dart:357-380 | lib/src/fleet/repair_summary_card.dart:469-492 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/repair_summary_card.dart:357\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/repair_summary_card.dart"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15092bebdf19b4718e1a3a0aca663e36b58d9cf8c679b1864477624cff0f5dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/src/inventory/equipment_compatibility_drawer.dart:463-478 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:387-402 \u2014 before extracting anything, compare \u0060lib/src/inventory/equipment_compatibility_drawer.dart\u0060 and \u0060lib/src/inventory/ship_equipment_compatibility_drawer.dart\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/inventory/equipment_compatibility_drawer.dart:463\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/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef7df13858e9e929dc89eb89892439a44491e00a364ec2a6dae1fbaedbcdc1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/src/inventory/equipment_compatibility_drawer.dart:815-830 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:766-781 \u2014 before extracting anything, compare \u0060lib/src/inventory/equipment_compatibility_drawer.dart\u0060 and \u0060lib/src/inventory/ship_equipment_compatibility_drawer.dart\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/inventory/equipment_compatibility_drawer.dart:815\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c73d5deab52467aa118803899ef0e63a8e4338969dd21824c064801669b7fff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/src/inventory/owned_inventory_page.dart:614-629 | lib/src/inventory/owned_inventory_page.dart:1123-1138 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/inventory/owned_inventory_page.dart:614\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/src/inventory/owned_inventory_page.dart"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"b593dec6c93a6318a77236c00c0498eb64fb11ee603d79f0eb6986742f84ef6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/src/layout/workspace_context_header.dart:184-199 | lib/src/layout/workspace_context_header.dart:316-331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/layout/workspace_context_header.dart:184\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/layout/workspace_context_header.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"915d50e7711618da1b59fd7a0efeeeee26f350290564d6233f332501135e5b5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/src/notification/game_notification_coordinator.dart:727-742 | lib/src/notification/game_notification_coordinator.dart:803-818 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/notification/game_notification_coordinator.dart:727\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notification/game_notification_coordinator.dart"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac15354540c76f7e560105a26f5b4297700e8b8ff737d904caa7553b8803e4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): lib/src/subtitles/ship_subtitle_kc3_update_service.dart:164-191 | lib/src/subtitles/ship_subtitle_update_service.dart:250-278 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/subtitles/ship_subtitle_kc3_update_service.dart:164\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/src/subtitles/ship_subtitle_kc3_update_service.dart"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"639546dc89a9e0ff64f7e16157098f4c3d5ee2147811d774169fed44fb00910d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): lib/src/toolbox/sortie_map_query/enemy_catalog_update_service.dart:170-185 | lib/src/toolbox/sortie_map_query/sortie_map_catalog_update_service.dart:221-236 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/toolbox/sortie_map_query/enemy_catalog_update_service.dart:170\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/enemy_catalog_update_service.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a48764808fa3c8712f068b1ee6a06c29aea7772bd99b738b59a05f28e2b1f46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): tool/akashi_bonus/lib/rule_builder.dart:319-336 | tool/akashi_bonus/lib/rule_builder.dart:635-652 \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/akashi_bonus/lib/rule_builder.dart:319\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/akashi_bonus/lib/rule_builder.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb9ab46bc17cbae13d2067628a734017767b0c4887229276c1b6c7a7ca5d6ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): lib/src/settings/enemy_catalog_update_section.dart:52-66 | lib/src/settings/fcd_map_update_section.dart:50-64 | lib/src/settings/quest_catalog_update_section.dart:50-64 | lib/src/settings/sortie_map_catalog_update_section.dart:54-68 | lib/src/subtitles/ship_subtitle_update_section.dart:58-72 \u2014 before extracting anything, compare \u0060lib/src/settings/enemy_catalog_update_section.dart\u0060 and \u0060lib/src/settings/sortie_map_catalog_update_section.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/settings/enemy_catalog_update_section.dart:52\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/enemy_catalog_update_section.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb964c85d2eaf204bc42a1cb0f6e6eb653f362ff70267c7b1bd509ec69701bf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/src/fleet/minimal_status_glow.dart:91-105 | lib/src/fleet/ship_status_visuals.dart:61-75 \u2014 before extracting anything, compare \u0060lib/src/fleet/minimal_status_glow.dart\u0060 and \u0060lib/src/fleet/ship_status_visuals.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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 \u0060oldWidget\u0060 to \u0060_MinimalDamagePulseAnimation\u0060 in one and \u0060DamagePulseBuilder\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/minimal_status_glow.dart"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cafc0064c270230825767fbc46b773dde8d257bd264f21789585b1e5b1c8c5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): lib/src/inventory/owned_inventory_page.dart:2298-2312 | lib/src/logbook/logbook_page.dart:1749-1762 \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/src/inventory/owned_inventory_page.dart:2298\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/owned_inventory_page.dart"},"region":{"startLine":2298}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5c9380f30a4e958961c01c9d53aab4138e2af5a8279a0093a71a63b52d35d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201329 lines \u00D7 2): lib/src/notification/game_notification_coordinator.dart:937-965 | lib/src/notification/game_notification_coordinator.dart:1324-1348 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/notification/game_notification_coordinator.dart:937\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/src/notification/game_notification_coordinator.dart"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"e897abeb5207fd1b152865903543e26ef6d43fa4012a37edec599759619621be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/src/senka/senka_info_view.dart:353-367 | lib/src/senka/senka_info_view.dart:390-404 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/senka/senka_info_view.dart:353\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_info_view.dart"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"29639372df0d99dfbc24382b64bab734bbe51f5efaa8a3aab6b4a72710a57436"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): lib/src/toolbox/sortie_map_query/sortie_map_query_page.dart:628-641 | lib/src/toolbox/sortie_map_query/sortie_map_query_page.dart:739-753 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/toolbox/sortie_map_query/sortie_map_query_page.dart:628\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/sortie_map_query_page.dart"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"205d4b0db07acb951f54673e3b3165d628b9fc8c465f25fcabc1a80deefb2fbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): lib/src/widgets/frozen_data_table.dart:340-352 | lib/src/widgets/frozen_data_table.dart:385-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/src/widgets/frozen_data_table.dart:340\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/widgets/frozen_data_table.dart"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d8b3cd571938a2c7e191998483215423d90777bdbdd1777ebe288ed627ee7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): tool/akashi_bonus/lib/rule_builder.dart:415-429 | tool/akashi_bonus/lib/rule_builder.dart:708-722 \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":"tool/akashi_bonus/lib/rule_builder.dart"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eaa02b0f2191dd6f6423a7fea0ace3cb58f7ba728e1608a268ec0c635a4c465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): tool/akashi_bonus/lib/rule_builder.dart:852-866 | tool/akashi_bonus/lib/rule_builder.dart:874-887 \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/akashi_bonus/lib/rule_builder.dart:852\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":"tool/akashi_bonus/lib/rule_builder.dart"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e40e8fb33ff2dbc804849a7c7da14660bb1e8a92fcc9226121fa46211986b71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 4): lib/src/layout/workspace_context_header.dart:183-196 | lib/src/layout/workspace_context_header.dart:263-274 | lib/src/layout/workspace_context_header.dart:315-328 | lib/src/layout/workspace_context_header.dart:430-441 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/layout/workspace_context_header.dart:183\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/src/layout/workspace_context_header.dart"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cb3732195703ab76c602f51f53e3db10ee8ddf334b7f347390bdae748c4eb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): lib/src/settings/notification_settings_page.dart:154-167 | lib/src/settings/notification_settings_page.dart:222-235 | lib/src/settings/notification_settings_page.dart:288-301 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/notification_settings_page.dart"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e3b8cdaf54690712468494f2b08b5bda55369f04e50227bf40c9e2b1c0b100"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): lib/src/battle/fcd_map_update_service.dart:219-232 | lib/src/quest/quest_catalog_update_service.dart:222-234 \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/src/battle/fcd_map_update_service.dart:219\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/fcd_map_update_service.dart"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d5ea6debac7c6587f4c7693af67d9cc0f6e20e38e56c2a04222d75357957f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/src/development/development_output_table.dart:93-106 | lib/src/development/development_recipe_table.dart:48-61 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/development/development_output_table.dart:93\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/src/development/development_output_table.dart:108\u0060 calls \u0060DataColumn\u0060, \u0060Text\u0060 and \u0060lib/src/development/development_recipe_table.dart:63\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/development/development_output_table.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad68cba3eee0771d1f22630c19d1b07b77aa53b12065a3cb66d5cfc61528243"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/src/fleet/fleet_information_center.dart:2852-2865 | lib/src/fleet/fleet_information_center.dart:2923-2936 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_information_center.dart"},"region":{"startLine":2852}}}],"partialFingerprints":{"codehealthFindingId/v1":"caab9e3d2c0c52143b844c18433d5365d8b92575b25c6a8a50f0f66f59832504"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/src/localization/record_backup_strings.dart:240-253 | lib/src/localization/record_backup_strings.dart:255-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/localization/record_backup_strings.dart"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18d4f8aaa403900efae3f8c39fe6af0695237d781a4298c9a9c26df1d0eeaed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): lib/src/notification/game_notification_coordinator.dart:1021-1034 | lib/src/notification/game_notification_coordinator.dart:1375-1386 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/notification/game_notification_coordinator.dart:1021\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/src/notification/game_notification_coordinator.dart:1387\u0060 calls \u0060ceil\u0060 and \u0060lib/src/notification/game_notification_coordinator.dart:1035\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notification/game_notification_coordinator.dart"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda322ceb02e636e2450097a85f5293a02d5984d62457229af602cdd5332f62f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/src/settings/data_settings_page.dart:422-435 | lib/src/settings/data_settings_page.dart:480-493 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/settings/data_settings_page.dart:422\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/src/settings/data_settings_page.dart"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb721276bf5dac612ffb585b9588981004795b2cb3355e76b36e90f3755dc0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): lib/src/settings/game_connector_section.dart:141-154 | lib/src/settings/game_rendering_mode_section.dart:161-174 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/settings/game_connector_section.dart:141\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/game_connector_section.dart"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"591ee2e7ec8148f85d01506d385ccaff3ed1147b149a448cc0a29f9423f0e3c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): lib/src/notification/game_notification_coordinator.dart:658-671 | lib/src/notification/game_notification_coordinator.dart:733-745 | lib/src/notification/game_notification_coordinator.dart:809-821 | lib/src/notification/game_notification_coordinator.dart:990-1002 | lib/src/notification/game_notification_coordinator.dart:1063-1075 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/notification/game_notification_coordinator.dart:658\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notification/game_notification_coordinator.dart"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"017e0d96065dec71782485513dc87c8468fed1293337d11aa58efc9613c105b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): lib/src/settings/about_support_settings_page.dart:50-62 | lib/src/settings/battle_settings_page.dart:27-39 | lib/src/settings/network_settings_page_new.dart:42-54 | lib/src/settings/sound_settings_page.dart:14-26 \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/src/settings/about_support_settings_page.dart:50\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/src/settings/about_support_settings_page.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e24cc18bdb87f07da894338017b8c68540546a327847cc677d90b58b21d87e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): lib/src/improvement/improvement_dataset_update_section.dart:16-28 | lib/src/settings/fcd_map_update_section.dart:17-29 | lib/src/settings/quest_catalog_update_section.dart:17-29 \u2014 before extracting anything, compare \u0060lib/src/improvement/improvement_dataset_update_section.dart\u0060 and \u0060lib/src/settings/fcd_map_update_section.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. 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/src/improvement/improvement_dataset_update_section.dart:16\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/improvement/improvement_dataset_update_section.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ae7318ea4c23f1dff12182c7d5524d7984a8fc4e2d80495a749d08ad4b5463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): lib/src/settings/game_rendering_mode_section.dart:88-99 | lib/src/settings/game_resource_cache_section.dart:285-296 | lib/src/settings/network_settings_section.dart:624-636 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/settings/game_rendering_mode_section.dart:88\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/game_rendering_mode_section.dart"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e02aebc80db869a0e729b086a59830a45dcaa5d7d4c2b8a63b04bbcb05fa5d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/src/battle/battle_ship_details_popover.dart:190-202 | lib/src/fleet/fleet_metric_details_popover.dart:163-175 \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/src/battle/battle_ship_details_popover.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_ship_details_popover.dart"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"65117b5d820b18dc38a8c6e9a32acce1f3226c8e033e366c07718c8cad9c716a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/src/fleet/fleet_information_center.dart:1319-1331 | lib/src/fleet/fleet_ship_status_capsule.dart:738-750 \u2014 before extracting anything, compare \u0060lib/src/fleet/fleet_information_center.dart\u0060 and \u0060lib/src/fleet/fleet_ship_status_capsule.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/fleet_information_center.dart:1319\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/src/fleet/fleet_information_center.dart"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db62cdef66f6c02a789902bea81247753ebfcdee5e7e7f41633a11a55994bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/src/inventory/equipment_compatibility_drawer.dart:423-435 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:348-360 \u2014 before extracting anything, compare \u0060lib/src/inventory/equipment_compatibility_drawer.dart\u0060 and \u0060lib/src/inventory/ship_equipment_compatibility_drawer.dart\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/inventory/equipment_compatibility_drawer.dart:423\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aed6ea17a3b0fd65409c5b07b8a3d7f2a9fd0ef6c175ad8df73b2e78aaf8ff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/src/inventory/equipment_compatibility_drawer.dart:763-775 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:718-730 \u2014 before extracting anything, compare \u0060lib/src/inventory/equipment_compatibility_drawer.dart\u0060 and \u0060lib/src/inventory/ship_equipment_compatibility_drawer.dart\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/inventory/equipment_compatibility_drawer.dart:763\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"a217fde0bc3902af2200840c0df7fa56ef315d5d5a9f2acb2b3510bdc72db49d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/src/settings/fleet_display_settings_section.dart:131-143 | lib/src/settings/fleet_display_settings_section.dart:219-231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/settings/fleet_display_settings_section.dart:131\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/fleet_display_settings_section.dart"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6337230e1dfd93166d1d4405bc0c3790797f369fb00b4f83949876cea39ad158"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): tool/akashi_bonus/lib/rule_builder.dart:653-665 | tool/akashi_bonus/lib/rule_builder.dart:723-735 \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/akashi_bonus/lib/rule_builder.dart:653\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":"tool/akashi_bonus/lib/rule_builder.dart"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49e6f9bdb60e2407195f4017e758db548271a5a4ff14be8133dddc1e403302c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): lib/src/settings/fleet_display_settings_section.dart:92-103 | lib/src/settings/fleet_display_settings_section.dart:130-141 | lib/src/settings/fleet_display_settings_section.dart:218-229 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/settings/fleet_display_settings_section.dart:92\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/fleet_display_settings_section.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0733c88bd5d0e3a8472fc6edf52967636f1a409d4f637b170c191453e102e98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/src/battle/battle_records_page.dart:80-91 | lib/src/fleet/fleet_information_center.dart:267-278 \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/src/battle/battle_records_page.dart:80\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/src/battle/battle_records_page.dart"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de268198724863c5459e5db95893afeffab2829b5a7878764787ba9f103e848"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/src/battle/fcd_map_store.dart:256-267 | lib/src/quest/quest_catalog_store.dart:360-371 \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/src/battle/fcd_map_store.dart:256\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/fcd_map_store.dart"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9477fcc091996b08a018458c140b285213825617d02d1f32ec3a67e8f184190"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): lib/src/development/development_equipment_picker.dart:150-160 | lib/src/development/development_secretary_picker.dart:235-246 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/development/development_equipment_picker.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/src/development/development_equipment_picker.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdddd253a2a955e10da4c932fbed15d9486bf3ad0316ab31d0bd88b4fb4c22c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/src/development/development_output_table.dart:70-81 | lib/src/development/development_recipe_table.dart:156-167 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/development/development_output_table.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/src/development/development_output_table.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66d78394aaa345bd815f8aad1afdf97155041a3cef29cac64c567a83be89a7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/src/development/development_secretary_picker.dart:196-207 | lib/src/inventory/equipment_compatibility_drawer.dart:477-488 \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/src/development/development_secretary_picker.dart:196\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/development/development_secretary_picker.dart"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43a81f30eed26379d0c50a2cea923bcb5cbf5ad7961d135f910da37944240c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/src/fleet/anchorage_repair_view.dart:548-559 | lib/src/fleet/nosaki_sparkle_view.dart:335-346 \u2014 before extracting anything, compare \u0060lib/src/fleet/anchorage_repair_view.dart\u0060 and \u0060lib/src/fleet/nosaki_sparkle_view.dart\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/anchorage_repair_view.dart:548\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/src/fleet/anchorage_repair_view.dart"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3e31b5833ae032906c8026d11bb4ab40578a3dfb8359ebb61e52ab44045b87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/src/fleet/ship_portrait.dart:147-158 | lib/src/fleet/slot_item_portrait.dart:14-25 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/ship_portrait.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf135db6b395a8c2e6eeffebaf002df934d78088a6def394a83a61a570dd9da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/src/inventory/equipment_compatibility_drawer.dart:678-689 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:599-610 \u2014 before extracting anything, compare \u0060lib/src/inventory/equipment_compatibility_drawer.dart\u0060 and \u0060lib/src/inventory/ship_equipment_compatibility_drawer.dart\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/inventory/equipment_compatibility_drawer.dart:678\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"a252d79fee0ff9bd5b8438af80e883e7c145c9240a36fade1d3a0ce4296388be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/src/inventory/owned_inventory_page.dart:710-721 | lib/src/inventory/owned_inventory_page.dart:759-770 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/inventory/owned_inventory_page.dart:710\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/owned_inventory_page.dart"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"135b94b52685dcc1df557859577a251bde2d60391c486942c942dd30f08d8564"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): lib/src/inventory/owned_inventory_page.dart:1839-1849 | lib/src/inventory/owned_inventory_page.dart:1860-1871 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/inventory/owned_inventory_page.dart:1839\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/owned_inventory_page.dart"},"region":{"startLine":1839}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0bf3a028f2f1bc2fec2d9af9c591c54b05ddb2c68b7b99a523eb939648ae7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): lib/src/senka/senka_controller.dart:154-163 | lib/src/senka/senka_controller.dart:275-286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/senka/senka_controller.dart:154\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_controller.dart"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f666d3f91b0dfd4cdd53fb9d65e501db3379989f0f0a9fe66e82ea62087c4e19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): lib/src/settings/gadget_bypass_section.dart:207-217 | lib/src/settings/network_settings_section.dart:455-466 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/settings/gadget_bypass_section.dart:207\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/gadget_bypass_section.dart"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff13b550cff45bc5641553096b696ca4245f193de78531f24b68fcfebaf49af8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/src/toolbox/composition_image_card.dart:421-432 | lib/src/toolbox/composition_image_card.dart:1205-1216 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/toolbox/composition_image_card.dart:421\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/composition_image_card.dart"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5290102cc6b2f843a02a70c016b88b5ccd8cf9ed928f850b5f866661485fb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): lib/src/toolbox/game_mods/game_mods_strings.dart:57-68 | lib/src/toolbox/game_mods/game_mods_strings.dart:1137-1147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/toolbox/game_mods/game_mods_strings.dart:57\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_strings.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9158e6e279b1af5c3cc1aa0e6ceeb8195db1697a372def0954589d7d930c42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): lib/src/fleet/minimal_status_glow.dart:91-101 | lib/src/fleet/ship_status_visuals.dart:61-71 | lib/src/fleet/ship_status_visuals.dart:198-207 \u2014 before extracting anything, compare \u0060lib/src/fleet/minimal_status_glow.dart\u0060 and \u0060lib/src/fleet/ship_status_visuals.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/minimal_status_glow.dart:91\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060oldWidget\u0060 to \u0060_MinimalDamagePulseAnimation\u0060 in one and \u0060DamagePulseBuilder\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/minimal_status_glow.dart"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cdbb2e0e1dde86cf08a9212cee3e1c86160f61346767b552e7c5649956a99b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): lib/src/inventory/equipment_compatibility_drawer.dart:587-597 | lib/src/inventory/equipment_compatibility_drawer.dart:663-673 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:514-524 \u2014 before extracting anything, compare \u0060lib/src/inventory/equipment_compatibility_drawer.dart\u0060 and \u0060lib/src/inventory/ship_equipment_compatibility_drawer.dart\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/inventory/equipment_compatibility_drawer.dart:587\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/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f5491276d7ce16e08e89dcf7d4b61ae0d67570c9ae3db77d33878dfb2a7db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/src/battle/detailed_battle_panel.dart:213-223 | lib/src/battle/live_battle_card.dart:1148-1158 \u2014 before extracting anything, compare \u0060lib/src/battle/detailed_battle_panel.dart\u0060 and \u0060lib/src/battle/live_battle_card.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/battle/detailed_battle_panel.dart:213\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/detailed_battle_panel.dart"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee5f3bc9bc5c21052fb5b06605619a5242cf45eb23f3ec9f0786472b50019f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): lib/src/fleet/anchorage_repair_view.dart:427-436 | lib/src/fleet/nosaki_sparkle_view.dart:161-171 \u2014 before extracting anything, compare \u0060lib/src/fleet/anchorage_repair_view.dart\u0060 and \u0060lib/src/fleet/nosaki_sparkle_view.dart\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/anchorage_repair_view.dart:427\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/src/fleet/anchorage_repair_view.dart"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"0570c3ea2274a28177baca0f81684d907369cac1ec84b7f8ea127f5fabd18897"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/src/fleet/anchorage_repair_view.dart:561-571 | lib/src/fleet/nosaki_sparkle_view.dart:348-358 \u2014 before extracting anything, compare \u0060lib/src/fleet/anchorage_repair_view.dart\u0060 and \u0060lib/src/fleet/nosaki_sparkle_view.dart\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/anchorage_repair_view.dart:561\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/anchorage_repair_view.dart"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6718a6ad5f16b8f735a11ef7367398125f86f57cd5861d15eaa9a690e80d3b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): lib/src/fleet/fleet_information_center.dart:1461-1470 | lib/src/fleet/fleet_information_center.dart:3299-3309 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/fleet_information_center.dart:1461\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_information_center.dart"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d60a8a710a00679b3a5933aee8017339d61e4c09148c2522360bf4252be40a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/src/game_state/game_state_reducer.dart:2012-2022 | lib/src/game_state/game_state_reducer.dart:2068-2078 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/game_state/game_state_reducer.dart:2012\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":2012}}}],"partialFingerprints":{"codehealthFindingId/v1":"818e0811029a48bacfa9250bdc39bff1af3c4a48173581714bfd050c5fb82614"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): lib/src/improvement/improvement_dataset_update_service.dart:138-146 | lib/src/quest/quest_catalog_update_service.dart:233-243 \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/src/improvement/improvement_dataset_update_service.dart:138\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/improvement/improvement_dataset_update_service.dart"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c435bd6204545f0c0003e54120971b73fa18406bfc9a71664d147383161529"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/src/layout/workspace_context_header.dart:510-520 | lib/src/layout/workspace_context_header.dart:567-577 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/layout/workspace_context_header.dart:510\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/src/layout/workspace_context_header.dart"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a19d59c9e5178e9120c45d3e93b7aabb56277f20395f30012e7f1319a6fd99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/src/logbook/battle_detail_page.dart:82-92 | lib/src/logbook/battle_detail_page.dart:301-311 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/logbook/battle_detail_page.dart:82\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/battle_detail_page.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a7224fa9f4f7ad7abbc88b610f3f62d099a4de71e9a70959c3f55b7a0a1f35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/src/settings/app_exit_settings_section.dart:12-22 | lib/src/settings/game_mouse_wheel_settings_section.dart:11-21 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/settings/app_exit_settings_section.dart:12\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/app_exit_settings_section.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6a8b0e69dca311ba84d10791432bcaa9a09f3fd14e8594466ad25ac257dbe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/src/settings/notification_settings_page.dart:173-183 | lib/src/settings/notification_settings_page.dart:275-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/settings/notification_settings_page.dart:173\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/notification_settings_page.dart"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad767f66ccd3d2c4508421823b79e6ed25b03318c6f141af98ffbba2cc1fd62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): lib/src/subtitles/ship_subtitle_kc3_update_service.dart:150-160 | lib/src/subtitles/ship_subtitle_update_service.dart:237-246 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/subtitles/ship_subtitle_kc3_update_service.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_kc3_update_service.dart"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d71fa008e474f931de7fc00689383e534f907fedfeff455c186fd33804428b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/src/subtitles/ship_subtitle_strings.dart:14-24 | lib/src/toolbox/game_mods/game_mods_strings.dart:14-24 \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 before the matched lines, \u0060lib/src/toolbox/game_mods/game_mods_strings.dart:13\u0060 calls \u0060_t\u0060 and \u0060lib/src/subtitles/ship_subtitle_strings.dart:12\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_strings.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e6736b49a35e1f1536357f16dcce4e971cffe4f9d05fb79bca8278c53f935c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/src/toolbox/game_mods/game_mods_page.dart:1694-1704 | lib/src/toolbox/game_mods/game_mods_page.dart:1832-1842 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/toolbox/game_mods/game_mods_page.dart:1694\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/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d7edb5690931da81450dbc46507d6c6733fee11482f8436942f4352bc99cb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): lib/src/toolbox/game_mods/game_mods_page.dart:1739-1748 | lib/src/toolbox/game_mods/game_mods_page.dart:1850-1860 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/toolbox/game_mods/game_mods_page.dart:1739\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":1739}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c049e8aed16c657f4a145e85d4beb9cfb6ca1f839887e50d52afb426b8da41c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tool/akashi_bonus/lib/models.dart:338-348 | tool/wiki_bonus/lib/models.dart:299-309 \u2014 before extracting anything, compare \u0060tool/akashi_bonus/lib/models.dart\u0060 and \u0060tool/wiki_bonus/lib/models.dart\u0060 as WHOLE FILES: this scan already matched 7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/akashi_bonus/lib/models.dart"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4430943356bde8881226efb32dfd22003ba219a325a90a86f44d484d3758c3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7): lib/src/improvement/improvement_dataset_update_section.dart:20-29 | lib/src/settings/fcd_map_update_section.dart:21-30 | lib/src/settings/gadget_bypass_section.dart:104-114 | lib/src/settings/game_rendering_mode_section.dart:89-98 | lib/src/settings/game_resource_cache_section.dart:286-295 | lib/src/settings/network_settings_section.dart:625-634 | lib/src/settings/quest_catalog_update_section.dart:21-30 \u2014 before extracting anything, compare \u0060lib/src/improvement/improvement_dataset_update_section.dart\u0060 and \u0060lib/src/settings/fcd_map_update_section.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. 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/src/improvement/improvement_dataset_update_section.dart:20\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/improvement/improvement_dataset_update_section.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc66d5fc792b09820e48da2764764f6e1438e064c5e44e76c108f31af19e4ba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): lib/src/localization/record_backup_strings.dart:12-21 | lib/src/toolbox/composition_image_strings.dart:17-26 | lib/src/toolbox/exp_calc/exp_calc_strings.dart:8-17 | lib/src/toolbox/sortie_map_query/sortie_map_query_strings.dart:16-25 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/localization/record_backup_strings.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d917ca38b18671eb98ac0409773a9bb84b3301561aa1b4dff9409dbdf2c9b087"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/src/backup/record_backup.dart:1442-1451 | lib/src/backup/record_backup.dart:1456-1465 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/backup/record_backup.dart:1442\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/backup/record_backup.dart"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0de7b0cf9872aef109047a0a11746d8432b59df12d96b2af4d58303a2aa645f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/src/battle/battle_controller.dart:1559-1568 | lib/src/logbook/logbook_event_recorder.dart:89-98 \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/src/battle/battle_controller.dart:1559\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_controller.dart"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"53de5bd4af392d6c331a1f4d3b71f3a3f38a995334469787f8850d36ab5ba988"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/src/battle/live_battle_card.dart:330-339 | lib/src/fleet/pre_sortie_check_summary.dart:545-554 \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/src/battle/live_battle_card.dart:330\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/src/battle/live_battle_card.dart"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e9862996302208d10ea6e4498cb75e778f6319e24d61c55ed331d14f4a7cee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/src/game_state/game_state_serializer.dart:336-345 | lib/src/game_state/game_state_serializer.dart:640-649 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_serializer.dart"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd19235f0c04771795ec555e7f5d81e1a354787896a0bc0af1156a36217bfec1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/src/settings/data_settings_page.dart:555-564 | lib/src/settings/network_settings_page_new.dart:119-128 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/data_settings_page.dart"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd02d4fabb645f476fd4c999728752d4b803ecc976eea3ae4e1e8b0752f196b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/src/subtitles/ship_subtitle_catalog_store.dart:115-126 | lib/src/subtitles/ship_subtitle_kc3_store.dart:111-122 \u2014 before extracting anything, compare \u0060lib/src/subtitles/ship_subtitle_catalog_store.dart\u0060 and \u0060lib/src/subtitles/ship_subtitle_kc3_store.dart\u0060 as WHOLE FILES: this scan already matched 4 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/src/subtitles/ship_subtitle_catalog_store.dart:115\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_catalog_store.dart"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4255dd8269844cda93dc5620701552cb2c3c65a1b972dc417fc98884bdfbb9fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): tool/akashi_bonus/lib/name_resolver.dart:319-331 | tool/akashi_bonus/lib/name_resolver.dart:529-541 \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/akashi_bonus/lib/name_resolver.dart:319\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/akashi_bonus/lib/name_resolver.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"342273d63d7cba158106812ec0deb03e20e0edfb6a951173b722234428bbcdca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201310 lines \u00D7 4): tool/akashi_bonus/lib/name_resolver.dart:318-320 | tool/akashi_bonus/lib/name_resolver.dart:402-409 | tool/akashi_bonus/lib/name_resolver.dart:480-489 | tool/akashi_bonus/lib/name_resolver.dart:527-530 \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 \u0060tool/akashi_bonus/lib/name_resolver.dart:318\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":"tool/akashi_bonus/lib/name_resolver.dart"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"a814800a26e4ec25446065233061f749c81472c32f9db6efbbac66742eb0086b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): lib/src/improvement/improvement_dataset_update_section.dart:14-22 | lib/src/settings/fcd_map_update_section.dart:15-23 | lib/src/settings/quest_catalog_update_section.dart:15-23 | lib/src/settings/quest_progress_update_section.dart:14-22 \u2014 before extracting anything, compare \u0060lib/src/improvement/improvement_dataset_update_section.dart\u0060 and \u0060lib/src/settings/fcd_map_update_section.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. 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/src/improvement/improvement_dataset_update_section.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/improvement/improvement_dataset_update_section.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d1a408c767b872f7cf8f3757b4a028025f21481087ab836ecc97c26c80450f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): lib/src/settings/display_mode_section.dart:12-20 | lib/src/settings/enemy_catalog_update_section.dart:16-24 | lib/src/settings/game_frame_rate_settings_section.dart:16-24 | lib/src/settings/sortie_map_catalog_update_section.dart:16-24 \u2014 before extracting anything, compare \u0060lib/src/settings/enemy_catalog_update_section.dart\u0060 and \u0060lib/src/settings/sortie_map_catalog_update_section.dart\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/settings/display_mode_section.dart:12\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/src/settings/enemy_catalog_update_section.dart:25\u0060 calls \u0060Row\u0060, \u0060Expanded\u0060 and \u0060lib/src/settings/game_frame_rate_settings_section.dart:25\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/display_mode_section.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd411f4810d49327d3a99154a32b7a1fe250e4f43ba151259d901ae4890e63af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): lib/src/fleet/anchorage_repair_view.dart:799-807 | lib/src/fleet/land_base_summary_card.dart:522-530 | lib/src/fleet/land_base_summary_card.dart:582-590 \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/src/fleet/anchorage_repair_view.dart:799\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/anchorage_repair_view.dart"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1534b290e7295776f6630b2857cc93b5b406ffc1c4c969506131c50f20b270"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): lib/src/battle/battle_records_page.dart:305-312 | lib/src/toolbox/composition_image_card.dart:494-502 \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/src/toolbox/composition_image_card.dart:494\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_records_page.dart"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab26e2b1e2466dcaa9bf1d1bb039b6aa0530ac86c2057215089e4153f36aa7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/src/battle/detailed_battle_panel.dart:281-289 | lib/src/battle/live_battle_card.dart:466-474 \u2014 before extracting anything, compare \u0060lib/src/battle/detailed_battle_panel.dart\u0060 and \u0060lib/src/battle/live_battle_card.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/detailed_battle_panel.dart"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20e93bd372e2973fb57a904777b9289b01f42ee5f09f0f9c5aa280754a338e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): lib/src/battle/detailed_battle_panel.dart:294-302 | lib/src/battle/live_battle_card.dart:486-493 \u2014 before extracting anything, compare \u0060lib/src/battle/detailed_battle_panel.dart\u0060 and \u0060lib/src/battle/live_battle_card.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/detailed_battle_panel.dart"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c33f1f41f3f161826e0d8ed4ee94f3ae7ad8414e591d74f71d6ac89aa4cd76f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/src/fleet/fleet_information_center.dart:1654-1662 | lib/src/fleet/fleet_information_center.dart:1947-1955 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/fleet_information_center.dart:1654\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_information_center.dart"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"2713fe94a1bb096f6c04e3f8a151b7bd5fef9665e84af5f499c5ed60036b2796"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/src/inventory/equipment_compatibility_drawer.dart:229-237 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:223-231 \u2014 before extracting anything, compare \u0060lib/src/inventory/equipment_compatibility_drawer.dart\u0060 and \u0060lib/src/inventory/ship_equipment_compatibility_drawer.dart\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/inventory/equipment_compatibility_drawer.dart:229\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e542c78d88a3e2f9db2fa85e2a9e3331f6fb152eaadcad995e96a25f478edb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/src/logbook/logbook_database.dart:1647-1655 | lib/src/logbook/logbook_database.dart:1688-1696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/logbook/logbook_database.dart:1647\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/src/logbook/logbook_database.dart"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"c519c6c9a380b7406ef70882035c894d85d3ba862d4ba9e240432f719d840366"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/src/logbook/logbook_page.dart:1499-1507 | lib/src/logbook/logbook_page.dart:1527-1535 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/logbook/logbook_page.dart:1499\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_page.dart"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c740ca0b7c72c0db261efd3fe4c40ec457b15dbd50beda8959beb7f9aed6fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): lib/src/subtitles/ship_subtitle_kc3_bundle.dart:189-196 | lib/src/subtitles/ship_subtitle_update_service.dart:178-186 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/subtitles/ship_subtitle_kc3_bundle.dart:189\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_kc3_bundle.dart"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6800ff0fb285fb6823b85cd85c459c5b9f8a45e112edf2fee0d09ef42ff8ba7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/src/toolbox/game_mods/game_mods_strings.dart:70-78 | lib/src/toolbox/game_mods/game_mods_strings.dart:85-93 \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/src/toolbox/game_mods/game_mods_strings.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdc655c40d276dee0b33764f7476f40663ab0a0d1893e2ad82bd953160ce954"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/src/toolbox/sortie_map_query/sortie_map_query_page.dart:571-579 | lib/src/toolbox/sortie_map_query/sortie_map_query_page.dart:693-701 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/toolbox/sortie_map_query/sortie_map_query_page.dart:571\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/sortie_map_query_page.dart"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d2ead9a01a1c96698371523a33fb92298ae3a0bcf1d9cd8d0c0e3a54453c83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): lib/src/fleet/anchorage_repair_view.dart:799-806 | lib/src/fleet/fleet_information_center.dart:1323-1330 | lib/src/fleet/fleet_ship_status_capsule.dart:742-749 | lib/src/fleet/land_base_summary_card.dart:522-529 | lib/src/fleet/land_base_summary_card.dart:582-589 | lib/src/fleet/nosaki_sparkle_view.dart:680-687 \u2014 before extracting anything, compare \u0060lib/src/fleet/anchorage_repair_view.dart\u0060 and \u0060lib/src/fleet/nosaki_sparkle_view.dart\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/anchorage_repair_view.dart:799\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/anchorage_repair_view.dart"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"6624b4741790cda78b301d1912078fd48598c60390c2b82729da154b613172c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): lib/src/battle/battle_records_page.dart:81-88 | lib/src/fleet/fleet_information_center.dart:268-275 | lib/src/quest/quest_center_page.dart:565-572 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_records_page.dart"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"864f05b6083da276e6fd91fe0e8526fad44532c05101f6010c2c9ef84ba9972f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): lib/src/expedition/expedition_check_page.dart:219-226 | lib/src/fleet/anchorage_repair_view.dart:359-366 | lib/src/fleet/nosaki_sparkle_view.dart:80-87 \u2014 before extracting anything, compare \u0060lib/src/fleet/anchorage_repair_view.dart\u0060 and \u0060lib/src/fleet/nosaki_sparkle_view.dart\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/expedition/expedition_check_page.dart:219\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/src/expedition/expedition_check_page.dart"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe19af3ee2d0ee4b9930a3556d624dee2a47521d9e2b580a433ebdf448b8678"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/backup/record_backup.dart:1346-1353 | lib/src/backup/record_backup.dart:1410-1417 \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/src/backup/record_backup.dart:1409\u0060 calls \u0060encodeJournal\u0060 and \u0060lib/src/backup/record_backup.dart:1345\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/backup/record_backup.dart"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff807638efbc56ecc00f249ffb77cc04acc69b9bf4a81ff7ed4d91b5be079da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): lib/src/fleet/anchorage_repair_view.dart:173-179 | lib/src/fleet/repair_summary_card.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 both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/repair_summary_card.dart:590\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/anchorage_repair_view.dart"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2956181d4b6be62b3f6d7079003b15d38e54dae5b9a27a39e3127873872c7b7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/fleet/fleet_information_center.dart:3291-3298 | lib/src/quest/quest_center_page.dart:1550-1557 \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/src/fleet/fleet_information_center.dart:3291\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_information_center.dart"},"region":{"startLine":3291}}}],"partialFingerprints":{"codehealthFindingId/v1":"d682740b2cee2ca3b46eca2fc36dd9be26df6b5bef8e6e1977bda92a80d21ba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/fleet/fleet_ship_minimal_row.dart:476-483 | lib/src/fleet/pre_sortie_check_summary.dart:709-716 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/fleet_ship_minimal_row.dart:476\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_ship_minimal_row.dart"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e4c4e7567146f8f907a5733463ed9135e3d16c393ddc35387e32fc1259607d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/fleet/land_base_summary_card.dart:902-909 | lib/src/fleet/pre_sortie_check_summary.dart:712-719 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/land_base_summary_card.dart:902\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/land_base_summary_card.dart"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"7575ab229e97059fb12284981bd479d85397e630839b655999e993c4f2d9145f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/fleet/operation_status_views.dart:108-115 | lib/src/fleet/operation_status_views.dart:263-270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/operation_status_views.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/src/fleet/operation_status_views.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6a22259918cc1e1dfb28ab708e2b866e7ef39b359acde43367c72d7962d7b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/fleet/pre_sortie_check_summary.dart:549-556 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:638-645 \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/src/fleet/pre_sortie_check_summary.dart:549\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/pre_sortie_check_summary.dart"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fbbe4c6080d57334871bf2066e6c229b5dafd0fefd562d584263561f5bfcd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/fleet/repair_summary_card.dart:269-276 | lib/src/fleet/repair_summary_card.dart:387-394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/repair_summary_card.dart"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b6144566dd31483b8c2943d8fd0665564d27369d19a137f365abd69a97d873"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/inventory/equipment_compatibility_drawer.dart:790-797 | lib/src/inventory/ship_equipment_compatibility_drawer.dart:734-741 \u2014 before extracting anything, compare \u0060lib/src/inventory/equipment_compatibility_drawer.dart\u0060 and \u0060lib/src/inventory/ship_equipment_compatibility_drawer.dart\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 263 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/inventory/equipment_compatibility_drawer.dart:790\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61e5e95bb2acf81fcaf781c32278bc8301e440020c2597dfa4a7fe84d6dd631"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/logbook/logbook_page.dart:1482-1489 | lib/src/logbook/logbook_page.dart:1510-1517 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/logbook/logbook_page.dart:1482\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060lib/src/logbook/logbook_page.dart:1490\u0060 calls \u0060_ResourceHeader\u0060 and \u0060lib/src/logbook/logbook_page.dart:1518\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_page.dart"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dfd6e6d6badeb52a9d088fb2cc7c15b39d45a7dfdb2e9a5c20965b8b21aa7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/settings/diagnostic_user_section.dart:105-112 | lib/src/settings/diagnostic_user_section.dart:148-155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/settings/diagnostic_user_section.dart:105\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/diagnostic_user_section.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0384879584067573b8b55a1150e460284e4ac17053b06b30bf6a9ad5f9af2e42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): lib/src/battle/battle_pills.dart:291-296 | lib/src/battle/battle_pills.dart:676-682 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/battle/battle_pills.dart:291\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_pills.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"5984765619d1c04b0386ac0a3be6187ed40966bfa9df6df5ca5830cf37a531eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart:267-273 | lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart:428-434 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebe19f0da16f04135e196bb6fb1f75055e2006b71ad5676fe2e3f318fff7314"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/src/game_state/game_state_reducer.dart:936-942 | lib/src/game_state/game_state_reducer.dart:2285-2291 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/game_state/game_state_reducer.dart:936\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"553ac636330e22b0c89059c18a2e9d08a6e9bb05a0b11bbeceb263656bced915"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/src/game_state/game_state_reducer.dart:2589-2595 | lib/src/game_state/game_state_reducer.dart:2706-2712 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/game_state/game_state_reducer.dart:2589\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/src/game_state/game_state_reducer.dart"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcc99932cb374e4aebb28d16ab293848941195a1e2b6c502964a1e4a441c57e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/src/notification/game_notification_coordinator.dart:376-382 | lib/src/notification/game_notification_coordinator.dart:418-424 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/notification/game_notification_coordinator.dart:376\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notification/game_notification_coordinator.dart"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fa06fafe751bd55aa7f355357ca9db1e9ab2e05308b624a300ecbe6996aa8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tool/akashi_bonus/lib/models.dart:30-36 | tool/wiki_bonus/lib/models.dart:30-36 \u2014 before extracting anything, compare \u0060tool/akashi_bonus/lib/models.dart\u0060 and \u0060tool/wiki_bonus/lib/models.dart\u0060 as WHOLE FILES: this scan already matched 7 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. 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":"tool/akashi_bonus/lib/models.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b02fcadeaef6bc57976901b5acb34c9d03c49d605ae6aa02df2b387789b5273"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7): lib/src/fleet/anchorage_repair_view.dart:798-803 | lib/src/fleet/fleet_information_center.dart:1322-1327 | lib/src/fleet/fleet_ship_status_capsule.dart:741-746 | lib/src/fleet/land_base_summary_card.dart:521-526 | lib/src/fleet/land_base_summary_card.dart:581-586 | lib/src/fleet/nosaki_sparkle_view.dart:679-684 | lib/src/logbook/battle_detail_page.dart:496-501 \u2014 before extracting anything, compare \u0060lib/src/fleet/anchorage_repair_view.dart\u0060 and \u0060lib/src/fleet/nosaki_sparkle_view.dart\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/fleet/anchorage_repair_view.dart:798\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/src/fleet/anchorage_repair_view.dart:795\u0060 calls \u0060fleetText\u0060 and \u0060lib/src/fleet/nosaki_sparkle_view.dart:675\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/anchorage_repair_view.dart"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06a354230a4f5b342a98d42284a3f148483dec204c39535035ffca21ad30a8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): lib/src/game_state/game_state_serializer.dart:519-524 | lib/src/game_state/game_state_serializer.dart:537-542 | lib/src/game_state/game_state_serializer.dart:553-558 | lib/src/game_state/game_state_serializer.dart:624-629 | lib/src/game_state/game_state_serializer.dart:655-660 | lib/src/game_state/game_state_serializer.dart:678-683 \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/src/game_state/game_state_serializer.dart:519\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_serializer.dart"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"831a96d77b33db5faf22a9268eac680a3ad08f26e3a2f42b5e3b089929a84af5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/battle/battle_controller.dart:826-831 | lib/src/battle/battle_controller.dart:837-842 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_controller.dart"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1a2b3ca4bcf117fdad0ca06168e8e1cbef2fab6c7989d5a1ad2861b6fa2da9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart:546-551 | lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart:563-568 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart:545\u0060 calls \u0060_map\u0060 and \u0060lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart:562\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d87ca4793c1f869782ef083bfd1cb88707d9bdcac16ae44f6da5f01212a36f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/expedition/expedition_check_card.dart:196-201 | lib/src/expedition/expedition_check_card.dart:215-220 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/expedition/expedition_check_card.dart:196\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_check_card.dart"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1355733d34e13afa98d96a40aace83feff3cf7cb680568ce75c10a30f3f72f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/game_state/game_state_serializer.dart:274-279 | lib/src/game_state/game_state_serializer.dart:324-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/game_state/game_state_serializer.dart:274\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_serializer.dart"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"b554d485703ffe590f5de514e82f9fc1657bbeb6c0ef0e48107de127ddd446c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/game_state/game_state_serializer.dart:349-354 | lib/src/game_state/game_state_serializer.dart:366-371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/game_state/game_state_serializer.dart:349\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/src/game_state/game_state_serializer.dart"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"25643e8c04ed76af0240efbf9f94c57a0bcb020f094eea2107294b321a6b5e40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/src/logbook/logbook_event_recorder.dart:564-570 | lib/src/logbook/logbook_event_recorder.dart:595-601 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/logbook/logbook_event_recorder.dart:564\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/src/logbook/logbook_event_recorder.dart"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c99506e87723d2820584d0b0b47e6bd949f78214abbefd65ba3999663c43731"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/settings/about_support_settings_page.dart:121-126 | lib/src/settings/custom_font_settings_section.dart:110-115 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/about_support_settings_page.dart"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e173cff092400b505ca390c3c25767f0b6e550be846a17b324adf23e43d8e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/settings/custom_font_settings_section.dart:103-108 | lib/src/settings/custom_font_settings_section.dart:112-117 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/settings/custom_font_settings_section.dart:103\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/src/settings/custom_font_settings_section.dart:111\u0060 calls \u0060appOnAccentColor\u0060, \u0060Color\u0060 and \u0060lib/src/settings/custom_font_settings_section.dart:102\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/custom_font_settings_section.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08b70290932ba348b7af63359f540f28d78bf2c0a4fd8314a9d638f81939a13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tool/akashi_bonus/lib/rule_builder.dart:525-530 | tool/akashi_bonus/lib/rule_builder.dart:772-777 \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":"tool/akashi_bonus/lib/rule_builder.dart"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5da1093f1b2b8ded747c8a36811dc94a72aee2bf7614522e76247bd47a6ea6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): lib/src/settings/about_support_settings_page.dart:123-127 | lib/src/settings/custom_font_settings_section.dart:103-107 | lib/src/settings/custom_font_settings_section.dart:112-116 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/src/settings/custom_font_settings_section.dart:111\u0060 calls \u0060appOnAccentColor\u0060, \u0060Color\u0060 and \u0060lib/src/settings/custom_font_settings_section.dart:102\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/about_support_settings_page.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e614d95e72016f1e3e0cbc8c773536a5d71dc14d7706db07b27c03edd618bb6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/battle/battle_controller.dart:1550-1554 | lib/src/battle/battle_controller.dart:1563-1571 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/battle/battle_controller.dart:1550\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_controller.dart"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7692a396803a3a539ec8028c62a4408e4b2f2a394517cdcd04520ec7ff2a49c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/battle/battle_detail_replay_builder.dart:299-303 | lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart:431-435 \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/src/battle/battle_detail_replay_builder.dart"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"902d2b3b26fb39e5e370703d81fcc8d296a1ddc1d2e7b4084b92fb94fc0ffff0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/game_state/game_state_reducer.dart:2401-2405 | lib/src/game_state/game_state_reducer.dart:2512-2516 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/game_state/game_state_reducer.dart:2401\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":2401}}}],"partialFingerprints":{"codehealthFindingId/v1":"6171292a374a5690401cb90a8b48e46ce0f811764bc1e3c90b9c4b13f27bda7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tool/akashi_bonus/lib/rule_builder.dart:313-317 | tool/akashi_bonus/lib/rule_builder.dart:629-633 \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/akashi_bonus/lib/rule_builder.dart:313\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":"tool/akashi_bonus/lib/rule_builder.dart"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"606b976dfe92e090a47c18a0d52117475dd3fac1aef7f5fe5312531e772f7f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/battle/battle_node_label_resolver.dart:26-31 | lib/src/battle/fcd_map_dataset.dart:175-180 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_node_label_resolver.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7d5c1b557dac4223d0db9824e3430f4315ed86bc034c126513b4356d9a2029"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/src/battle/battle_ship_details_popover.dart:103-109 | lib/src/fleet/fleet_metric_details_popover.dart:118-124 \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/src/battle/battle_ship_details_popover.dart"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c835fe8b816b7d136511130d21f83d2a4e1f26f4e205802555bc8b5fb914125"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/src/browser/game_frame_rate_port.dart:43-52 | lib/src/capture/android_game_capture_port.dart:78-87 \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/src/browser/game_frame_rate_port.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc04bad17acd0755721b09a4e47f8a07db4bc04b4bdf169d1985cf57579a94d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/src/fleet/anchorage_repair_calculator.dart:171-177 | lib/src/fleet/nosaki_sparkle_calculator.dart:334-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/anchorage_repair_calculator.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e99e5dc5dfd634f96056705b27a9e08558a2ccb03bb60c048c656c88386070"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/src/fleet/anchorage_repair_timer.dart:15-25 | lib/src/fleet/nosaki_sparkle_timer.dart:15-25 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/anchorage_repair_timer.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d5a5ad8a58d728589f815e5b6b43c29b21717e69153ee9a0d6f53b1a66fbef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/fleet/anchorage_repair_view.dart:337-342 | lib/src/fleet/nosaki_sparkle_view.dart:57-62 \u2014 before extracting anything, compare \u0060lib/src/fleet/anchorage_repair_view.dart\u0060 and \u0060lib/src/fleet/nosaki_sparkle_view.dart\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/anchorage_repair_view.dart"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"7609cfc1fbccc1f6185034fcdb058759fc86045fd5426aea9d0ec0375d5e271c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/src/fleet/anchorage_repair_view.dart:727-737 | lib/src/fleet/nosaki_sparkle_view.dart:521-531 \u2014 before extracting anything, compare \u0060lib/src/fleet/anchorage_repair_view.dart\u0060 and \u0060lib/src/fleet/nosaki_sparkle_view.dart\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/anchorage_repair_view.dart"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafb175756baef8f92acc847ca03593c040b080ba6ad96eeb17ab669985164d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/fleet/minimal_status_glow.dart:70-77 | lib/src/fleet/ship_status_visuals.dart:40-47 \u2014 before extracting anything, compare \u0060lib/src/fleet/minimal_status_glow.dart\u0060 and \u0060lib/src/fleet/ship_status_visuals.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/minimal_status_glow.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c97d374304d41e2338eedd3084046b94d9286100459b86829ecc84124672c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): lib/src/fleet/minimal_status_glow.dart:79-87 | lib/src/fleet/ship_status_visuals.dart:49-57 | lib/src/fleet/ship_status_visuals.dart:186-194 \u2014 before extracting anything, compare \u0060lib/src/fleet/minimal_status_glow.dart\u0060 and \u0060lib/src/fleet/ship_status_visuals.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/minimal_status_glow.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e0e091d830a4acd9fce99438d0a0ed86ff8c3af09b93726d61d25d1c2cf527"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/src/inventory/equipment_compatibility_projection.dart:132-141 | lib/src/inventory/ship_equipment_compatibility_projection.dart:112-121 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_projection.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0da70b7fb40d17547edd218f03b26c3db6770c4f323042abce33b11ef7ea9e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/src/settings/background_game_retention_controller.dart:24-33 | lib/src/settings/screen_awake_controller.dart:19-28 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/background_game_retention_controller.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d7eb362a808795071e28b0d7e13a275d1ec8ea72467d7af33a645065feb544"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/subtitles/ship_subtitle_catalog_store.dart:128-132 | lib/src/subtitles/ship_subtitle_kc3_store.dart:124-128 \u2014 before extracting anything, compare \u0060lib/src/subtitles/ship_subtitle_catalog_store.dart\u0060 and \u0060lib/src/subtitles/ship_subtitle_kc3_store.dart\u0060 as WHOLE FILES: this scan already matched 4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_catalog_store.dart"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2177e763b06b3a4c70b7b72b83a89dcebf4c3e959bf63d71d90af06f21db976"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/src/toolbox/sortie_map_query/enemy_catalog_update_service.dart:152-162 | lib/src/toolbox/sortie_map_query/sortie_map_catalog_update_service.dart:194-204 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/enemy_catalog_update_service.dart"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c82d4a4f67a4bd1c0533c623db7b29fe8ed60ae10fe4aac41268c445edbd81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tool/akashi_bonus/lib/models.dart:40-46 | tool/wiki_bonus/lib/models.dart:40-46 \u2014 before extracting anything, compare \u0060tool/akashi_bonus/lib/models.dart\u0060 and \u0060tool/wiki_bonus/lib/models.dart\u0060 as WHOLE FILES: this scan already matched 7 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060tool/akashi_bonus/lib/models.dart:50\u0060 calls \u0060toCompactJson\u0060 and \u0060tool/wiki_bonus/lib/models.dart:47\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/akashi_bonus/lib/models.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2575a69dd16068647d5248bceb24774fa8654509d26b38c3e8e4937ecbd51a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tool/akashi_bonus/lib/models.dart:175-180 | tool/wiki_bonus/lib/models.dart:155-160 \u2014 before extracting anything, compare \u0060tool/akashi_bonus/lib/models.dart\u0060 and \u0060tool/wiki_bonus/lib/models.dart\u0060 as WHOLE FILES: this scan already matched 7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/akashi_bonus/lib/models.dart"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"37257d7c507e3fca7b9362c8bbc281f82f2671f0ba15ee755d59b3955dc8fb80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): tool/akashi_bonus/lib/models.dart:193-197 | tool/akashi_bonus/lib/models.dart:204-208 | tool/wiki_bonus/lib/models.dart:173-177 | tool/wiki_bonus/lib/models.dart:184-188 \u2014 before extracting anything, compare \u0060tool/akashi_bonus/lib/models.dart\u0060 and \u0060tool/wiki_bonus/lib/models.dart\u0060 as WHOLE FILES: this scan already matched 7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/akashi_bonus/lib/models.dart"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ea432d94ca35f96e31ec79bc1334c6fbc8a588d8257ad8be0ef2d3006867ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tool/akashi_bonus/lib/models.dart:246-250 | tool/wiki_bonus/lib/models.dart:222-226 \u2014 before extracting anything, compare \u0060tool/akashi_bonus/lib/models.dart\u0060 and \u0060tool/wiki_bonus/lib/models.dart\u0060 as WHOLE FILES: this scan already matched 7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/akashi_bonus/lib/models.dart"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0130717cf0ec2a3616b836de3913b4199fa0ca1888a5e841b8818c20f8adc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): tool/akashi_bonus/lib/models.dart:259-271 | tool/wiki_bonus/lib/models.dart:235-247 \u2014 before extracting anything, compare \u0060tool/akashi_bonus/lib/models.dart\u0060 and \u0060tool/wiki_bonus/lib/models.dart\u0060 as WHOLE FILES: this scan already matched 7 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. 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":"tool/akashi_bonus/lib/models.dart"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a48cf1b2a158eae3ffbd50b097b56c1e74590728ed24c20b724c6ec8252c407"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): lib/src/battle/fcd_map_controller.dart:56-63 | lib/src/quest/quest_catalog_controller.dart:39-46 | lib/src/toolbox/sortie_map_query/enemy_catalog_controller.dart:30-37 | lib/src/toolbox/sortie_map_query/sortie_map_catalog_controller.dart:39-46 \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/src/battle/fcd_map_controller.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"70418a52302b39da3f996228a7830ef5b1913534345022404cf28c3f90293aa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/browser/game_resource_manifest_builder.dart:185-189 | lib/src/browser/game_resource_manifest_consumer.dart:133-137 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/game_resource_manifest_builder.dart"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2381b134e4312c2842640f5785f012943547a5e20e55efde22c0c5990aa06b92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/capture/android_game_capture_port.dart:279-283 | lib/src/game_webview.dart:187-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. 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 \u0060command\u0060 to \u0060_CaptureConfigurationCommand\u0060 in one and \u0060_NetworkConfigurationCommand\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/android_game_capture_port.dart"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c41127e850edbadb0860e6cc2159ac9ef8638ce5a2e130a06edfa4bb6dd33d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/src/expedition/expedition_check_card.dart:93-99 | lib/src/expedition/expedition_check_page.dart:107-113 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/src/expedition/expedition_check_page.dart:103\u0060 calls \u0060call\u0060 and \u0060lib/src/expedition/expedition_check_card.dart:89\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_check_card.dart"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc54fa223e26260f61998e14d70e8f0fed0f409b0c0478868e3834c3ca35c83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/src/fleet/anchorage_repair_view.dart:326-335 | lib/src/fleet/nosaki_sparkle_view.dart:46-55 \u2014 before extracting anything, compare \u0060lib/src/fleet/anchorage_repair_view.dart\u0060 and \u0060lib/src/fleet/nosaki_sparkle_view.dart\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 283 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/anchorage_repair_view.dart"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7def4a7dd07ca729a9cdee64f6e50abcd115f49c45edb10f6a897ecb068d33c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): lib/src/kcwiki_report/kcwiki_report_settings.dart:208-213 | lib/src/settings/battle_prediction_settings.dart:302-307 | lib/src/settings/battle_prediction_settings.dart:309-314 \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/src/kcwiki_report/kcwiki_report_settings.dart"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed72a7f217100ee2f7886ea58fe074646707702b745d2157052f481a8cb45467"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/settings/background_game_retention_controller.dart:50-55 | lib/src/settings/screen_awake_controller.dart:51-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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/background_game_retention_controller.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5a1dd3d7165f7c700ddc6af03af6e2231b3c1a227644623b0db47d81579cc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/settings/battle_prediction_settings.dart:110-117 | lib/src/settings/game_frame_rate_settings.dart:80-87 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/battle_prediction_settings.dart"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4f7ce169d0ff8f571b7f0b68b2088daa783dfb1f7908ef8b38639677752628"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/settings/display_mode_store.dart:23-27 | lib/src/settings/safety_settings_store.dart:58-62 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/display_mode_store.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4daa1f6b425f8050634c96c0663920f154b281d68fec8a6a41245c0f8f2c1418"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/settings/game_connector_controller.dart:15-19 | lib/src/settings/game_rendering_mode_controller.dart:16-20 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/game_connector_controller.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36f5777e528467d1cad4f9c4709d986c936c3237194a3e70ed780a3eb2047b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/settings/game_connector_controller.dart:21-26 | lib/src/settings/game_rendering_mode_controller.dart:22-27 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/game_connector_controller.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdc91338246fddde1248b92a9c468cdc00e71d2fb5e6beb154dcd0548d80944"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/src/settings/game_frame_refresh_shortcut_settings.dart:23-29 | lib/src/settings/game_mouse_wheel_settings.dart:19-25 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/game_frame_refresh_shortcut_settings.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d2e886c6ec4cc3bf0f6c2486bc4ed4c7962b29f99146586f1516612d6992ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): lib/src/subtitles/ship_subtitle_catalog.dart:12-18 | lib/src/subtitles/ship_subtitle_kc3_bundle.dart:44-50 | lib/src/toolbox/sortie_map_query/sortie_map_models.dart:16-22 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_catalog.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8b3d1477a32964418415d556fcb1f880d38312ac102dfb95958e78b193ea98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/subtitles/ship_subtitle_catalog.dart:89-94 | lib/src/subtitles/ship_subtitle_kc3_bundle.dart:169-174 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_catalog.dart"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd4aeabdaa01c93e73dd706b7458ba9884f817306f12e5d051443b7d0f30728"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/subtitles/ship_subtitle_catalog_store.dart:82-86 | lib/src/subtitles/ship_subtitle_kc3_store.dart:79-83 \u2014 before extracting anything, compare \u0060lib/src/subtitles/ship_subtitle_catalog_store.dart\u0060 and \u0060lib/src/subtitles/ship_subtitle_kc3_store.dart\u0060 as WHOLE FILES: this scan already matched 4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_catalog_store.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f276b17a808319803ecd6410b287618820185b1f2abf98540af239e9c28cec64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/src/game_state/game_state_reducer.dart:2455-2459 | lib/src/game_state/game_state_reducer.dart:2498-2502 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/game_state/game_state_reducer.dart:2455\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/src/game_state/game_state_reducer.dart"},"region":{"startLine":2455}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba0c20f91558c45af2d20bb5d525c16567703f62607ace57b6045becb6aefc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt:984-998 | android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt:1058-1072 \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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"3592d54827314d737a6f66be21d33dd8009cd4196b56d0599966a13f47011846"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/BackupShareCache.kt:46-54 | android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/PendingBackupExportStore.kt:269-277 | android/app/src/main/kotlin/app/yahagi/kancollebrowser/fonts/CustomFontRepository.kt:157-165 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/BackupShareCache.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e800cdf5693dc00dce4e521a73fc2444b79399f9f40d620a3f222ba560c875df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): android/app/src/main/kotlin/app/yahagi/kancollebrowser/fonts/CustomFontManager.kt:25-32 | android/app/src/main/kotlin/app/yahagi/kancollebrowser/fonts/CustomFontPreviewRenderer.kt:30-37 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/fonts/CustomFontManager.kt"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"575011f4253b096de32bd3d8114f4bc8d7966fa2e97ea9d4204b406f52e8602c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt:1952-1956 | android/app/src/main/kotlin/app/yahagi/kancollebrowser/composition/CompositionImageHandler.kt:168-172 \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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt"},"region":{"startLine":1952}}}],"partialFingerprints":{"codehealthFindingId/v1":"21255b6014b9d557a18fa57935db4840d67eca9af31bd441b7fa144b7ede9ccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt:2268-2277 | android/app/src/main/kotlin/app/yahagi/kancollebrowser/capture/GameCaptureBridge.kt:206-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 \u0060android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt:2268\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt"},"region":{"startLine":2268}}}],"partialFingerprints":{"codehealthFindingId/v1":"72394d7fdf93490a111d44c51af540ad1911c557dfd3687bdf330f3bed331e5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFrameRateBridge.kt:247-254 | android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFrameReloadBridge.kt:517-524 \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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFrameRateBridge.kt"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"769df9e566dc05626121e2d285f6cc5fa0654e5e106563e3e1b6d01551efb8ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheIndex.kt:471-482 | android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheStore.kt:569-580 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheIndex.kt"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9a5554e71a3fa7bc20a9d06e4ff489e3538bd45cb51e8210670ccf2eee87ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFrameRateBridge.kt:233-245 | android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFrameReloadBridge.kt:503-515 \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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFrameRateBridge.kt"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d710be2bafeb979b6311a6b3e32851a536084c1079a3a86dcf27f53b1dfcb3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LogbookDatabase (LCOM4 13): LogbookDatabase\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/src/logbook/logbook_database.dart"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"71592cb55f0120bc045884379b881404f12c46cc9c193d94bdc34ad81a20c6c1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RenderSeparatedWrap (LCOM4 7): RenderSeparatedWrap\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/src/fleet/separated_wrap.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1605969be6408a6f76ddf976c2ab72e34b7b76f0df6cc1fccf49872ddbd1ddf3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LayoutSettingsController (LCOM4 7): LayoutSettingsController\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/src/settings/layout_settings_controller.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d5eb9fb3b77b82c0239cad062ccc05b5dd87c325e0816d6844e6ed1887b9f2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _LogbookTablePageState (LCOM4 6): _LogbookTablePageState\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/src/logbook/logbook_page.dart"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"1333be536a8ddfae8f29b5e03fb538c8eab6e60b53c82decef740382e38f3255"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MemoryBattlePredictionSettingsStore (LCOM4 6): MemoryBattlePredictionSettingsStore\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/src/settings/battle_prediction_settings.dart"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4ad7e9538648e39dac3aa915f7c28aeb20553a95a4940487a794ce2308d5f4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _YahagiShellState (LCOM4 5): _YahagiShellState\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/main.dart"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf4786ce46d211eae2ccb083edccd8c1fc51e1b97e605b2a25dd264e7fadbbd"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _SmokeStartup (LCOM4 5): _SmokeStartup\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/advance_warning_device_smoke/main.dart"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedaffaaf97e5f759a41f2ad39b0152b9a084a5df0ded0f7e94dcf46eb9c518e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _PreSortieCheckSummaryState (LCOM4 5): _PreSortieCheckSummaryState\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/pre_sortie_check_summary.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42f778e355184f39b4203485df9f3c0f388f731afa55bae53e4c6c2e84cf3d7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _NotificationSettingsPageState (LCOM4 5): _NotificationSettingsPageState\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/notification_settings_page.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5100ff2215c243d98c4fdc150e90b53e424acbf75cc5e6d1d35a0ed66febdd"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _AppPopupMenuRoute (LCOM4 5): _AppPopupMenuRoute\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/widgets/app_popup_menu_button.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3653d7820fec24822acaded312bb6250dab9b57ece4479e1d8a0e16af5fb5d74"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FcdMapDataset (LCOM4 4): FcdMapDataset\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/fcd_map_dataset.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b592295a8599b4b03b0104edffcfd96f817758dde3beb06f3cd8b15a9a98709d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _DevelopmentEquipmentPickerState (LCOM4 4): _DevelopmentEquipmentPickerState\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/development/development_equipment_picker.dart"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e05273236eb515322e1a0b1e7e7edeca7446776b27632fdc0ff640dbc15c6a3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GameWebViewStartupCoordinator (LCOM4 4): GameWebViewStartupCoordinator\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_webview.dart"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6ad6c03b465d87e8c1f8fe7ce2aee288947ded9b2c498d7b9cb84601248cb5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _RenderPortraitMasonry (LCOM4 4): _RenderPortraitMasonry\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/layout/hd_portrait_grid.dart"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfabd6fb04b5ee31a8dca79ac1afe9e5935cfba7676db156ef453647d3841db"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ApplicationQuestCatalogStorage (LCOM4 4): ApplicationQuestCatalogStorage\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_catalog_store.dart"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3d6f2dbbf3e22fd997091f16fca7266ae21f27ecf5f4c22cbf8289a31239dc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _QuestViewEntry (LCOM4 4): _QuestViewEntry\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_center_page.dart"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc79fba756f779da386e86c8054e24c23eca4765ac9ead4d53cde8f2fb3cea7e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MemorySafetySettingsStore (LCOM4 4): MemorySafetySettingsStore\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/safety_settings_store.dart"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ab35afd7623cb282e141d6f3a5a32cc9a9ac7f61db815875fb6b337b2eeeb0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _ExpCalcPageState (LCOM4 4): _ExpCalcPageState\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/exp_calc/exp_calc_page.dart"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee7efb9e7de0fa4cd895519bc1d58b127d8c78fa68abbd6a7b3cd8a278a38c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/main.dart: lib/main.dart changed 90 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 126 in _YahagiShellState._buildShell at line 2455. 16 of those changes were fix/bug commits, and the other 74 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/main.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/main.dart"},"region":{"startLine":2455}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6293725e4ecc30616eb405dbc97736c533fbfa1a16bc7c869a700716259256"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt: android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in MainActivity.configureFlutterEngine at line 419. 11 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a593516c3541d84d7c39a8f421d519f81aa040f046ef7721ad8dc50317b06a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/game_state/game_state_reducer.dart: lib/src/game_state/game_state_reducer.dart changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in GameStateReducer.reduce at line 23. 6 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/game_state/game_state_reducer.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e90ef39f4f5ab8bc988b445b29eebb224239fe420abfcda823bbb45f261675c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/notification/game_notification_coordinator.dart: lib/src/notification/game_notification_coordinator.dart changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in GameNotificationCoordinator._buildOngoingItems at line 1103. 13 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/notification/game_notification_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/src/notification/game_notification_coordinator.dart"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f1ab3b4a6944587a4534499476acf541696db4117798e640844a4ea959d059"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/game_state/game_state_serializer.dart: lib/src/game_state/game_state_serializer.dart changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 112 in GameStateSerializer.deserialize at line 250. 3 of those changes were fix/bug commits, and the other 10 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/game_state/game_state_serializer.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_serializer.dart"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee6fb988fa570c359ea46a78651be1b01d2124721dbf35c667d4216942bc617"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/native_activity_game_surface.dart: lib/src/native_activity_game_surface.dart changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in _NativeActivityGameSurfaceState._dispatchCurrentEvent at line 960. 20 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/native_activity_game_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/src/native_activity_game_surface.dart"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e58ab819a8cfac9485bfc405606fe99e137339ba48feebb9ee44f697ea4536"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/settings/layout_settings_controller.dart: lib/src/settings/layout_settings_controller.dart changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in LayoutSettingsController.load at line 36. 1 of those changes was a fix/bug commit, 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/settings/layout_settings_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/src/settings/layout_settings_controller.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec981e8862e6b80c3ab160928320ef860e79b2cf12f7046044a6040703b20acc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/battle/battle_controller.dart: lib/src/battle/battle_controller.dart changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in BattleController._applyBattlePhase at line 775. 12 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/battle/battle_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/src/battle/battle_controller.dart"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31bcfd7bc4abb08d9af13b8e1b72448bae18da2afa5367bcae91ab5caf052ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/fleet/fleet_summary_card.dart: lib/src/fleet/fleet_summary_card.dart changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in _FleetSummaryMetrics.build at line 422. 4 of those changes were fix/bug commits, and the other 22 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/fleet/fleet_summary_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/src/fleet/fleet_summary_card.dart"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"442a967cf588fcec58eebefe48088d92313faa5dc7fe21a98b8f65cdc47eeef2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/fleet/fleet_information_center.dart: lib/src/fleet/fleet_information_center.dart changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in _MetricsBar.build at line 2029. 4 of those changes were fix/bug commits, and the other 23 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/fleet/fleet_information_center.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_information_center.dart"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f28d317e7c31692be940bdabaf2bfb0b2b898376ac60693a9ae69e8b67b00c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/battle/live_battle_card.dart: lib/src/battle/live_battle_card.dart changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in _CompactBattlePanel.build at line 375. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/battle/live_battle_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/src/battle/live_battle_card.dart"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed50a9805732ef44ab5f987071f8aa02f88d6b052b6b139b7d9ba19d3554627d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/game_webview.dart: lib/src/game_webview.dart changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in _GameWebViewState.initState at line 866. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/game_webview.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_webview.dart"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b74a366327d1eedcf189dba7748ada2040be82587cc5c8dbbd3ed19bbf6a94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/fleet/fleet_ship_status_capsule.dart: lib/src/fleet/fleet_ship_status_capsule.dart changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in _FleetShipStatusCapsuleState.build at line 108. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/fleet/fleet_ship_status_capsule.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_ship_status_capsule.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3992cc7d8cac790a342c580cc6405ede22eee1511ba4cccc70494a7ca972604"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/inventory/owned_inventory_page.dart: lib/src/inventory/owned_inventory_page.dart changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in _OwnedInventoryPageState.build at line 339. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/inventory/owned_inventory_page.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/owned_inventory_page.dart"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4358d501d6fe6fe378fa199a50f2020d0bb3e12e4b3b8c9b278cdb3c12c7d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/logbook/logbook_database.dart: lib/src/logbook/logbook_database.dart changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in LogbookDatabase._validateBackupRows at line 505. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/logbook/logbook_database.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_database.dart"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"35350ccad72d1b6192a41a10ad5781ee72fb6828a3cfcf08b2c64af9e95485ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/capture/battle_result_warning_overlay.dart: lib/src/capture/battle_result_warning_overlay.dart changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in _BattleResultWarningOverlayState._checkAdvanceSafety at line 530. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/capture/battle_result_warning_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/src/capture/battle_result_warning_overlay.dart"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7806b890e178a9a46d08967790771fefc73ff1e27847c6dd726c69f33be5b94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/game_state/game_state_controller.dart: lib/src/game_state/game_state_controller.dart changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in GameStateController.accept at line 474. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/game_state/game_state_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/src/game_state/game_state_controller.dart"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6ec3f383d4993852ad3be58a5580a5c3bb8b6626b75c55f9cd3d6278cf9bc2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/layout/workspace_context_header.dart: lib/src/layout/workspace_context_header.dart changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in WorkspaceContextHeader.build at line 117. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/layout/workspace_context_header.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/layout/workspace_context_header.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5a96badc0918d68192c7cd548364d9eead1ad2f3636b961bded3587e494d89"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/fleet/land_base_summary_card.dart: lib/src/fleet/land_base_summary_card.dart changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in LandBaseAirGroupRow.build at line 239. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/fleet/land_base_summary_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/src/fleet/land_base_summary_card.dart"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1c561e11f2bdf1b7f591fd775ea005408327f410a24bd31e3125f1b6219551"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/senka/senka_state.dart: lib/src/senka/senka_state.dart changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in SenkaState.fromJson at line 684. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/senka/senka_state.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_state.dart"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"31df3e6a85f54e7b18b101311975d0fe22d9a756ccb93b4a8cad4d9907f0eb40"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart: lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in _PoiBattleSimulator._shell at line 420. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"7623b32bb49207a0f21c16b14f3ab9e0cf5f0afb2cdf4f3a06a8490a66ad9aa0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/expedition/expedition_strings.dart: lib/src/expedition/expedition_strings.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in ExpeditionStrings.conditionLabel at line 281. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/expedition/expedition_strings.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_strings.dart"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"187c0652e2122c5943420e61e0c57bed172a05b6d7e53a9310f5d72faafc896e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/fleet/construction_summary_card.dart: lib/src/fleet/construction_summary_card.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in ConstructionSummaryCard._buildConstructionSlotAt at line 109. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/fleet/construction_summary_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/src/fleet/construction_summary_card.dart"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c8268e627b11d67672cc2f977ac3aca02622005bbc1a79b8329cb26ab457cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/fleet/resource_grid.dart: lib/src/fleet/resource_grid.dart changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in CompactResourceBarState._buildInteractiveItem at line 927. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/fleet/resource_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/src/fleet/resource_grid.dart"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96f60a2ec4d97e216756da4f980b725469330446a615a663fd34c289046604a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/logbook/logbook_page.dart: lib/src/logbook/logbook_page.dart changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _LogbookTablePageState._refreshLatest at line 526. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/logbook/logbook_page.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_page.dart"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"9592cf386410a42e0634f9f372f7d0fec1b32a5c3e1e5dafb186cbaddb993af5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/battle/detailed_battle_panel.dart: lib/src/battle/detailed_battle_panel.dart changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in _BattleOverview.build at line 261. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/battle/detailed_battle_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/src/battle/detailed_battle_panel.dart"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c1ca48a90d89639c70dbb892b21f5dd66fc14e9df269a068ddb63f2f26e0bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/quest/quest_progress_engine.dart: lib/src/quest/quest_progress_engine.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in QuestProgressEngine._events at line 913. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/quest/quest_progress_engine.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_progress_engine.dart"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fdcb625c2ec394f58a598b2901d3f9c072d5738584b1464785f1318eaf01a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/quest/quest_center_page.dart: lib/src/quest/quest_center_page.dart changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in _QuestCenterPageState.build at line 237. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/quest/quest_center_page.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_center_page.dart"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cada55b3396899c315c0709433755adced3796fb9951052fd19f9093eaa70d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/game_state/game_state.dart: lib/src/game_state/game_state.dart changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in MasterShip.remainingModernization at line 141. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/game_state/game_state.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state.dart"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6847a85fa9c7ec0b75e8ea149c9713a9cd3c02d100f37afff24aa7b9d918a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/senka/senka_reducer.dart: lib/src/senka/senka_reducer.dart changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in SenkaReducer._ranking at line 367. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/senka/senka_reducer.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_reducer.dart"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a43dc9b1c54ce8fb1144b2fbae7c68935722c602c075b2848ee5d66c283e84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/app/yahagi/kancollebrowser/notification/AppNotificationManager.kt: android/app/src/main/kotlin/app/yahagi/kancollebrowser/notification/AppNotificationManager.kt changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in AppNotificationManager.bindItem at line 540. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/app/yahagi/kancollebrowser/notification/AppNotificationManager.kt\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/notification/AppNotificationManager.kt"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d2f252abb08e79e9141f7aa14494dcf5b71268bfc8de7db55b1695bd146af4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/browser/game_browser_toolbar.dart: lib/src/browser/game_browser_toolbar.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in GameBrowserToolbar.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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/browser/game_browser_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/src/browser/game_browser_toolbar.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c2a6ed77ab8eb2c716da11d9e14a50dba08c6f40079965a27a03a825887a63"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/backup/record_backup.dart: lib/src/backup/record_backup.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in BackupArchive.decode at line 506. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/backup/record_backup.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/backup/record_backup.dart"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"262c7c3713947056526dc2b66a9523c8db015f1de7c4d080f6c69e6126e6d0d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/settings/game_resource_cache_section.dart: lib/src/settings/game_resource_cache_section.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in _GameResourceCacheSectionState.build at line 85. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/settings/game_resource_cache_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/src/settings/game_resource_cache_section.dart"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"101008b9d31c591938f5b6fc0c3bba8f4ad3f51a5ddbc4ab725c45a987100c99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/settings/data_settings_page.dart: lib/src/settings/data_settings_page.dart changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in DataSettingsPage.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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/settings/data_settings_page.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/data_settings_page.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f45472958eca836a170ba0d2328850eb2634d90ec4439bb324b636ac9ffa26"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/fleet/dashboard_card.dart: lib/src/fleet/dashboard_card.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in DashboardCard.build at line 48. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/fleet/dashboard_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/src/fleet/dashboard_card.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"860550c6b31230ddaba0058011b0b2940871ad2a6bc89c02f3a2eac4591132e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheEngine.kt: android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheEngine.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in GameResourceCacheEngine.fetch at line 108. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheEngine.kt\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheEngine.kt"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce9ac1768f2a2f51ac0b05ddaf0d34783b49106656f9044b85cbc8b613e477a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/fleet/pre_sortie_check_summary.dart: lib/src/fleet/pre_sortie_check_summary.dart changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in _MapGaugeRow.build at line 575. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/fleet/pre_sortie_check_summary.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/pre_sortie_check_summary.dart"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1b9717b94271f52c594c8a96b19ebb7860d07b549164a25c38ab58e35d555b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWebViewChannel.kt: android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWebViewChannel.kt changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in NativeGameWebViewChannel.executeOnMain at line 620. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWebViewChannel.kt\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWebViewChannel.kt"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f69699cfc56a2d8a9b8ab8abeb916af771f9b56845956369e8e62856e968dd2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/fleet/repair_summary_card.dart: lib/src/fleet/repair_summary_card.dart changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _RepairCapsule.build at line 861. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/fleet/repair_summary_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/src/fleet/repair_summary_card.dart"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0af84afb98be81524ac7618486478cab1a661f654251e881fce358ca99bad8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/senka/senka_info_view.dart: lib/src/senka/senka_info_view.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in _SortiePanel.build at line 693. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/senka/senka_info_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/src/senka/senka_info_view.dart"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac9aa64de69132b1e95d0cccd26d5a37f15b91b9bc667d7caf7c0f10dacb75e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/capture/game_capture_controller.dart: lib/src/capture/game_capture_controller.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in GameCaptureController._applyConfiguration 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/capture/game_capture_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/src/capture/game_capture_controller.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"2567827e0ca44225da1240f13090291809aa86589fe87e32d3271b9b1bc97628"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibrary.kt: android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibrary.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in GameModLibrary.scan at line 76. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibrary.kt\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibrary.kt"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f8904286747d6c896632adfd9b8cba00e71dc2d2cc1ae02ad0c3af6cb021b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GadgetBypassWebViewClient.kt: android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GadgetBypassWebViewClient.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in GadgetBypassWebViewClient.serveFromGameCache at line 136. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GadgetBypassWebViewClient.kt\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GadgetBypassWebViewClient.kt"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d76499cf3c74be8e0d19513da16ef15b8674fcd23c315cc942c91c475b0cee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/quest/pinned_quests_summary.dart: lib/src/quest/pinned_quests_summary.dart changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in PinnedQuestsSummary._standardRow at line 156. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/quest/pinned_quests_summary.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/pinned_quests_summary.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0cc924d67da406a182d7361cd520e2e668ee1fd673d849f0fee1c709d690670"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/browser/native_game_surface_slot.dart: lib/src/browser/native_game_surface_slot.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in NativeGameSurfaceSlotState._measureAndReport at line 479. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/browser/native_game_surface_slot.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/native_game_surface_slot.dart"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"c476fc8ecaa17494abd7835a8d368f34f9149d44cefba6ef4aa0a9bd789f81fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/fleet/resource_trend_page.dart: lib/src/fleet/resource_trend_page.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in _ResourceTrendPageState.build at line 480. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/fleet/resource_trend_page.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/resource_trend_page.dart"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73092598322989e92a36056039ca8cb5e87ffc6376fbd45b6ef7a9f6ee74d5f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/toolbox/sortie_map_query/sortie_map_query_page.dart: lib/src/toolbox/sortie_map_query/sortie_map_query_page.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in _SortieMapQueryPageState._buildCatalog 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/toolbox/sortie_map_query/sortie_map_query_page.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/sortie_map_query_page.dart"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f747bf9878488558a48182e042018d9ce77aea0a03e20c0ee6133b6547c1e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/toolbox/game_mods/game_mods_page.dart: lib/src/toolbox/game_mods/game_mods_page.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in _GameModsPageState._details at line 1388. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/toolbox/game_mods/game_mods_page.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_page.dart"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"139c410315ed9fd9929bd5d727fe0e2eebdcd9e38051ea836970a68d46a9906d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/ActivityWebViewHost.kt: android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/ActivityWebViewHost.kt changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ActivityWebViewHost.create at line 104. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/ActivityWebViewHost.kt\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/ActivityWebViewHost.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb555a6f6dfa113681ececc8af9ba98315dd54f1dedf9046620c3155890e4f98"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/senka/senka_calendar_view.dart: lib/src/senka/senka_calendar_view.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in _SenkaCalendarViewState._cell at line 186. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/senka/senka_calendar_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/src/senka/senka_calendar_view.dart"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"566bba2c41e1e7b146ba27f2f0106906e2155af07391f8578e45c40d2c1ab4a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/battle/battle_models.dart: lib/src/battle/battle_models.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in BattleContext._baseNodeTypeLabel 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/battle/battle_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/src/battle/battle_models.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5f1042d1b46f156681a0bd17f08f6320ea677f62fabcfe1d66c4aae765892e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/settings/notification_settings_page.dart: lib/src/settings/notification_settings_page.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in _NotificationSettingsPageState.build 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/settings/notification_settings_page.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/notification_settings_page.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8651553c032dced57e66a0c6fedf36d2378e93f3e9a0842d760cf9b4aa31f99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tool/test_ooi_viewport_browser_smoke.cjs: tool/test_ooi_viewport_browser_smoke.cjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in test_ooi_viewport_browser_smoke.run at line 579. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- tool/test_ooi_viewport_browser_smoke.cjs\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":"tool/test_ooi_viewport_browser_smoke.cjs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"a553c649bbef20727b7d3e8c1d36142d64fa246d67b910b6179bda2dc8940fd3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/fleet/ship_status_visuals.dart: lib/src/fleet/ship_status_visuals.dart changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ShipMoraleMark.build at line 411. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/fleet/ship_status_visuals.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/ship_status_visuals.dart"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0bea9397acc9bb0b93c41e100ddca1f30603df9c8108258329f8203e324f93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/logbook/battle_detail_page.dart: lib/src/logbook/battle_detail_page.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in _BattleDetailPageState._process 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/logbook/battle_detail_page.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/battle_detail_page.dart"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e390191ee20d98bbbcafec06eb403aa176c90319bae430dca15a997d347aeae5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/senka/senka_controller.dart: lib/src/senka/senka_controller.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in SenkaController._restore at line 257. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/senka/senka_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/src/senka/senka_controller.dart"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"86baaf8144e386476e9e51d738cb32338336bbce455283e8bb3a8a9f7534d568"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFrameReloadBridge.kt: android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFrameReloadBridge.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in AndroidGameFrameReloadBridge.onPostMessage at line 385. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFrameReloadBridge.kt\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFrameReloadBridge.kt"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0112d31f39716e06e44b251d4469641d7098b9718ce2b27e18cb557416227f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheStore.kt: android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheStore.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in GameResourceCacheStore.commitInternal at line 214. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheStore.kt\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheStore.kt"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"769f3774c31a847a9c77c2d4892ec4cbc6e822b7e7a15f2a5876e11ca6941d68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/app/yahagi/kancollebrowser/notification/NotificationAlarmReceiver.kt: android/app/src/main/kotlin/app/yahagi/kancollebrowser/notification/NotificationAlarmReceiver.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in NotificationAlarmReceiver.deliverCurrentAlarm at line 23. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/app/yahagi/kancollebrowser/notification/NotificationAlarmReceiver.kt\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/notification/NotificationAlarmReceiver.kt"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"164ff233eee1e22557d7011b22b1f6b7514b2c8e5853987055847060b64f7242"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/toolbox/composition_image_page.dart: lib/src/toolbox/composition_image_page.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in _CompositionImagePageState._controls at line 1515. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/toolbox/composition_image_page.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/composition_image_page.dart"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"0082c3eb928bf49b8ae1f706d932720d7ef732abd44eece089a1428b3910b515"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/toolbox/exp_calc/exp_calc_page.dart: lib/src/toolbox/exp_calc/exp_calc_page.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in _ExpCalcPageState._compactPoint at line 1201. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/toolbox/exp_calc/exp_calc_page.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/exp_calc/exp_calc_page.dart"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e1618f82e6e3a17d86694d8fd5804fc7291d954b6e26e50ad54c57a5d30395"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/game_state/game_api_event_pipeline.dart: lib/src/game_state/game_api_event_pipeline.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in GameApiEventPipeline._prepareAndDispatch at line 269. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/game_state/game_api_event_pipeline.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_api_event_pipeline.dart"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"567f0705ab5bc0fcdff7b6405f54467838374fc62752ddac63a1fc7b61f790f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/quest/quest_catalog.dart: lib/src/quest/quest_catalog.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in QuestCatalog.project at line 249. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/quest/quest_catalog.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_catalog.dart"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f58e2b45ce1e3ec54c953b4858c19bff08f1ec87cc15ad2483ef4b266bb2db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/improvement/improvement_planner_view.dart: lib/src/improvement/improvement_planner_view.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in _ImprovementTableState.build at line 577. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/improvement/improvement_planner_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/src/improvement/improvement_planner_view.dart"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30e2f5a11a6c8ffde8aefe56045890ec89da2ae687c769fdd9cf7e3f968c94b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/toolbox/sortie_map_query/sortie_map_catalog_update_service.dart: lib/src/toolbox/sortie_map_query/sortie_map_catalog_update_service.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in SortieMapCatalogUpdateService._getWithRedirects at line 206. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/toolbox/sortie_map_query/sortie_map_catalog_update_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/src/toolbox/sortie_map_query/sortie_map_catalog_update_service.dart"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6e29ea3a93bbd6c9a335689befb28ace2c9066a36ad4ebad56bc4874450de9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceFetcher.kt: android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceFetcher.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in HttpUrlConnectionGameResourceFetcher.fetchWithinBudget 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceFetcher.kt\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceFetcher.kt"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"056b2d79a7bf6c15744c359d8811446fc07a55317536fc79531670cef1d66d10"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModArchive.kt: android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModArchive.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in GameModArchive.unpackChecked at line 57. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModArchive.kt\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModArchive.kt"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f9844b2f4ad06451bb7081cbb7c632a1b35d227c9eef88c53b7b5c1207c583"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/notice/game_info_notice_controller.dart: lib/src/notice/game_info_notice_controller.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in GameInfoNoticeController._handleModernization at line 324. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/notice/game_info_notice_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/src/notice/game_info_notice_controller.dart"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21eceb724c427352e2fb361f4dbc19e2be65426c694309ff0622be4d94a12b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/senka/senka_ui.dart: lib/src/senka/senka_ui.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in SenkaPanel.build 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/senka/senka_ui.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_ui.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"64690f31ea1c2b41b4662022b187a1af58883facd375f0983b4da172ea369819"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheManager.kt: android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheManager.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in GameResourceCacheManager.onMethodCall 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheManager.kt\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheManager.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"93adc7c5b6b2c6ed333e2604a371b99b4596b758fec9401c4f62df4867cb7a62"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/battle/sortie_map_section.dart: lib/src/battle/sortie_map_section.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in _MapPainter.paint at line 480. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/battle/sortie_map_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/src/battle/sortie_map_section.dart"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c48ec6b88c95634cb82d6a2800a284ef5b1a427ebe648341e8d46dcaf4a0df3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/inventory/owned_inventory_projection.dart: lib/src/inventory/owned_inventory_projection.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in OwnedInventoryProjection.equipmentGroups at line 279. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/inventory/owned_inventory_projection.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/owned_inventory_projection.dart"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dacab397b3126592bd7a16a481c27129ce25d909968ec3fdb8aee019a3cfd6d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogState.kt: android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogState.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in NativeGameWarningDialogSpec.parse 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogState.kt\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogState.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec8c7b90c3d6be5caac9610a0ec321b004fda3f87b99fcb43ddf15a1c186f82"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/browser/native_game_webview_contract.dart: lib/src/browser/native_game_webview_contract.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in NativeGameWebViewEvent.decode at line 125. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/browser/native_game_webview_contract.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/native_game_webview_contract.dart"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b9e7eb8aecd5531391ebb8ddb6d9edf76970b4391efdd72f01152e45edd32a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/layout/hd_bottom_strip.dart: lib/src/layout/hd_bottom_strip.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in HdBottomStrip.build at line 25. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/layout/hd_bottom_strip.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/layout/hd_bottom_strip.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f4f6126c706e877254b7a4e1104da60b8cb6d77a4d0a93ed9fdc77db40a210"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tool/test_game_alignment_recovery.cjs: tool/test_game_alignment_recovery.cjs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in test_game_alignment_recovery.page at line 6. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- tool/test_game_alignment_recovery.cjs\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":"tool/test_game_alignment_recovery.cjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6393144094d13779ffb1f85d9812d33055205552e2f0d6dfd06ea995d26ad873"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/battle/battle_detail_replay_builder.dart: lib/src/battle/battle_detail_replay_builder.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in BattleDetailReplayBuilder._parseShell 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/battle/battle_detail_replay_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/src/battle/battle_detail_replay_builder.dart"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c76695251617d4d47753107b756f4e8e59e092c3180889a40b4fe30b7002ba3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/fleet/fleet_ship_minimal_row.dart: lib/src/fleet/fleet_ship_minimal_row.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in FleetShipMinimalRow._statusGrid at line 452. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/fleet/fleet_ship_minimal_row.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_ship_minimal_row.dart"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cc3e07ae1225bf609d6173805289b830ad90b4b3e145d3afbbdc67d8279460"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/toolbox/composition_image_card.dart: lib/src/toolbox/composition_image_card.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in _EquipmentRow.build at line 973. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/toolbox/composition_image_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/src/toolbox/composition_image_card.dart"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbc2630dd794f969de31689c5ee260337d41cc373c1a1d0671ca4e2506205d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/settings/fleet_display_settings_section.dart: lib/src/settings/fleet_display_settings_section.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in FleetDisplaySettingsSection.build at line 19. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/settings/fleet_display_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/src/settings/fleet_display_settings_section.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2c8ff1e47a7a92e579fe6a8898de2af654da4e6cccad00ffa9d43890d88ef0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceDownloadCoordinator.kt: android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceDownloadCoordinator.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in GameResourceDownloadCoordinator.downloadLoop at line 449. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceDownloadCoordinator.kt\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceDownloadCoordinator.kt"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba2454ee1b490cb4a118210938cb0791c9413eca1a09bc65ac7658cfc577b76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/quest/quest_completion_feedback.dart: lib/src/quest/quest_completion_feedback.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in _QuestCompletionFeedbackState._onStateChanged 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/quest/quest_completion_feedback.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_completion_feedback.dart"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1201629e7ab06fb99b7ac6079f353ef2f3b191278d063aca380104ac14887c74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModRepository.kt: android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModRepository.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in GameModRepository.readState at line 794. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModRepository.kt\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModRepository.kt"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8933b275e6b9e4ceab58b250dc05e31166d279d4a6714be8c44009dc1303b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tool/build_sortie_release.py: tool/build_sortie_release.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in build_sortie_release.build_release at line 181. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- tool/build_sortie_release.py\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":"tool/build_sortie_release.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb040c10ce073216354e797b67351a64f31c4e545aeafc9f3570d4523b7dd5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogChannel.kt: android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogChannel.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in NativeGameWarningDialogChannel.renderChecklist at line 655. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogChannel.kt\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogChannel.kt"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f259fdd67fc418462ef42657c4625fcdb60b50b3e903ab10228e4a8add8d05"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/battle/battle_ship_details_popover.dart: lib/src/battle/battle_ship_details_popover.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in _ShipPopoverState.build at line 305. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/battle/battle_ship_details_popover.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_ship_details_popover.dart"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5173d31b0cd9bef1e035f665d1933df23ea97b028431a0f6001cf901a0a460"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/fleet/resource_trend_chart.dart: lib/src/fleet/resource_trend_chart.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in _ResourceTrendChartState.build at line 136. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/fleet/resource_trend_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/src/fleet/resource_trend_chart.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"87610197c8f77cce733681e7e7df071e8cbd90e7ac153ee3100abb3e505762ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/browser/game_resource_manifest_consumer.dart: lib/src/browser/game_resource_manifest_consumer.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in GameResourceManifestConsumer._rebuild at line 76. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/browser/game_resource_manifest_consumer.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/game_resource_manifest_consumer.dart"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08c0ae62fe8d30e496f05db913f9b65ff8b0ae350f773ad31f350d5613ed2b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/browser/game_frame_rate_policy.dart: lib/src/browser/game_frame_rate_policy.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in GameFrameRatePolicy.completeWindow at line 75. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/browser/game_frame_rate_policy.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/game_frame_rate_policy.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b44a29192f7da99c9f6a581f648530d406f8a60bda97fddd62cb9aa00e89dc4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/FixedCanvasScaleApplier.kt: android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/FixedCanvasScaleApplier.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in FixedCanvasScaleApplier.apply at line 44. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/FixedCanvasScaleApplier.kt\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/FixedCanvasScaleApplier.kt"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e5184351a9d56021ee94aad9a90c90df89a0154d340fdd821813f01d34c891"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/audio/game_audio_controller.dart: lib/src/audio/game_audio_controller.dart changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in GameAudioController._reconcileNative at line 204. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/audio/game_audio_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/src/audio/game_audio_controller.dart"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdc45825692fcbc6e8b38a043bf738f4ec7725b2379babc2b9ba14ab03c34ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/game_state/fleet_metrics.dart: lib/src/game_state/fleet_metrics.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in FleetMetrics.fromState 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/game_state/fleet_metrics.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/fleet_metrics.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28b565bc93e2d8f5f588b540fdbb214ff6bc6a014ed64931d63608a672e5457"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/expedition/expedition_evaluator.dart: lib/src/expedition/expedition_evaluator.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ExpeditionEvaluator._evaluateRequirement at line 43. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/expedition/expedition_evaluator.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_evaluator.dart"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d998575cd92fafc9066df53efe5803c053d1e012b6a0b6f32d44d64f8149acaa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/settings/notification_settings_store.dart: lib/src/settings/notification_settings_store.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in NotificationSettings.== at line 117. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/settings/notification_settings_store.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/notification_settings_store.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0520e6357029a7d876cef7d309b9c908291811825c9b777d695d0fb6312ef2f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/toolbox/deck_builder_exporter.dart: lib/src/toolbox/deck_builder_exporter.dart changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in DeckBuilderExporter.exportMap 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/toolbox/deck_builder_exporter.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/deck_builder_exporter.dart"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a471fb8d14fe37e1f3124ee9d02c01dd5a0023a9dad3768313307cf3a1d339"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/RecordBackupHandler.kt: android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/RecordBackupHandler.kt changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in RecordBackupHandler.handleSaveResult at line 437. 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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/RecordBackupHandler.kt\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/RecordBackupHandler.kt"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"3458c5feaa33cba7099c49ad978822b26538a8c3effa0fd6fd39aed4c33c47c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: android/app/src/main/kotlin/app/yahagi/kancollebrowser/notification/NotificationSnapshot.kt: android/app/src/main/kotlin/app/yahagi/kancollebrowser/notification/NotificationSnapshot.kt 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 NotificationDelivery.obsoleteDeliveredAlerts at line 332), 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(\u901A\u77E5): \u9632\u6B62\u5B8C\u6210\u63D0\u9192\u56E0\u72B6\u6001\u5237\u65B0\u4E22\u5931\u201D; \u201Cfix(\u901A\u77E5): \u7EDF\u4E00\u4EFB\u52A1\u63D0\u9192\u901A\u77E5\u8EAB\u4EFD\u201D; \u201Cfix(\u901A\u77E5): \u5B8C\u6210\u63D0\u9192\u8986\u76D6\u63D0\u524D\u63D0\u9192\u5E76\u518D\u6B21\u632F\u52A8\u201D; \u201Cfix(\u901A\u77E5): \u9632\u6B62\u5B8C\u6210\u95F9\u949F\u88AB\u63D0\u524D\u64A4\u9500\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- android/app/src/main/kotlin/app/yahagi/kancollebrowser/notification/NotificationSnapshot.kt\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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/notification/NotificationSnapshot.kt"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd36dec8d3704c3e3d71936fa510ac4d224e65ba6ffaf7fa76cd4c2d69ae60ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/src/inventory/equipment_compatibility_drawer.dart: lib/src/inventory/equipment_compatibility_drawer.dart changed 15 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 _ShipRow.build at line 763), 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(\u4E3B\u9898): \u7EDF\u4E00\u5207\u6362\u4E0E\u7B5B\u9009\u63A7\u4EF6\u6837\u5F0F\u201D; \u201Cfix(\u6062\u590D): \u4FEE\u590D\u672A\u535C\u5148\u77E5\u5E76\u540C\u6B65\u5DF2\u5BA1\u67E5\u6E90\u7801\u201D; \u201Cfix(\u88C5\u5907): \u7F29\u5C0F\u7B5B\u9009\u6309\u94AE\u5E76\u6539\u7528\u8230\u79CD\u7F29\u5199\uFF08\u4EFB\u52A1 2/3\uFF09\u201D; \u201Cfix(\u88C5\u5907): \u6062\u590D\u7B5B\u9009\u63A7\u4EF6\u8BED\u4E49\u64CD\u4F5C\uFF08\u4EFB\u52A1 4/4\uFF09\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/inventory/equipment_compatibility_drawer.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f6725598c71a10acdfdf53ee8553461144ab43b934695f51bb872160d536ca"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/src/development/development_output_table.dart: lib/src/development/development_output_table.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 5 (its worst body is _DevelopmentOutputTableState.build at line 56), 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(\u6062\u590D): \u4FEE\u590D\u672A\u535C\u5148\u77E5\u5E76\u540C\u6B65\u5DF2\u5BA1\u67E5\u6E90\u7801\u201D; \u201Cfix(\u88C5\u5907\u5F00\u53D1): \u7EDF\u4E00\u663E\u793A\u672C\u5730\u5316\u88C5\u5907\u540D\u79F0\u201D; \u201Cfix(\u88C5\u5907\u5F00\u53D1): \u7EDF\u4E00\u8868\u683C\u6392\u5E8F\u63D0\u793A\u6837\u5F0F\u201D; \u201Cfix(\u88C5\u5907\u5F00\u53D1): \u4F18\u5316\u51FA\u8D27\u8868\u683C\u5BBD\u5EA6\u4E0E\u7C7B\u578B\u540D\u79F0\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/development/development_output_table.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/development/development_output_table.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53eedb8b261e0ebffa0423927498f655e7c21986c66abdada40ae13a88e2cc5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/src/development/development_equipment_picker.dart: lib/src/development/development_equipment_picker.dart changed 8 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 10 (its worst body is _DevelopmentEquipmentPickerState.build at line 102), 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(\u4E3B\u9898): \u7EDF\u4E00\u5207\u6362\u4E0E\u7B5B\u9009\u63A7\u4EF6\u6837\u5F0F\u201D; \u201Cfix(\u6062\u590D): \u4FEE\u590D\u672A\u535C\u5148\u77E5\u5E76\u540C\u6B65\u5DF2\u5BA1\u67E5\u6E90\u7801\u201D; \u201Cfix(\u88C5\u5907\u5F00\u53D1): \u7EDF\u4E00\u663E\u793A\u672C\u5730\u5316\u88C5\u5907\u540D\u79F0\u201D; \u201Cfix(\u88C5\u5907\u5F00\u53D1): \u5408\u5E76\u672A\u77E5\u88C5\u5907\u7C7B\u578B\u5206\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/development/development_equipment_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/src/development/development_equipment_picker.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"991c67efa27888a38126e7cfa7591ed37add9e0ad079b7594a885d3e2e2dc994"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/src/toolbox/fleet_export_page.dart: lib/src/toolbox/fleet_export_page.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 _FleetExportPageState.build at line 108), 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(\u6062\u590D): \u4FEE\u590D\u672A\u535C\u5148\u77E5\u5E76\u540C\u6B65\u5DF2\u5BA1\u67E5\u6E90\u7801\u201D; \u201Cfix(\u5DE5\u5177\u7BB1): \u8865\u5168 noro6 \u8230\u5A18\u4E0E\u88C5\u5907\u5BFC\u5165\u201D; \u201Cfix(\u5DE5\u5177\u7BB1): \u660E\u786E\u57FA\u5730\u822A\u7A7A\u961F\u5BFC\u51FA\u4E0A\u9650\u201D; \u201Cfix(\u5DE5\u5177\u7BB1): \u9075\u5FAA\u5B57\u4F53\u4E0E\u672F\u8BED\u5BA1\u8BA1\u89C4\u5219\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/toolbox/fleet_export_page.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/fleet_export_page.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c384641483c172106ca62e40e634cdb8c6bdf6c2553e5a06e6117934949dce06"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/src/capture/android_game_capture_port.dart: lib/src/capture/android_game_capture_port.dart changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is _CaptureConfigurationArbiter._enqueue at line 213), 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(\u5BA2\u6237\u7AEF): \u5B8C\u5584\u5907\u4EFD\u6062\u590D\u4E0E\u754C\u9762\u8BBE\u7F6E\u5E76\u8865\u9F50\u53D1\u5E03\u68C0\u67E5\u201D; \u201Cfix(\u6E38\u620F\u9875\u9762): \u533A\u5206\u5BFC\u822A\u786E\u8BA4\u4E0E\u5E73\u53F0\u54CD\u5E94\u201D; \u201Cfix(\u6E38\u620F\u9875\u9762): \u9650\u5236\u5E73\u53F0\u5F02\u6B65\u4EFB\u52A1\u751F\u547D\u5468\u671F\u201D; \u201Cfix(\u6E38\u620F\u9875\u9762): \u5B8C\u5584\u70ED\u66F4\u65B0\u4E0E\u7EC8\u6001\u4E32\u884C\u6E05\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/capture/android_game_capture_port.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/android_game_capture_port.dart"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"014bf03a29a66f3e7a941eaaa588bb5b04ff333d27ec415e5e5c8e2f390bbf81"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/src/development/development_secretary_picker.dart: lib/src/development/development_secretary_picker.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 DevelopmentSecretaryPicker.build at line 60), 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(\u4E3B\u9898): \u7EDF\u4E00\u5207\u6362\u4E0E\u7B5B\u9009\u63A7\u4EF6\u6837\u5F0F\u201D; \u201Cfix(\u6062\u590D): \u4FEE\u590D\u672A\u535C\u5148\u77E5\u5E76\u540C\u6B65\u5DF2\u5BA1\u67E5\u6E90\u7801\u201D; \u201Cfix(\u88C5\u5907\u5F00\u53D1): \u8865\u5168\u79D8\u4E66\u8230\u9002\u7528\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-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/development/development_secretary_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/src/development/development_secretary_picker.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f971920db385656c432ca2ed0eb4267150fdf318a9ce6771223b4e36002950f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/src/inventory/ship_equipment_compatibility_drawer.dart: lib/src/inventory/ship_equipment_compatibility_drawer.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 _EquipmentRow.build at line 718), 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(\u4E3B\u9898): \u7EDF\u4E00\u5207\u6362\u4E0E\u7B5B\u9009\u63A7\u4EF6\u6837\u5F0F\u201D; \u201Cfix(\u6062\u590D): \u4FEE\u590D\u672A\u535C\u5148\u77E5\u5E76\u540C\u6B65\u5DF2\u5BA1\u67E5\u6E90\u7801\u201D; \u201Cfix(\u88C5\u5907): \u5B8C\u5584\u8230\u5A18\u88C5\u5907\u62BD\u5C49\u672C\u5730\u5316\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/inventory/ship_equipment_compatibility_drawer.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/ship_equipment_compatibility_drawer.dart"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc0862918406e3f143b33e6f7985e8b094494d8f2b1e0a9ef5a20dd06a193b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/src/toolbox/sortie_map_query/sortie_map_catalog_store.dart: lib/src/toolbox/sortie_map_query/sortie_map_catalog_store.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 FileSortieMapCatalogStore._readInstalled at line 170), 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: \u8BA9\u8D44\u6599\u53D1\u5E03\u5951\u7EA6\u5728\u5E72\u51C0\u68C0\u51FA\u8FD0\u884C\u201D; \u201Cfix(\u6D77\u57DF\u8D44\u6599): \u963B\u65AD\u6076\u610F\u89E3\u538B\u4E0E\u60AC\u6302\u4E0B\u8F7D\u201D; \u201Cfix(\u6D77\u57DF\u8D44\u6599): \u52A0\u56FA\u5728\u7EBF\u66F4\u65B0\u4E0E\u672C\u5730\u7F13\u5B58\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:10:58 \u002B09:00\u0027 --until=\u00272026-11-16 19:10:58 \u002B09:00\u0027 --full-history --no-merges -- lib/src/toolbox/sortie_map_query/sortie_map_catalog_store.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/sortie_map_catalog_store.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"7721595763114fccac01901fee0cecb4b572cb786fe9d68e65b9f3aec19729a0"}},{"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 \u0060tool/akashi_bonus/bin/sync.dart\u0060 makes this repository a deployable product (line 65)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/akashi_bonus/bin/sync.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9075086520c990b1854ff771039c31d81e3ca111ab936721783beed60aa1b45b"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060SettingsUIHelpers\u0060 spells \u0060UI\u0060 where 36 names in the project spell it \u0060Ui\u0060: 36 of 37 names in project repository.src spell the token \u0060Ui\u0060 (36 of 37; unit: names in project repository.src containing \u0060Ui\u0060). Peers: repository.src.BattleUiText (lib/src/battle/battle_ui_text.dart:6); GameBrowserActions.GameBrowserActions(onToggleUiLock) (lib/src/browser/game_browser_menu.dart:12); GameBrowserActions.onToggleUiLock (lib/src/browser/game_browser_menu.dart:42); GameBrowserToolbar.GameBrowserToolbar(onToggleUiLock) (lib/src/browser/game_browser_toolbar.dart:11); GameBrowserToolbar.onToggleUiLock (lib/src/browser/game_browser_toolbar.dart:50). Rename to \u0060SettingsUiHelpers\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/settings_ui_helpers.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c16d25aaa375529d8768fbb8fe71b8aefe38ac878bc1d738bc8d69f9841db5d"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060telemetryDeckAppID\u0060 spells \u0060ID\u0060 where 724 names in the project spell it \u0060Id\u0060: 724 of 726 names in project repository.src spell the token \u0060Id\u0060 (724 of 726; unit: names in project repository.src containing \u0060Id\u0060). Peers: AccountScope.AccountScope(memberId) (lib/src/account/account_session.dart:10); AccountScope.memberId (lib/src/account/account_session.dart:12); AccountSession.AccountSession(initialMemberId) (lib/src/account/account_session.dart:26); AccountSession.selectMember(memberId) (lib/src/account/account_session.dart:44); AccountSession._change(memberId) (lib/src/account/account_session.dart:47). Rename to \u0060telemetryDeckAppId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/telemetry/telemetry_service.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8c99c08ec8d4a968139ecc9227feec2095bcf67185bb62d776d7446e5dc6e8"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060telemetryDeckAppID\u0060 spells \u0060ID\u0060 where 724 names in the project spell it \u0060Id\u0060: 724 of 726 names in project repository.src spell the token \u0060Id\u0060 (724 of 726; unit: names in project repository.src containing \u0060Id\u0060). Peers: AccountScope.AccountScope(memberId) (lib/src/account/account_session.dart:10); AccountScope.memberId (lib/src/account/account_session.dart:12); AccountSession.AccountSession(initialMemberId) (lib/src/account/account_session.dart:26); AccountSession.selectMember(memberId) (lib/src/account/account_session.dart:44); AccountSession._change(memberId) (lib/src/account/account_session.dart:47). Rename to \u0060telemetryDeckAppId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/telemetry/telemetry_service.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd480115487f9fb3f6a87bc29a2f12f938d5cedf9d00d689f3e8c41fcdf5044e"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (170964 LoC, 1232 module-visible types across 44 directories) overshoots its size bounds. 2 of 2 build unit(s) (Gradle, pub) overshoot their size bounds, lowering Project Cohesion to 0.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pubspec.yaml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9fee3010c053c10733ebad6b156234032ce361c46f8c03bb63f2bdc3c8adbd"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060android/app\u0060 (24535 LoC, 486 module-visible types across 14 directories) overshoots its size bounds. 2 of 2 build unit(s) (Gradle, pub) overshoot their size bounds, lowering Project Cohesion to 0.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/build.gradle.kts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ded88f0fae228fc99fab396cecc45e2ee23bf5fad755a3976ca1fd14e903a1"}},{"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":"cc1d655351c8df26e67f2b81525e85a6152f0d3e63b1f102471043b672460854"},"properties":{"commitSha":"9e78ebf447634d362b2265ad2b378c76fea28cde"}},{"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":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"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":"71d409363b55a1d24dc05307b924cc6c6729c6dbea72afa05fed85828fe13b0b"},"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":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"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":"7c30eadcccbceed0e0d7a888424133243f0a80f7e1c7cb21212f7f3b62f298cd"},"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":"f47fe133ab99fd9fe646c541cbea7cf045b570629956650b3d04747a5a6c4f07"},"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":"493308c88e8c66fcb98ce33fa8a7c07e2fee06375429dcf7629ec741ee5f79d7"},"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":"482e3b19efd040fb2215efbc5e65f5b9996234817368c5a9198eb89910e46231"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"c8381cdd9539330ccdf5f2819fb2f0ec8e0d20d645b1467a3e5e48700a37b69b"},"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":"ebac61d292e4757946ff83f15293e2fa751db1ae0044345ec1ca160a7804b230"},"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":"d9312e44ab53b4ee7d56f41a481fe965f47e3ad94316dc97cd704c70ca0c4687"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"7b522c9db77f4e485f857aa92df3a20bcd8c20a84071a5e3fdd5b303b360bc41"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"688fae09555689362989cfdb34ed56d75ae74c0134b4a6a5be3138da840f1006"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"f4afd84676f6c3f81a9af7afdf739adb925184244eb01c15b56bb00f14d29660"},"taxa":[{"id":"CWE-838","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: fleet_summary_card.dart \u2194 layout_settings_controller.dart: \u0060lib/src/fleet/fleet_summary_card.dart\u0060 (context fleet) and \u0060lib/src/settings/layout_settings_controller.dart\u0060 (context settings) sit in DIFFERENT parts of the tree yet change together 54% of the time (7 of the 13 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060d6740d67\u0060 \u65B0\u589E\u529F\u80FD; \u0060c7ab4e50\u0060 \u65B0\u589E\u529F\u80FD; \u006042ec71a8\u0060 \u65B0\u589E\u529F\u80FD \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_summary_card.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb02c6c415d43da12f63f2ab5f6647a0afba999dead9d49ac3444543d8c0dbf"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: game_capture_path_catalog.dart \u2194 game_state.dart: \u0060lib/src/capture/game_capture_path_catalog.dart\u0060 (context capture) and \u0060lib/src/game_state/game_state.dart\u0060 (context game_state) sit in DIFFERENT parts of the tree yet 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060372893ca\u0060 \u65B0\u589E\u529F\u80FD; \u0060c62aabc8\u0060 \u65B0\u589E\u529F\u80FD; \u00609b5401d5\u0060 \u65B0\u589E\u529F\u80FD \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/game_capture_path_catalog.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65191abbdb321ed0a749880ae6656c295c5ca29731f1ca1adb57e4b3481d5dfd"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: game_state_reducer.dart \u2194 game_state_serializer.dart: \u0060lib/src/game_state/game_state_reducer.dart\u0060 and \u0060lib/src/game_state/game_state_serializer.dart\u0060 change together 82% of the time (9 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 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 9 shared commits counted here, the most recent 3 are \u0060baaeecfe\u0060 \u65B0\u589E\u529F\u80FD; \u00604141eee9\u0060 \u65B0\u589E\u529F\u80FD; \u00603f34fed7\u0060 \u65B0\u589E\u529F\u80FD \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf0711b0fc07b9312b6ac7a1adf789ace9baabc9473460554ef0a9742550e3d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: main.dart \u2194 screen_settings_page.dart: \u0060lib/main.dart\u0060 and \u0060lib/src/settings/screen_settings_page.dart\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \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 \u00601b1418ef\u0060 \u65B0\u589E\u529F\u80FD; \u006050efa949\u0060 \u65B0\u589E\u529F\u80FD; \u0060e3e8ef5a\u0060 \u65B0\u589E\u529F\u80FD \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/main.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22b6b49ad42c7b0a7848e77b9e6d4d01cabb2b38a3e2fa0212ba7d9d626812d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: fleet_information_center.dart \u2194 fleet_summary_card.dart: \u0060lib/src/fleet/fleet_information_center.dart\u0060 and \u0060lib/src/fleet/fleet_summary_card.dart\u0060 change together 50% of the time (6 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 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 6 shared commits counted here, the most recent 3 are \u006076702e82\u0060 \u65B0\u589E\u529F\u80FD; \u00601b1418ef\u0060 \u65B0\u589E\u529F\u80FD; \u0060f7648080\u0060 feat(\u6218\u6597\u63D0\u9192): \u63A5\u5165\u95EA\u70C1\u8303\u56F4\u4E0E\u58EB\u6C14\u6548\u679C \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_information_center.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15e97b208d1186eefb4e3393b26bb9d5477b615a8c88f5cd6ca43bb1409ffe1"}},{"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":"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":"D37","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":"2e96dfd6d93fe913fb2e9028610c982dbd322c76ecf26cfdd7734b74da991d0f"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_ooi_viewport_browser_smoke.cjs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2167b03c69b9ca00349c30d192ce721acd4b3c2b3587ca0df3b38be83b5a9073"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_ooi_viewport_browser_smoke.cjs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a43a2044788306dd50954936e2eedcefe0a714cc3e246d042d58e994dbdcea2"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_ooi_viewport_browser_smoke.cjs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"58aaaa9261eb2c291feb2518e2f441d97ecae9e6de11ec0cd9e82bd781cab76f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_ooi_viewport_browser_smoke.cjs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5a27cb60b5d32feb8be70ecf354e73c9170dce3b74312be9d27f8460cf950f"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_ooi_viewport_browser_smoke.cjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"583627f28d3f7398984111b4c0048d6b9cefac442786d09b3904c9d9479b93da"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_ooi_viewport_browser_smoke.cjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c802b6ef8f3af146538e6ea8bfc6ee8b677fe0b8a3eba56c8ceee08496e67e"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_ooi_viewport_browser_smoke.cjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"336db3d1c73e7cab5218d58b6f52d7cc3b3e6f2517ea46322e34de42b43b3f77"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Ciframe\u003E without a title: An iframe with no title (or an empty one) is announced only as \u0022frame\u0022. Add a non-empty title describing its content, or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_ooi_viewport_browser_smoke.cjs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"6172d6baac8736f81f6af848a15dd772144219ecc387012990748cdb1d463c16"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: AppLocalizations (1299 abstract methods): \u0060AppLocalizations\u0060 declares 1299 abstract methods: \u0060debuffReminderTitle\u0060, \u0060debuffReminderSourcePort\u0060, \u0060debuffReminderSourceBattleResult\u0060, \u0060debuffReminderSourceAirDefense\u0060, \u0060debuffReminderMessage\u0060, \u0060debuffReminderSectionTitle\u0060, \u0060debuffReminderSettingTitle\u0060, \u0060debuffReminderSettingSubtitle\u0060, \u0060debuffReminderStyleDialog\u0060, \u0060debuffReminderStyleTopNotice\u0060, \u0060cameraAvoidanceTitle\u0060, \u0060cameraAvoidanceDesc\u0060, \u0060cameraAvoidanceDistance\u0060, \u0060operationProtectionTitle\u0060, \u0060confirmBeforeExitTitle\u0060, \u0060confirmBeforeExitDescription\u0060, \u0060confirmBeforeExitSaveFailed\u0060, \u0060appExitConfirmTitle\u0060, \u0060appExitConfirmDescription\u0060, \u0060appExitStay\u0060, \u0060appExitToDesktop\u0060, \u0060appExitFailed\u0060, \u0060enterGameFullscreen\u0060, \u0060exitGameFullscreen\u0060, \u0060exitFullscreenShort\u0060, \u0060exitFullscreenConfirmTitle\u0060, \u0060exitFullscreenConfirmDescription\u0060, \u0060exitFullscreenSkipConfirmation\u0060, \u0060exitFullscreenConfirmAction\u0060, \u0060gameFullscreenHint\u0060, \u0060gameFullscreenUnavailable\u0060, \u0060questCompletionNotice\u0060, \u0060questCompletionCount\u0060, \u0060resourceTrend90d\u0060, \u0060resourceTrendInventoryTitle\u0060, \u0060resourceTrendCustomize\u0060, \u0060resourceTrendAtLeastOne\u0060, \u0060resourceTrendBuildMaterial\u0060, \u0060resourceTrendRepairMaterial\u0060, \u0060resourceTrendDevMaterial\u0060, and 1259 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":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fe7ecfd7d0347f61e13639799b7efef931a53b69580a81c3951e891578014f"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: LayoutSettingsStore (20 abstract methods): \u0060LayoutSettingsStore\u0060 declares 20 abstract methods: \u0060loadGameAreaRatio\u0060, \u0060saveGameAreaRatio\u0060, \u0060loadInformationPanelWidth\u0060, \u0060saveInformationPanelWidth\u0060, \u0060loadAutoZoom\u0060, \u0060saveAutoZoom\u0060, \u0060loadEnhancedDamagePulse\u0060, \u0060saveEnhancedDamagePulse\u0060, \u0060loadWorkspaceMenuOnRight\u0060, \u0060saveWorkspaceMenuOnRight\u0060, \u0060loadDashboardCardOrder\u0060, \u0060saveDashboardCardOrder\u0060, \u0060loadDashboardCardCollapsed\u0060, \u0060saveDashboardCardCollapsed\u0060, \u0060loadDashboardCardHidden\u0060, \u0060saveDashboardCardHidden\u0060, \u0060loadFontFamily\u0060, \u0060saveFontFamily\u0060, \u0060loadLocaleCode\u0060, \u0060saveLocaleCode\u0060. Counted over its public methods with no body, once per name; concrete methods and \u0060_\u0060-private members are not counted, because no implementer that extends it is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/layout_settings_store.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c492cffa2098b88a556240be98b1530694fee13a6dbc87bc616c1d376f2569a2"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/akashi_bonus/dataset_validator_test.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34ff6838cd150f4e462e3d509d5e91fb35b27c50b23caaa09d7f253c04b40ce"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/akashi_bonus/detail_parser_test.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b52963e0b6a744f585f375651a6d79a2e8205baa516bc4e9d14635a46663f3"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/akashi_bonus/full_dataset_calculator_test.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"528e867d27602fda240e58f145f1ce986be73b856888d420208d888cb60c8805"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/akashi_bonus/page_discovery_test.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84dd23772590a5ea3a571a2376e0694c75b11d6a6217a211b3d9886aa22cefc"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/akashi_bonus/reference_calculator_test.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c431d4c086a9d752d0b0274ce4a720311c0c136c208b4bcf48b1f09985a87a0"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/akashi_bonus/target_group_parser_test.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91b1e75ca0d6186ad6ca6f289d4d3704a9a756e75c33991e8fe79f149f8b914"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/fleet_information_center_test.dart"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"99402cf7cd9ea7260a28589be321af689a75706fd38c736d3e493e8ab8f520a2"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/fleet_information_center_test.dart"},"region":{"startLine":2203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed335a8a2229b520fe9b841865ab94e9140116e2f9b767fa8d4694174b218c6e"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/fleet_information_center_test.dart"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52c04ac95ebc0447e7414d2368baffd3fa1236e5d6fb7f6f065727f3f80c94b"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/fleet_information_center_test.dart"},"region":{"startLine":2616}}}],"partialFingerprints":{"codehealthFindingId/v1":"b841cf04641f57b8a882a8a27928fdca9170a9a05491cec9dfd38f8a84c8888a"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/fleet_information_center_test.dart"},"region":{"startLine":2660}}}],"partialFingerprints":{"codehealthFindingId/v1":"5050c45770c5697a3c3be509e9a3a66bb1a650f9b1465f3f3f5be016740ea564"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/fleet_information_center_test.dart"},"region":{"startLine":2888}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd90ebd3d71ddfc7431fc97947ad9677e02d1fb015a66d8992e80dff9dfc26dc"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"warning","message":{"text":"Analyzer excludes 3 path(s) that do not exist: \u0060analysis_options.yaml\u0060 excludes \u0060check_url.dart\u0060, \u0060test_cipher.dart\u0060, \u0060test_dmg_urls.dart\u0060 from analysis, and no such path is in the repository. These entries are dead configuration: they silence nothing today, and each one is a name the analyzer will silently start honouring the moment a directory of that name appears \u2014 so the file\u0027s exclusion list is wider than anything anybody decided. Delete the entries that no longer name anything, and keep the ones that do."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analysis_options.yaml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d27f3f2e0af9f5e1e80738ac0a89c39ed98d9e0da34f406a590913be91067a"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add the Dart analyzer\u0027s security lints plus \u0060semgrep --config=auto\u0060 as a CI step. What was searched, so you can tell an absence from a miss: the 1 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060android/app/build.gradle.kts\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.kts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc97f07cd7964b9bf62027a14dacef9476a9fd3261d3eb8f9817a5ace18ba64"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/ship_subtitle_browser_benchmark.cjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6960607540f02a5c9929252009c1d18a1daef261fc6516a2b5602cfa6a606dc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/ship_subtitle_browser_benchmark.cjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6c48c3789b34e24fe406a229045f9a7a188ef09373d63b9ed1a7b33f7db02f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.appendFileSync\u0060 in \u0060check\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_ooi_viewport_browser_smoke.cjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacc0cf8aa6a5bd866eb947615cb5a45a2c9861fd08d35dbb4e1ff4efe6f8bf7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060git\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_ooi_viewport_browser_smoke.cjs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"098df4771c6fc0e5d07b1a8e3e562295b9a7c55797e845b06ba4b5d9351449c6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060anonymous function\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_ooi_viewport_browser_smoke.cjs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a29e61a35f2c3c05151fa55602aeda819c8184676b422ae02891a880f674d05"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 0 typed \u00B7 11 plain JS \u2014 the untyped files are assets/scripts/ship_subtitles.js, test/subtitles/ship_subtitles_runtime_test.cjs, tool/battle_detail_poi_oracle.cjs, tool/test_capture_extreme_transport.cjs, tool/test_game_alignment_recovery.cjs, tool/test_game_frame_rate_script.cjs (\u002B5 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): tool/test_game_frame_rate_script.cjs:291 \u00B7 tool/test_game_frame_rate_script.cjs:314 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_game_frame_rate_script.cjs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f69cb18180b54f0b9184fd6e79a62feef5f735a13c02eb6b993ca8e880085c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): tool/test_game_frame_rate_script.cjs:305 \u00B7 tool/test_game_frame_rate_script.cjs:352 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_game_frame_rate_script.cjs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"7547f2a35e94fa057ea5bffbd322f95adb78ad00819450bc029ca74b98672815"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): tool/test_game_frame_rate_script.cjs:363 \u00B7 tool/test_game_resume_stress.cjs:115 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_game_frame_rate_script.cjs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"265fdfc00aad534455f7b72d865f70f067af74e805ec9ebd3f08c109dd81fac5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): tool/test_game_mouse_wheel_script.cjs:74 \u00B7 tool/test_game_mouse_wheel_script.cjs:201 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_game_mouse_wheel_script.cjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa113fe3588ca1b55d5cdcacafd326ed80336df89c13ca20994aa0591cbb12c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): tool/test_game_resume_stress.cjs:34 \u00B7 tool/test_game_resume_stress.cjs:122 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_game_resume_stress.cjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec8911b4a1651bc2c38f07db95e4f0f5a3c4ec0005b8638b52d569785192e99"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): tool/test_game_alignment_recovery.cjs:128 \u00B7 tool/test_game_alignment_recovery.cjs:133 \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":"tool/test_game_alignment_recovery.cjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"994d7b17a58233f9285e310e7846eaea31eb6ec4f09950d4a25472b24984a968"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): tool/test_game_frame_rate_script.cjs:138 \u00B7 tool/test_game_frame_rate_script.cjs:199 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_game_frame_rate_script.cjs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6af2095f8c9c1dae7d762e498603cf193559c8163068b633f9dff51203bf78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): tool/test_game_frame_rate_script.cjs:163 \u00B7 tool/test_game_frame_rate_script.cjs:208 \u00B7 tool/test_game_frame_rate_script.cjs:226 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_game_frame_rate_script.cjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7c4cfefa6b8f8f0c3e7ac665b3841949dfe0b7859919fdeb63d8b0431dd618"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): tool/test_game_frame_rate_script.cjs:280 \u00B7 tool/test_game_resume_stress.cjs:160 \u00B7 tool/test_game_resume_stress.cjs:173 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_game_frame_rate_script.cjs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f52d9d9be88414665cf9b4f490c7e9a549de714eb9711d2870d476d2860dea9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): tool/test_game_resume_stress.cjs:27 \u00B7 tool/test_game_resume_stress.cjs:36 \u00B7 tool/test_game_resume_stress.cjs:43 \u00B7 tool/test_game_resume_stress.cjs:116 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_game_resume_stress.cjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d8a8d1f1dd8d3971cab216c714a199eaccbb36f4d336e55785c2fa623f1adc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): tool/test_ooi_viewport_browser_smoke.cjs:669 \u00B7 tool/test_ooi_viewport_browser_smoke.cjs:696 \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":"tool/test_ooi_viewport_browser_smoke.cjs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f63fba56d4e4db8e022dcfa7b67f1f8e709eba7852a2d6ddafd9f6c66a69b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 30, cognitive 42): run has cyclomatic complexity 30 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_ooi_viewport_browser_smoke.cjs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93d65e6335a3ef52d0ed5defef4c141089fc9af4aefafd8155ab542d5d62eb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 34): (anonymous) has cyclomatic complexity 22 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_game_resume_stress.cjs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"32efed67c872e48520f2db102dee41e15bc7599a1bcdb900f84cc789a4daa201"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onmessage (cyclomatic 21, cognitive 27): onmessage has cyclomatic complexity 21 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/scripts/ship_subtitles.js"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4dc3abd742fbd037f816c9bbaec2b688c09dba12015313402bec2d99b50862"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function identify (cyclomatic 14, cognitive 20): identify has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/scripts/ship_subtitles.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f649d7ae12b8c6cdb30c906832f30c9685aea5c428a582d17937273bba8b62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onPlay (cyclomatic 14, cognitive 12): onPlay has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/scripts/ship_subtitles.js"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70dc46661b047c65b7ccf33feb0b015a8613c503172e72ff45e0e07f439c880"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 17): (anonymous) has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/scripts/ship_subtitles.js"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9afc4a954ac153f07a8054b129f4033c889564fc63d4545b0c1e50c67bd87d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layout (cyclomatic 13, cognitive 10): layout has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/scripts/ship_subtitles.js"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6446952a6871826d71a13a36faa17e0a60a86096e27824f86d8e90fcc9b2df07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lifecycleChecks (cyclomatic 12, cognitive 15): lifecycleChecks has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_ooi_viewport_browser_smoke.cjs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b700c728622d537cd0c6b5567765faf3a0551ea9f247f5417a9b46d205b0aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function querySelectorAll (cyclomatic 12, cognitive 11): querySelectorAll has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_game_alignment_recovery.cjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1322ba6db8d20a18874f6d0c26c712bf949da74aef5d57988b6202703d00b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 12, cognitive 9): start has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/scripts/ship_subtitles.js"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"292f8af3f712db1dd4cf297fe222b42b58bdb76cc527b6036a90bf3f910e3308"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 11, cognitive 10): main has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_capture_extreme_transport.cjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7166c214637341004b2e68f0b7b72e699fc7dc8b12695150b3bacfe38d79a1ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderPage (cyclomatic 11, cognitive 9): renderPage has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/scripts/ship_subtitles.js"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e47bd0eff827e5a1ba343ff12eed32701e3bc38359dea6d0e0e9823af41953c"}},{"ruleId":"R3","level":"warning","message":{"text":"tool/test_ooi_viewport_browser_smoke.cjs: 857 lines of code: tool/test_ooi_viewport_browser_smoke.cjs has 857 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_ooi_viewport_browser_smoke.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fa00d0622f3bfc25cb1e56c1a6b0973d9081d0eb2556f20af067e0b90e7dc6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_ooi_viewport_browser_smoke.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f33d2d6eb758994420535c4938a34b6a43eca27b1bb0bb0f16d64192eabcec9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_game_alignment_recovery.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ebbc5cca242119257c80956010250c578d45b6872bee783bbb57672c41a0e2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_game_frame_reload_script.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd1c1da38884bf40f5a705ba6f61cce3e1023c8a73260f7d114326f27228e69"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/verify_poi_ezexped_runtime.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b413578a3690814afd155135c7edb1392e207184d5ba0e84bb596a6e43f6b0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_capture_extreme_transport.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a617c619dee4bb1f6a63a3b6482d9458444d55c1a2b085b0657b264c23b115ea"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/battle_detail_poi_oracle.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2127a5628478a210cb49c473ef7d90dab52da030c649098e98becd05c5e1a3e2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~415 LoC): no import path from any entry point (4 application, 1 tooling, 8 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_game_alignment_recovery.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabd566d10ee0c007d8db02faf784d99756906002ddeafedfdb1a776b9b16faa"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~111 LoC): no import path from any entry point (4 application, 1 tooling, 8 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_game_frame_reload_script.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8801dc38431310bbbcf154414f5a74367cd64f80fbd7b3e683cd8b22f9c08373"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~102 LoC): no import path from any entry point (4 application, 1 tooling, 8 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/verify_poi_ezexped_runtime.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf91367305f3ced6750c8fc34fbca6aab1919442a9ec50bc1086fe16cb2a39c2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~100 LoC): no import path from any entry point (4 application, 1 tooling, 8 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/test_capture_extreme_transport.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce85960bf886638c4b425c15d0601449ea6d31dc96bb810cae9a986344cd6941"}},{"ruleId":"S1","level":"note","message":{"text":"No security response headers detected: None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, \u2026) is set on a response this repository\u0027s Dart server sends \u2014 defense in depth, even when a proxy could set them. (\u22122.0 on this card.) The server: tool/advance_warning_device_smoke/main.dart:65 \u2014 \u0060HttpServer.bind(\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd19c680309417e132c0be93c2002123f0664b42afe6172b1319da65a6a57ba7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!_disposed \u0026\u0026 accountSession!.isCurrent(scope)\u0060 appears character-identically in 2 files \u2014 lib/src/battle/formation_memory.dart, lib/src/notification/game_notification_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/src/battle/formation_memory.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"12809ab3709665e68572870e12c245a226b40bb5c33cedb6927362d9a86c9615"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!context.mounted || !session.isCurrent(scope)\u0060 appears character-identically in 2 files \u2014 lib/src/senka/base_senka_section.dart, lib/src/settings/data_settings_page.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/base_senka_section.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea5acd55cbcfd07cc0c50ca0b6cad2925cf65a2a26acb4af68ecfe6e48b2fc7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isEscaped \u0026\u0026 ship.currentHp \u003E 0 \u0026\u0026 ship.maxHp \u003E 0 \u0026\u0026 ship.currentHp * 4 \u003C= ship.maxHp * 3\u0060 appears character-identically in 2 files \u2014 lib/src/battle/detailed_battle_panel.dart, lib/src/battle/live_battle_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/src/battle/detailed_battle_panel.dart"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"194c14928451abec01bf0de969ea20217c14af22604ea2729b291b489bcad10d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!japanese \u0026\u0026 !traditional \u0026\u0026 !korean \u0026\u0026 !english\u0060 appears character-identically in 2 files \u2014 lib/src/localization/runtime_message_text.dart, lib/src/localization/ui_text.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/localization/runtime_message_text.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dee8f7ec62a2a6e23d317730ba13f0f7fea6d07c9f5f5887a072d7bf82e5a4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!kIsWeb \u0026\u0026 defaultTargetPlatform == TargetPlatform.android\u0060 appears character-identically in 3 files \u2014 lib/src/browser/game_frame_rate_port.dart, lib/src/capture/android_game_capture_port.dart, lib/src/settings/game_rendering_mode_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/src/browser/game_frame_rate_port.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e0c68b96bfdf4a2dc663e348a06309dd3bd702dfdb0a75db49540edc4699cc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!mounted || generation != _catalogGeneration\u0060 appears character-identically in 2 files \u2014 lib/src/logbook/logbook_page.dart, lib/src/toolbox/exp_calc/exp_calc_page.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_page.dart"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c4268b4c4b4c600cd74a8ec853e7878f0bbd3abff5f779728ec4d2d1f6ce07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!mounted || generation != _queryGeneration\u0060 appears character-identically in 2 files \u2014 lib/src/logbook/logbook_experience_page.dart, lib/src/logbook/logbook_page.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_experience_page.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9707032f800a98e34787b7fa493f0e93674ad6122adc9c89f620f33a601eb976"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!mounted || widget.state.memberId != memberId\u0060 appears character-identically in 2 files \u2014 lib/src/toolbox/composition_image_page.dart, lib/src/toolbox/exp_calc/exp_calc_page.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/composition_image_page.dart"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70c322c0dc20262815f88d4351659945333a58bad88af1838a54bf143e45fcb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!session.isCurrent(scope) \u0026\u0026 route.isActive\u0060 appears character-identically in 3 files \u2014 lib/src/senka/base_senka_section.dart, lib/src/settings/data_settings_page.dart, lib/src/settings/network_settings_page_new.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/base_senka_section.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9b80ddea4e8594f25c4d4581d4cf14e63057892e6518cac3323e0c612c4398"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(fleetId == 1 || fleetId == 2) \u0026\u0026 state.combinedFleetType != CombinedFleetType.none\u0060 appears character-identically in 2 files \u2014 lib/src/fleet/fleet_information_center.dart, lib/src/fleet/fleet_summary_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/src/fleet/fleet_information_center.dart"},"region":{"startLine":2037}}}],"partialFingerprints":{"codehealthFindingId/v1":"238d1290d2d4f8331fcbfa10c09eca7b92a27324887255f19df75b3d059d3745"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060HdModuleColumns.of(context) \u003E 1 \u0026\u0026 !PanelStyleScope.isFlat(context)\u0060 appears character-identically in 2 files \u2014 lib/src/fleet/fleet_summary_card.dart, lib/src/fleet/repair_summary_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/src/fleet/fleet_summary_card.dart"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefd3b84f382cc060ee959b498ba398bfea97ecf298f94c4305f1f3084718fa1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060MechanismTone.neutral || MechanismTone.antiSubmarine\u0060 appears character-identically in 2 files \u2014 lib/src/fleet/fleet_information_center.dart, lib/src/fleet/ship_status_style.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_information_center.dart"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e9fe9f3d0315b8e135badb887ac98f85d781315cd13bf5791be200a190981f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060WidgetsBinding.instance.lifecycleState == null || WidgetsBinding.instance.lifecycleState == AppLifecycleState.resumed\u0060 appears character-identically in 2 files \u2014 lib/src/game_webview.dart, lib/src/subtitles/ship_subtitle_runtime_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/src/game_webview.dart"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"c388db00d25405c9eb40cbfeaf0e3a844b19234234afd7be54b752e7ebaf71a3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_disposed || _saving || enabled == _enabled\u0060 appears character-identically in 2 files \u2014 lib/src/settings/app_exit_settings.dart, lib/src/settings/game_mouse_wheel_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/src/settings/app_exit_settings.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb51d4196a83e95bbc922f13b1d0a7612c86758953678c7e9ce3f5ffce3b391"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_disposed || generation != _portGeneration\u0060 appears character-identically in 2 files \u2014 lib/src/audio/game_audio_controller.dart, lib/src/settings/screen_awake_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/src/audio/game_audio_controller.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2ecbc885dc7e692da21c85c5320f46b65c8780326910179ba579cc58576f14"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_navigationAcknowledged || _navigationIssued\u0060 appears character-identically in 2 files \u2014 lib/src/game_webview.dart, lib/src/native_activity_game_surface.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_webview.dart"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41ed5b972c83be2df3abf4b0e7dee238d35dba080a2019c574bd57c8128b319"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_retiredDocumentIds.contains(documentId) || (_activeDocumentStartedAt != null \u0026\u0026 startedAt \u003C= _activeDocumentStartedAt!)\u0060 appears character-identically in 2 files \u2014 lib/src/capture/game_capture_controller.dart, lib/src/game_state/game_api_event_pipeline.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/game_capture_controller.dart"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be267434a6d751679038d9b261a97c5336731867d7e8d9430e1904e49e28512"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060airPowerMaximum != null \u0026\u0026 airPowerMaximum \u003E airPower\u0060 appears character-identically in 2 files \u2014 lib/src/fleet/fleet_summary_card.dart, lib/src/toolbox/composition_image_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/src/fleet/fleet_summary_card.dart"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"1395682b92fc76d1615747851c4bf51a9020189beec453bbdbff0a6b8868d848"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060base == null || max == null || base \u003C 0 || max \u003C 0\u0060 appears character-identically in 2 files \u2014 lib/src/game_state/game_state_reducer.dart, lib/src/game_state/game_state_serializer.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":2848}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a21fd7441f125ede0f0d00671176b6c643c31eb3d199d16f099aa7d64a9d62"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060base.areaId == areaId \u0026\u0026 base.baseId == hp.baseId\u0060 appears character-identically in 2 files \u2014 lib/src/battle/battle_controller.dart, lib/src/game_state/game_state_reducer.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_controller.dart"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e22545fa37a7544fab7189e7328873e72116ea1820356b5aeb96a49ac2f7d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060base.areaId == landBaseAreaId \u0026\u0026 landBaseIds.contains(base.baseId)\u0060 appears character-identically in 2 files \u2014 lib/src/toolbox/composition_image_card.dart, lib/src/toolbox/composition_record_snapshot.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/composition_image_card.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"798fc4c72ecfcebf069ebc7a218f9eac42e1a3b63654f7cba82d58c3771d6bf4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060battle == null || battle.friendShips.isEmpty\u0060 appears character-identically in 2 files \u2014 lib/src/battle/live_battle_card.dart, lib/src/layout/module_summaries.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/live_battle_card.dart"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb649d35e0edc301acc776ca1577d5bacb3a11efd70dc75c742114f697b93b9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060battle.enemyEscort.isNotEmpty || rawEnemyName.contains(\u0027\u8054\u5408\u8230\u961F\u0027)\u0060 appears character-identically in 2 files \u2014 lib/src/battle/detailed_battle_panel.dart, lib/src/battle/live_battle_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/src/battle/detailed_battle_panel.dart"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4daf1590f91bdd8cdc9ba41e9482e01faded9bbddbf0cbcc33b194006fc8c2c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060commit is! String || !RegExp(r\u0027^[0-9a-f]{40}$\u0027).hasMatch(commit)\u0060 appears character-identically in 2 files \u2014 lib/src/quest/quest_progress_dataset.dart, lib/src/quest/quest_progress_update_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/src/quest/quest_progress_dataset.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e676948673af2bbb48a705124b543c340de80ecd209828e8bd7057dc1b5cb42"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060compatibility == null || !compatibility.canEquip\u0060 appears character-identically in 2 files \u2014 lib/src/inventory/equipment_compatibility_projection.dart, lib/src/inventory/ship_equipment_compatibility_projection.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_projection.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a039269d4d1b846f9fab9fa5809f4111604162265dacc65a60b277e55f60512"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060compatibility.canEquipInRegularSlot \u0026\u0026 compatibility.canEquipInExpansionSlot\u0060 appears character-identically in 2 files \u2014 lib/src/inventory/equipment_compatibility_drawer.dart, lib/src/inventory/ship_equipment_compatibility_drawer.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/equipment_compatibility_drawer.dart"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"972cfbd52ac3331016faa13783f1de7725555ee742c3cbb8f631f20d850b6b25"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060condition.auxiliary \u0026\u0026 !condition.passed\u0060 appears character-identically in 2 files \u2014 lib/src/expedition/expedition_check_card.dart, lib/src/expedition/expedition_check_page.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_check_card.dart"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"736698470f08a404f104082fe788cd90217804aedaee4464656b7788d2b8cd5d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060confirmed != true || !session.isCurrent(scope)\u0060 appears character-identically in 2 files \u2014 lib/src/senka/base_senka_section.dart, lib/src/settings/network_settings_page_new.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/base_senka_section.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9f6265597eb2ec329a682e439918d5490a5ac36734e28e8c92e0faf0989876"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dock.isRepairing \u0026\u0026 dock.completionTime != null\u0060 appears character-identically in 2 files \u2014 lib/src/fleet/operation_status_views.dart, lib/src/notification/game_notification_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/src/fleet/operation_status_views.dart"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e93af65a69a47310630349a996a9038a1cdc082480bf7c8fefdde1b90421aab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dock.isRepairing \u0026\u0026 dock.shipId == shipId\u0060 appears character-identically in 2 files \u2014 lib/src/fleet/anchorage_repair_calculator.dart, lib/src/fleet/nosaki_sparkle_calculator.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/anchorage_repair_calculator.dart"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"696ff1a0a2c4c2ce51953f347133c2fee24d7a868e1d987d62a5458ec1652d01"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060documentId != null \u0026\u0026 documentId == _activeDocumentId\u0060 appears character-identically in 2 files \u2014 lib/src/capture/game_capture_controller.dart, lib/src/game_state/game_api_event_pipeline.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/game_capture_controller.dart"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bc2686e83be838fc54bccb1e089007435a4521ea80f593207f63e2cc306b2c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060enemy.flagshipSunk \u0026\u0026 ours.sunk \u003C enemy.sunk\u0060 appears character-identically in 2 files \u2014 lib/src/battle/battle_rank.dart, lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_rank.dart"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b280958aff598f38489d590875e2e56a1c2cc7d9ce8a0ac9121d8cc70af98cf2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.key is! String || (entry.key as String).trim().isEmpty || (entry.key as String).length \u003E 512 || entry.value is! String || (entry.value\u2026\u0060 appears character-identically in 2 files \u2014 lib/src/localization/game_name_dictionary.dart, lib/src/subtitles/ship_subtitle_name_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/src/localization/game_name_dictionary.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa40b890548f3d15c3d5ae38ce04e48f3597f50538ffa1f2846a2482346e249"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060eq.master != null \u0026\u0026 eq.master!.type.length \u003E= 4\u0060 appears character-identically in 2 files \u2014 lib/src/fleet/fleet_ship_minimal_row.dart, lib/src/fleet/fleet_ship_status_capsule.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/fleet_ship_minimal_row.dart"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"631f7fdea7d90df8d198f5993cecf44917d8a0f172c815399b7198f8b2f7aaec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event is KeyDownEvent \u0026\u0026 event.logicalKey == LogicalKeyboardKey.escape\u0060 appears character-identically in 2 files \u2014 lib/src/battle/battle_ship_details_popover.dart, lib/src/fleet/fleet_metric_details_popover.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_ship_details_popover.dart"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"80205531808307e0bcd113db9ee025b70abf1f0125534599b0c5317863368647"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.path != \u0027/kcsapi/api_start2/getData\u0027 || event.apiResult != 1\u0060 appears character-identically in 2 files \u2014 lib/src/capture/game_capture_controller.dart, lib/src/game_state/game_api_event_pipeline.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/game_capture_controller.dart"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d4357ca03e3420002fa941d9828b6c2443f895a10104da1204f95dd51b24c2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.path == \u0027/kcsapi/api_port/port\u0027 \u0026\u0026 data is Map\u0060 appears character-identically in 2 files \u2014 lib/src/account/account_session.dart, lib/src/new_ship/new_ship_reminder_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/src/account/account_session.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0603e04efdf16b159f503894620c35856441099e4bb4bfcecd06567e7ce42a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.path == \u0027/kcsapi/api_port/port\u0027 || event.path == \u0027/kcsapi/api_start2/getData\u0027\u0060 appears character-identically in 2 files \u2014 lib/src/battle/battle_controller.dart, lib/src/capture/battle_result_warning_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/src/battle/battle_controller.dart"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2c15bf127134db025bc6d3815b9990bf8bf630df030fe6d003b80b2da59a93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060host == \u0027kancolle-server.com\u0027 || host.endsWith(\u0027.kancolle-server.com\u0027)\u0060 appears character-identically in 3 files \u2014 lib/src/browser/game_browser_controller.dart, lib/src/browser/game_frame_rate_policy.dart, lib/src/browser/game_load_event.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/game_browser_controller.dart"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fae51cc8a3787262cd47279ff004ff63fbc33b1292b9bdd40f942d022af24f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060id == 1101 \u0026\u0026 state == 2 \u0026\u0026 current != null \u0026\u0026 required != null \u0026\u0026 required \u003E 0 \u0026\u0026 current \u003E= required\u0060 appears character-identically in 2 files \u2014 lib/src/game_state/game_state_serializer.dart, lib/src/quest/shared_preferences_quest_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/src/game_state/game_state_serializer.dart"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb276d0946f81b3bf30a6f3f806c1f6b3390c1eb35b94a119bf24fd69266dc01"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060level == ShipDamageLevel.moderate || level == ShipDamageLevel.heavy\u0060 appears character-identically in 2 files \u2014 lib/src/fleet/ship_portrait.dart, lib/src/settings/battle_status_effect_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/src/fleet/ship_portrait.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2c5d18abf516eb0bae01656d023e20047bf3fb28e5ab5582bbb6fefef92bef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060master != null \u0026\u0026 master.type.length \u003E 2\u0060 appears character-identically in 2 files \u2014 lib/src/expedition/expedition_evaluator.dart, lib/src/logbook/logbook_event_recorder.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_evaluator.dart"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"641ce335a66156081f5742370bace8f0c702909addd038f22f91159dad44a909"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060master != null \u0026\u0026 master.type.length \u003E 3\u0060 appears character-identically in 4 files \u2014 lib/src/battle/battle_ship_details.dart, lib/src/fleet/land_base_summary_card.dart, lib/src/logbook/logbook_event_recorder.dart, lib/src/toolbox/composition_image_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/src/battle/battle_ship_details.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3ea1c3ee3b5f5774b2cb281172362301bc01bedb5feaabf0fd4a6f5c633ac2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060origin == null || (origin.scheme != \u0027http\u0027 \u0026\u0026 origin.scheme != \u0027https\u0027) || origin.host.isEmpty\u0060 appears character-identically in 2 files \u2014 lib/src/fleet/ship_portrait.dart, lib/src/fleet/slot_item_portrait.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/ship_portrait.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da893e19148f1e17eae0295848258bb16febf5d48167de88ce46d6105e06b71"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ours.count == 1 \u0026\u0026 ours.flagshipCritical\u0060 appears character-identically in 2 files \u2014 lib/src/battle/battle_rank.dart, lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_rank.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9e72693e8c74556f87cd6672f7a3ab05f8a6affab8f7fec85a2b3a02c3a3c3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ours.sunk \u003E 0 \u0026\u0026 ours.count - ours.sunk == 1\u0060 appears character-identically in 2 files \u2014 lib/src/battle/battle_rank.dart, lib/src/battle/prediction/poi/poi_battle_prediction_engine.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/battle_rank.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5531becc00c6736ec9c38d9d7672f944f51e5b3367248ebd96a20870af0e5ddf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path is! String || !path.startsWith(\u0027/kcsapi/\u0027)\u0060 appears character-identically in 2 files \u2014 lib/src/bridge/captured_api_event.dart, lib/src/capture/game_capture_port.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/bridge/captured_api_event.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"490869f65464e646a8a2787c2d8173d0984ad8071159fcfcbf097e93e96c760e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060playerHistory == null || playerHistory.isEmpty\u0060 appears character-identically in 3 files \u2014 lib/src/senka/senka_controller.dart, lib/src/senka/senka_ledger.dart, lib/src/senka/senka_state.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_controller.dart"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afc6011f11cea21ed894313e3a0c925f5eb62e23d65da8774ea3ec76fdf3d78"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response.statusCode != 200 || (response.contentLength != null \u0026\u0026 response.contentLength! \u003E maximumBytes)\u0060 appears character-identically in 2 files \u2014 lib/src/subtitles/ship_subtitle_kc3_update_service.dart, lib/src/subtitles/ship_subtitle_update_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/src/subtitles/ship_subtitle_kc3_update_service.dart"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cdc7b8990cb64a352fe08b179f642a027d946324da2e4c021afb2aeff6a239"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060savedMissionId != null \u0026\u0026 expeditionRules.containsKey(savedMissionId)\u0060 appears character-identically in 2 files \u2014 lib/src/expedition/expedition_check_card.dart, lib/src/expedition/expedition_check_page.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/expedition/expedition_check_card.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a12a218c069f0a909b77ec2b0cf2aca192a0f1206a4229e0eb533abb391fe3e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ship.maxHp \u003E 0 \u0026\u0026 ship.currentHp \u003E= ship.maxHp\u0060 appears character-identically in 2 files \u2014 lib/src/fleet/nosaki_sparkle_calculator.dart, lib/src/sortie_experience/sortie_resource_ledger.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/nosaki_sparkle_calculator.dart"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"7701c819f1ef5b43378cdb336b899c30edd4b6633765a9a13c0ce2b4b631edda"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060shipIds.isEmpty \u0026\u0026 baseShipIds.isEmpty \u0026\u0026 classIds.isEmpty \u0026\u0026 shipTypeIds.isEmpty \u0026\u0026 nationalityIds.isEmpty\u0060 appears character-identically in 2 files \u2014 tool/akashi_bonus/lib/models.dart, tool/wiki_bonus/lib/models.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/akashi_bonus/lib/models.dart"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbda12b983ae6508116d20b974b55620ea43883061525a32d97063b07dc86ad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060startedAt == null || now.isBefore(startedAt)\u0060 appears character-identically in 3 files \u2014 lib/main.dart, lib/src/fleet/anchorage_repair_view.dart, lib/src/fleet/nosaki_sparkle_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/main.dart"},"region":{"startLine":2284}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8113cfa8fd8264c5dcbd593a0a21d5ebda752cd02fe2caee083aa857b5d6fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state == AppLifecycleState.resumed || state == AppLifecycleState.inactive\u0060 appears character-identically in 2 files \u2014 lib/src/performance/second_tick_scope.dart, lib/src/settings/game_resource_cache_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/src/performance/second_tick_scope.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbd8740bc3383c1e10795bab69277bacd0a5ad36fc13f2030c3cfeb3d4b381a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state == null || state == AppLifecycleState.resumed || state == AppLifecycleState.inactive\u0060 appears character-identically in 2 files \u2014 lib/src/browser/native_game_surface_slot.dart, lib/src/settings/game_resource_cache_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/src/browser/native_game_surface_slot.dart"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33ef33b2a38e498296cebc9ce04eac6cffbc36b27fcb05e263173685ac54195"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state.memberId \u003E 0 \u0026\u0026 memberId \u003E 0 \u0026\u0026 state.memberId != memberId\u0060 appears character-identically in 2 files \u2014 lib/src/game_state/game_state_reducer.dart, lib/src/senka/senka_reducer.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_reducer.dart"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce43cfe2d4532bf8e40c9c4f3b6c397b2efaf0bb791a1ec78acfeead2d3f673f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeId \u003C= 0 || typeName == null || typeName.isEmpty\u0060 appears character-identically in 2 files \u2014 lib/src/inventory/ship_equipment_compatibility_projection.dart, lib/src/inventory/unowned_inventory_projection.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/inventory/ship_equipment_compatibility_projection.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8daf39b2eaa888695a9c5f96d8aaef213b1a174d67f796ff26286bfdb4a138bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value == null || value is String || value is num || value is bool\u0060 appears character-identically in 2 files \u2014 lib/src/capture/game_capture_port.dart, lib/src/kcwiki_report/kcwiki_report_collector.dart. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/game_capture_port.dart"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"5830da453911dcc10847ac993b8f333d32010108f5eec166cd49cadf0d71ac0d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.PLAYWRIGHT_MODULE || \u0027playwright\u0027\u0060 appears character-identically in 2 files \u2014 tool/ship_subtitle_browser_benchmark.cjs, tool/test_ooi_viewport_browser_smoke.cjs. 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/ship_subtitle_browser_benchmark.cjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9aaeb815656108bf9995ee01ebee2c02453336134fd8a25ed6960f052cc9737"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!workspace.isDirectory \u0026\u0026 !workspace.mkdirs()\u0060 appears character-identically in 2 files \u2014 android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibrary.kt, android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibraryCoordinator.kt. 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibrary.kt"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ce3cabd7896d9f6d3695a93223173be5c47e08b00d619ce133e705600b5a20"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060WebViewFeature.isFeatureSupported(WebViewFeature.DOCUMENT_START_SCRIPT) \u0026\u0026 WebViewFeature.isFeatureSupported(WebViewFeature.WEB_MESSAGE_LIST\u2026\u0060 appears character-identically in 3 files \u2014 android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFrameRateBridge.kt, android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFrameReloadBridge.kt, android/app/src/main/kotlin/app/yahagi/kancollebrowser/subtitles/ShipSubtitleBridge.kt. 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFrameRateBridge.kt"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dad0cc580c7933eb3e19cf1e82c3c707c7f6558d470ed0ec8dfe1cf8f9af96b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060decoded == \u0022.\u0022 || decoded == \u0022..\u0022 || decoded.contains(\u0027/\u0027) || decoded.contains(\u0027\\\\\u0027)\u0060 appears character-identically in 2 files \u2014 android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GadgetBypassRules.kt, android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheRules.kt. 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GadgetBypassRules.kt"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"0253605cb8bdff76ee92cdf2353e35cc1f6f3745aa79261af7a2957594a62c8e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it is String \u0026\u0026 it.isNotBlank() \u0026\u0026 it.length \u003C= 4096\u0060 appears character-identically in 2 files \u2014 android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameDialogPresentation.kt, android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWarningDialogState.kt. 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameDialogPresentation.kt"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0aef4ba159a8736828f3fbd6da33bfefe69674e12532f247efde678c7c9402"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.key == key \u0026\u0026 it.taskId == taskId \u0026\u0026 it.stage == stage \u0026\u0026 it.triggerTimeEpochMs == triggerTimeEpochMs\u0060 appears character-identically in 2 files \u2014 android/app/src/main/kotlin/app/yahagi/kancollebrowser/notification/NotificationAlarmReceiver.kt, android/app/src/main/kotlin/app/yahagi/kancollebrowser/notification/NotificationSnapshot.kt. 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/notification/NotificationAlarmReceiver.kt"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c7cd1526de00c6afbd44a6323ee7f60d2fe1ac7d647e09b997c2f9f87a78ba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060method != null \u0026\u0026 !method.equals(\u0022GET\u0022, ignoreCase = true)\u0060 appears character-identically in 2 files \u2014 android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GadgetBypassRules.kt, android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheRules.kt. 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GadgetBypassRules.kt"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad71a2bab56f3a1eb76189056e8e51b81abaa0e9bd907c766fdcba6863809787"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.endsWith(\u0022.yhb\u0022) \u0026\u0026 name.length \u003C 180 \u0026\u0026 !name.contains(\u0027/\u0027) \u0026\u0026 !name.contains(\u0027\\\\\u0027)\u0060 appears character-identically in 2 files \u2014 android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/BackupShareCache.kt, android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/PendingBackupExportStore.kt. 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/backup/BackupShareCache.kt"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f371b7f4b596bb89873530271c279a12d92f393f87d1a0172e17d496a99bed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.length \u003E 128 || value.length \u003E 8_192\u0060 appears character-identically in 2 files \u2014 android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheEngine.kt, android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheRules.kt. 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheEngine.kt"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0727da340ae3ca5aca8ea643c83af0ecf02f83e2759bd561ac56b3016eeb909"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060offset \u003C 0 || length \u003C 0 || offset \u003E bytes.size - length\u0060 appears character-identically in 2 files \u2014 android/app/src/main/kotlin/app/yahagi/kancollebrowser/fonts/CustomFontPreviewRequest.kt, android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModRepository.kt. 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/fonts/CustomFontPreviewRequest.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13fa15abfdc1bc56a69a0c3dd24800b89a0340c28be41a6d1af843fda687bb9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060right - left != oldRight - oldLeft || bottom - top != oldBottom - oldTop\u0060 appears character-identically in 2 files \u2014 android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt, android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFullscreenChannel.kt. 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42b5f42b9f3d3bb93ddbc461a8e4ba514e1de32724723a9ec659c83d5402e3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeface == null || typeface === Typeface.DEFAULT\u0060 appears character-identically in 2 files \u2014 android/app/src/main/kotlin/app/yahagi/kancollebrowser/fonts/CustomFontManager.kt, android/app/src/main/kotlin/app/yahagi/kancollebrowser/fonts/CustomFontPreviewRenderer.kt. 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":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/fonts/CustomFontManager.kt"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fcade7b72354b043b999777d98ed12d1e0ee3ca5a7abea834c70072ce6afeb"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060validateField\u0060 is public, takes a document from its caller (line 95) and hands it to \u0060_validateValue\u0060, which calls itself at line 210 (\u0060_validateValue\u0060) with a piece of \u0060value\u0060 \u2014 and nowhere in \u0060_validateValue\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. \u0060jsonDecode\u0060 sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws \u0060StackOverflowError\u0060 from about 20,000 levels \u2014 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser\u0027s stack). That is an \u0060Error\u0060, not an \u0060Exception\u0060: an \u0060on Exception catch\u0060 around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through \u0060_validateValue\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/diagnostics/diagnostic_privacy_policy.dart"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a22c266bb1ab48f41cd0d3b744588c2a40b9ff8bf89c2b716b65e417b537562"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060clonePoiBattleMap\u0060 is public, takes a document from its caller (line 14) and hands it to \u0060_clonePoiBattleValue\u0060, which calls itself at line 21 (\u0060_clonePoiBattleValue\u0060) with a piece of \u0060value\u0060 (and at line 25) \u2014 and nowhere in \u0060_clonePoiBattleValue\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. \u0060jsonDecode\u0060 sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws \u0060StackOverflowError\u0060 from about 20,000 levels \u2014 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser\u0027s stack). That is an \u0060Error\u0060, not an \u0060Exception\u0060: an \u0060on Exception catch\u0060 around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through \u0060_clonePoiBattleValue\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/prediction/poi/poi_battle_replay_state.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc95709c53ae2cdf3ac4574b6010e3a5bc3176bf3e0e2f4530360e6e055c391"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/akashi_bonus/lib/fetcher.dart"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b707349141b66a31aec85cfb4d82db652be6716869c87417f5e69eea6fa06b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/main.dart"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9c723c3d45b1fa171f347b21d67f3cfd361656aeee2df98bd0ddaf59587840"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/composition_image_page.dart"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7b688c6db2b97225695bfac913b564aa352b58ac52d354656625f8166cf669"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/fleet_export_page.dart"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"af09f17c7ec9f9e93127bb06c00992f8e4cca5f8881f8f48a84834cb0a1d3e4a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/enemy_catalog_store.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4040a9e36ef8921400bcea46df6bc6ec1b22b5d0ccc694cdf952887c66879253"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/sortie_map_catalog_store.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2f49385e28e9acd82fa1079e6a14317521557656ba7b5e917e98a2f92d263f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/sortie_map_catalog_store.dart"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"271c73df325de095566b8d3afd8d80ccfdcab3198a5c49931819430e78b5963c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/sortie_map_query/sortie_map_selection_store.dart"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce4c4109508c88b62bb843fd200ac6d927ae81355f473a9eda5bd446a8c99ea"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_controller.dart"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca17c3924456203caec42a4f3b0b850335257ae661daa86c0a71b51c7a1c5045"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_controller.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"871688c662f86c01516cc85dcfda3658a388ba924ba1a913c09ec7dda875c209"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_controller.dart"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"62760d82693d8c2facfdef1c54ba28211f90a4f35549794c0849161573a1d49d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/game_mods/game_mods_controller.dart"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dabb281079fb8f584e37d164596f57a61e830426377f88c4ae6f36fb0c6309a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/toolbox/exp_calc/exp_calc_page.dart"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8c62094c45b77964097fc7964fd7805984de7dea1f2787134d5c16f4c1c11f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/theme/custom_font_controller.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"556efd8bc40e20972dd14cf6bb369276f8896913eb8c23e535fd1160c561662b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/theme/custom_font_store.dart"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"48666a2b51d008dcf129d719a454c2f0cd314f86f0fef1208ab9825c2cdb3db1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/telemetry/telemetry_service.dart"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdc5dbe4bbe04207803a0039b18a6a4851c02c218db1cb8030ba20c0478a625"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/telemetry/telemetry_service.dart"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b99db5d560932f5d4ff6c28dcfe96a8a2ef12d3ce9021f7da5bfb58e6d3948"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/telemetry/telemetry_service.dart"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ab5d6092501c9ff7aa1f007ce62e100235ad243a5b33b2e5d71abdb55250f4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/telemetry/telemetry_service.dart"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"9702b852145c05ca131334d2b2ab84c40daf2bf42dbde9685efd244dfd8ad5b2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_catalog_store.dart"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef9ba4bea2015f2acc8e51ec3ca289cbdbfaad8d1b1257946835c1080557aeb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_catalog_store.dart"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f46566814c446b112bc5b96db27c7d087dd4118a1c60277c7a2ca5d3d3b64f8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_kc3_store.dart"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2af1b29573a0ad202abc83e66e97faf2a45685154ec0ff8340db52960c0eae4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_kc3_store.dart"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa969842a93123bf01398e5039d624b3b1dfe567f6efb23737c43be1d21db7db"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/subtitles/ship_subtitle_settings.dart"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf5eac8667c9979321346b3bed8b41bc28a8e67ea0aa5e3d3397bd5acc5a0e5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/about_dialog.dart"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80eaaa81fb3ba45e53cad6695a6aea30b8d5bc28e7661d9c4557ac3495cdbf6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/app_exit_settings.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"601489555e14d5ff74acae6bf9f8d54a85ea4ab6012a96216cb0af95e6a55e28"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/battle_prediction_settings.dart"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f338d4d60e562085671940c5930a6852885b704bb04f46c27b2f6c37653285d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/game_connector_controller.dart"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bb2481cc97b12b4a892cf0c68b837a1243c68200d5ab701d98e34fda394471"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/game_frame_rate_settings.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"788500f4893ed47cdee410e92b179c8d94f017d728e30627910328bf9265da30"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/game_frame_rate_settings.dart"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"16033643a7e9e0515e931baa63a8232ed54c85f652f9d8e533d67cca59995c03"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/game_frame_refresh_shortcut_settings.dart"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b6f2714230807deb2bfa9f35262df8bfc129e4ab495bb1d28d1de6bb4a82ab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/game_mouse_wheel_settings.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12b071146cdc49e971f2d0d2cf961e06049c7287543a8a1d1ec23630e91223b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/layout_settings_store.dart"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a59bd88fc1456a56bc42c783797e96ae7664df8b67ede29268b8786390f7c0e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/layout_settings_store.dart"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"18278eaf823cb58d0efba077a5027165dbfba1d3d319cb36c38067af1d908850"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/layout_settings_store.dart"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc9712173ca5b3c24a537220e31d6acb3325444db07235dc56d6bfd94ff2742"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/layout_settings_store.dart"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc292ddc3cb1379c9fe7e3794c51f3a3bc85976c24653d687e6382fe1e4a8a1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/screen_awake_controller.dart"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0e8ce3684e56fff34daa68a8fc8abaabbd04cbf7cc972942f9e11a1dea8e07"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/settings/screen_awake_controller.dart"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac5312406a9789fd02ea69c1d9a925ee2cd6b95b5324a615a41a43fbfc45d88"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/senka/senka_store.dart"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cb6130e12eefa246dc854dd6c6fa4ff34191fc302c4443873ee9bad85c9f09"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_catalog_store.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4387dc53ae9906c52c69ed5cdd86357d8a9a0e131dbec6492f8d0648570191"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_catalog_store.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"699f8af951337db277fd3cb6df78f4bcd79dd0f452ebe237d868fbf0b28dd113"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/quest_completion_drawer.dart"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f3056cd8a27b78b40ffd79877183776ffa545b2067d30b9dd2ba9eb137406b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/quest/shared_preferences_quest_store.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd5f8cb45985d38bbd75eabd0431b7595077d8f049ef39e7c7186987af2ead8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/notification/notification_timer_anchor_store.dart"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"6afecd226bfa08b12266e76bc175ceb6b4bf3574067d4cbe0cf5446043a01b35"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/logbook/logbook_page.dart"},"region":{"startLine":1937}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14aa371e636356f3fdfb0a2388bb78a1951092b7d553712c927c721dabbb6aa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/improvement/improvement_dataset_store.dart"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1cbc6a5e16dc51f4a9335a916e35ac5195a7c79ba614b070a1ef3d27266919"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_controller.dart"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"785dd88a93f15dc23be5d123af701537b096617a855409b3be9d911e1d7d2088"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_controller.dart"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"8156e503758baedf5007dd4f76f48aeec30b47721038b74c3278be6756ef7c0f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_controller.dart"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae759b8acc1a7df29a6f52e8333b239ffdac8e2c6e3b657b176b5c2f4bb4adf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_serializer.dart"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"5839193ea366c1dd9f3ec745d96ea0ffdea1aa9bfa0da2ab38699a2f6c090558"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/game_state/game_state_store.dart"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"029166baff05261ff1dd145da25a740ca96abcac197de6a3b90d0e39f6e11d81"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/game_mod_portraits.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa8de2d3169db1b7bd6a50aef996212487bc90030bcb2f33d33c90128a35644"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/game_mod_portraits.dart"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aae63250a278601adf0deddd257b71f666a5edcc7f82eb708309fa5f79f3dde"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/game_mod_portraits.dart"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e6d1b760c06b6b54f1936ee5542592ba8f5819a3f947e9842f02fc5a7c47ab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/game_mod_portraits.dart"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc52bbdd0c56d9e658d44215a78d88b048a7bd1e3e6a176b3cc2d405543b42b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/ship_portrait_cache.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"686a7f1850e38a02d5b0c99b2308c5ff661a2afbefa88edb44d068a52a783f2d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/ship_portrait_cache.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7913188fa0b3b4c57f58b44e77109afe3b72f618c7b2687b89370d3aba031dbe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/fleet/ship_portrait_cache.dart"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"3559593b87e37d99ffe09c5d55810d42cadf612dc4fea7ff7a00fb9e45b45d2e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/development/development_workbench_state_store.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5fef2eff6ce98434f7156df49fda611fff9ae9a229c9427c418905f43d8d84"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/battle_result_warning_overlay.dart"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9b8864aa738ecceff5e328de9adc4b5bef6a88a0aa08b2a9cefcb635d088f8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/capture/battle_result_warning_overlay.dart"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7240febea653a372cae802b6f0d997a55a2ba9f310fcbf18493a8840fcba0f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/gadget_bypass_channel.dart"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec714a173d9ed043733af23715784e7b57fac7dad1e66656710992cc6ed79c8f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/gadget_bypass_channel.dart"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd5212b2e69071231f63567edc68ce800fd118cf6182763aa6fda10029dcc2e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/game_frame_refresh_shortcut_action.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb989bc59e6e830278b9d51b33b373f270cfc17cdeb516e844e72a9f52ba0101"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/game_fullscreen_exit_dialog.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b270dd9d14434cd01c15a0b2a9f662df665852a354787109d8869fd89e1dfba1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/browser/network_proxy_channel.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc985665682100936508db4845350d4f56fe1dc158fe7b73ce3006195e441d4b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/battle/fcd_map_store.dart"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"00dfa76b948d7b010e78cfd7ae59eed05fcf338c33c4445ecf1cf66220f507a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/backup/record_backup.dart"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2872ea6484a50887680fb573183b704a450942aedfdd0912a2e72981ad147b0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/backup/record_backup.dart"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"983a8e9cb20b93542d89c58dcc5e17013b86ad8897652b8e7f09955813f60960"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/backup/record_backup.dart"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16a84b190e48eb3609c000ad329e6d94ccde3e596e00a196232f26036dd992c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/audio/game_audio_controller.dart"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f867b689777edbfcd35537434dc9ea1f599b2b713d702776724b3c514e74ead"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/audio/game_audio_controller.dart"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"040cab574922baaef00d2ca87c87c99dae669a3ed97238244a82da7af1d023dd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/audio/game_audio_controller.dart"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5324976d87b18a660bf086e98d5f45092c98a9cd5778ff269656d42d7e998724"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/scripts/ship_subtitles.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"5636ce5141650828fe9e0ff244de110484aefa0112e8f07e1d8939a553806592"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/scripts/ship_subtitles.js"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc08370a010bd6d0e40df0f8632bdb521d43a4a74e3f66bd76d81d87e38652db"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/scripts/ship_subtitles.js"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2e54535acd43fb6b853a46e4471ba6d4265b92f5201ece855ec9f2b8e4d319"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/scripts/ship_subtitles.js"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5b4c44a571dff4133272f92eeb202f0d46d0b6ab987f20f93faeba291a154c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assets/scripts/ship_subtitles.js"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"d677f170c1ffc44ceb3bbeb184a66707327082ab95ccf80f3c47b09856765aba"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/MainActivity.kt"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"018329fe9c9fd6909f09b43e4c2b3f35ba72b40eb114117cdf46ea4f2fe7320a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/subtitles/ShipSubtitleBridge.kt"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96b9cc2efc92a026a332187671bd97c23fccc7da1aa355e1f208927ff7dca25"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/subtitles/ShipSubtitlePolicy.kt"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e08977dfad7382e3280977ac531d4208355aa22021e1fc1a42b46bb2cc2990"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWebViewChannel.kt"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2ddddbb1bbbf1d01392f1c552a1eec1910cbbc178478184bf31faaa30c463d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWebViewChannel.kt"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"d720db62b9eae54b06367d2690fd10a105ddca4187ce4a9fbdea2f5387c3d5cb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeGameWebViewChannel.kt"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc0944b86244ba4f669aadb02b43d93340537c9e6538c735d7044d900380d41"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeWebViewStartupGuard.kt"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d68762197d0b2d8864e3652e943a18dda15cbb5b95a7520fbe29f3bc94b908"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/nativewebview/NativeWebViewStartupGuard.kt"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2084be07190aa6732092a6d6689d3fa7fecd35248c80cfe62b2436affa7874f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibrary.kt"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"666f5e6748ab57498765e1918c90580d20d5f18dea1543e5745a10c917939857"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibrary.kt"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f2e2ac66ce04432a2849f53fe42e91f29d260cdc79a9702e6c547822c75ff9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibraryCoordinator.kt"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d93536444cddc12f3bae050333da33d5f6c38b5db02952a16877cabc5bd3fd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibraryDocuments.kt"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2df120152a0d05215032ecac9958039481a12ba5cf033ab8806313a0526985d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModLibraryDocuments.kt"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"007b3d7b2dbd3979ef25ac128b4cece7d0ae0a6f566bb468cd7dc4e16d0b54f9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModManager.kt"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ac3d9b6f8a3b5c22068ebbb39e1fb0ff5cf6573b6034e063615731338331b0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModRepository.kt"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5639e25790be0c57384c070133818916ea12f27f7779f4571c5ced64b00941a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModRepository.kt"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7844e67476b77aab2cfa6837d08f577de6946596fb44dd6276fe802f34753d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/mods/GameModRepository.kt"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52ff99245959afac24694ede1336bb59c68cd780d6c8f07c98829ff7c116b4d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/capture/CaptureMessageValidator.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b84f73eb21542378475a0f1fc35cada30c530b374b837b5edb29f0de5855516"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/capture/CaptureMessageValidator.kt"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf89aa0484b35f7f82b686bcfa46122a435195d15346f5b3cc94e1707b61403"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/capture/CaptureMessageValidator.kt"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66d0cb35255d12a707ac85e1e534c082dd94b001670b0cc3a477d331c33221c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/capture/CaptureMessageValidator.kt"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf29d4947c7f9a9104599798890d39d9be3d43aa3a8310154fde1c194546836"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/capture/CaptureMessageValidator.kt"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f3c20671af16e5c0606e69098379c084e2e243ea84521a1da8e3612ee4c2bd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/capture/CaptureOriginPolicy.kt"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"916aa50c46bf4c5779eb60405ed85381eaf0ca66d0d8e7419bbc156f3c8e90ae"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: RuntimeException)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/capture/OrderedCaptureEventDispatcher.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d5105d9ea67718d44869696517f3ed63d284bf90788604b63710b557c48ba4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: RuntimeException)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/FixedCanvasFitRequests.kt"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"83416442297c412cf97dcdddbb541899e1fc4604bee8527b0d2b9759a7a7540b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GadgetBypassRules.kt"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed9b0e305e97f196baae71e3b36e6d4b887eedcf27822ef9fe60ce587d6ba5a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GadgetBypassRules.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4720c8515915de4613993fbea06509f2cb7141dfd74c275fd76980445cb81387"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GadgetBypassRules.kt"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfd9e88cfc7aaa21518276c4aa4c8bb16304a73b194d5622d21bc6710d467d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFrameRateBridge.kt"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2101e3bb602c1ae9fb4715255714cdc39dfb4f32f83eea89f13a7af76b106ea"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFrameReloadBridge.kt"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c43aaac90a5c724353ee2ac09e2e39a8848faf69e24b704a4b8ba244a0fd2c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameFullscreenChannel.kt"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"184e61d6a1c36c729d7e10890db55f4a9747b8e60372fdd7d390c7d012040d7f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameModApplyCoordinator.kt"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"809bddea27a210ee0e4880fc2fc3b56a0eaefbd5f2b8b339cf5400a44c194ef3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheKey.kt"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5861a540e24eb94e1a9d16ab0fa3c6ca1188ee147850c6cfd91191bb230716ab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheRules.kt"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8f2294eacbd7e82bf31d01b89e7f7d9826e8d93da279b9ab47bda93f65bab3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceCacheRules.kt"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a33b7539d5577ccb10080ceae9910064aae6611bd84ab6ba822ccc7a48a9db"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/GameResourceFetcher.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ae57e0b06ad5eef50ad7cfefc4d56657095068f0e032191801becba7eb8a5b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/OriginCookieManagerChannel.kt"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"688afe7162ef80a754e5190b2b1475c2671f89e69808f28bb0ac0dda50b69792"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_: Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/kotlin/app/yahagi/kancollebrowser/browser/WebViewProxyManager.kt"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"576750723c33be2a2f3bca974131904a8734cc44255316ac2a22b9ac13ad9528"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Dart code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/wiki_bonus/lib/table_expander.dart"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab5381c57509bfee7ce5b7e350b49e747d1e7caef47d12a62749af67cddd730"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060valid_empty_fixture\u0060 returns \u0060False\u0060 when \u0060(ValueError, TypeError, KeyError, OSError, EOFError, zlib.error)\u0060 is raised, with no log or raise \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 on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/check_repository_hygiene.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85459e6b26a7f65ee72423c3efaf1c55dccf706f9c3ec45c1b0590e9b83bb1d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060load\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/src/battle/formation_memory.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1f81af89257ed516abf2a058c7062fc68d0ebcc5c65740a7713dd0e17c2a48"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060loadExcludedFamilyIds\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/src/new_ship/new_ship_reminder_store.dart"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4d12722d4ec532b2c3b5c53ae334a52d9afb288dff041178e988710f5f0e3e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060loadPending\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/src/new_ship/new_ship_reminder_store.dart"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"d303a62bb2a523e281338bbdbaafcce4e4731e1ff88b6f6906db103c1f488250"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadQuests\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/src/quest/shared_preferences_quest_store.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a1c1729492c08a7b29bc374b2281b15938487130e194d53e25015b24983068"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_renderingModeName\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/src/telemetry/telemetry_service.dart"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88dce839e25609b28593ea07512379b1d43eaf07b9663ad532e1eb76214ea35"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.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-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.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-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-838","guid":"8dc8ab04-02fb-3d5d-b809-329987c5504a","name":"CWE-838","shortDescription":{"text":"CWE-838"},"helpUri":"https://cwe.mitre.org/data/definitions/838.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":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"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":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-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":20,"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."]}]}