{"$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":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX1","name":"Captive dependencies","shortDescription":{"text":"Captive dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/AX1"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"DM4","name":"Rich vs anemic domain model","shortDescription":{"text":"Rich vs anemic domain model"},"helpUri":"https://codehealth.canine.dev/dimensions/DM4"},{"id":"DM5","name":"Encapsulated state","shortDescription":{"text":"Encapsulated state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM5"},{"id":"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":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"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":"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":"KonfHubLayoutParser.parseTicketFromBlocks (cyclomatic 124): KonfHubLayoutParser.parseTicketFromBlocks has cyclomatic complexity 124 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named 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/features/events/application/parsers/konfhub_layout_parser.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7e73304ba5cfaf8093e9c91fc5cf7298471ad3efc9ff314ac5c42b5b61e6e1"}},{"ruleId":"D1","level":"warning","message":{"text":"Ticket.fromTNSTC (cyclomatic 78): Ticket.fromTNSTC has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named 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/common/domain/models/ticket.dart"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed542b237c874c180f0704849db1c939b6f80620edcf08d1c8fbf0f199aea60"}},{"ruleId":"D1","level":"warning","message":{"text":"TNSTCLayoutParser._extractPassengers (cyclomatic 65): TNSTCLayoutParser._extractPassengers has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named 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/features/tnstc/application/tnstc_layout_parser.dart"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5131e6defe76a0bb0bda0a25f402404740878481366c7fbc8f25fb28fb9d7c7"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutExtractor.findValueForKey (cyclomatic 51): LayoutExtractor.findValueForKey has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named 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/common/services/ocr/layout_extractor.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"413a5df5948619b363bfd90f42db4061874e9ad83f2e955ae8ec97e004b8f48a"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfium_worker._shuffleInPlaceAccordingToIndices (cyclomatic 39): pdfium_worker._shuffleInPlaceAccordingToIndices has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/assets/packages/pdfrx/assets/pdfium_worker.js"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9dd72f657b138f1fdf6020dc780f26953fd0f349777656b9ea53941b6b6f027"}},{"ruleId":"D1","level":"warning","message":{"text":"IRCTCSMSParser.parseTicket (cyclomatic 35): IRCTCSMSParser.parseTicket 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/features/irctc/application/irctc_sms_parser.dart"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f87179826c297dce31365e475d91e435e68397675fb9af1c62e8e66e0e098c1"}},{"ruleId":"D1","level":"warning","message":{"text":"_TravelTicketViewState.build (cyclomatic 34): _TravelTicketViewState.build 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/features/travel/presentation/travel_ticket_view.dart"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf98286e8f99270ddc1639c1f344e1e55b2eea775c026914762ee13e0191ff74"}},{"ruleId":"D1","level":"warning","message":{"text":"SharedContentProcessor.processContent (cyclomatic 30): SharedContentProcessor.processContent 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/features/receive/application/shared_content_processor.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e018f446c7fee8557f082ded04a7a63d76ff55f1f098c20802ddf3ab545297a"}},{"ruleId":"D1","level":"warning","message":{"text":"NotificationService.scheduleTicketReminderFor (cyclomatic 28): NotificationService.scheduleTicketReminderFor 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/common/services/push_notification/notification_service.dart"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dafe1e9f2c32a2aaa0347e80c5188d8600cdd7712ac726f0313fa4727b06d0"}},{"ruleId":"D1","level":"warning","message":{"text":"DistrictMovieParser._extractMovieName (cyclomatic 28): DistrictMovieParser._extractMovieName 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/features/events/application/parsers/district_layout_parser.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d55ee7704c78590afe63f05cf8d562ddf35b79028b90230d4a8b3e4663f8c9"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutExtractor._extractValueFromCandidates (cyclomatic 25): LayoutExtractor._extractValueFromCandidates 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/common/services/ocr/layout_extractor.dart"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3969d9960616bd594cf9a2c0e229d1f1a4b5a1a5b73dbc0a86bda4d981834a"}},{"ruleId":"D1","level":"warning","message":{"text":"IRCTCLayoutParser.normalizeClass (cyclomatic 24): IRCTCLayoutParser.normalizeClass has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/irctc/application/irctc_layout_parser.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"2312c8e24ee23a10f5cb6a7cb51c3d2a4264cede01002b657358b67dba1c7a25"}},{"ruleId":"D1","level":"warning","message":{"text":"IRCTCLayoutParser.parseTicketFromBlocks (cyclomatic 23): IRCTCLayoutParser.parseTicketFromBlocks 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/features/irctc/application/irctc_layout_parser.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d01e1ffa5f3e7fc6426268aa281891f60855ba74dfc4525cfd55973cc64ff3"}},{"ruleId":"D1","level":"warning","message":{"text":"Ticket.fromIRCTC (cyclomatic 18): Ticket.fromIRCTC 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/common/domain/models/ticket.dart"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabea6c94b2770ee03070c938416026ee49542ff91f90a37ed4f416adda4bcc6"}},{"ruleId":"D1","level":"warning","message":{"text":"KonfHubLayoutParser._parseBookingDate (cyclomatic 18): KonfHubLayoutParser._parseBookingDate 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/features/events/application/parsers/konfhub_layout_parser.dart"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dd7e01702c5d392a63660c7a3bc7b6b2880b1b3bfb107b4833d02c860ffea9"}},{"ruleId":"D1","level":"warning","message":{"text":"compress.compress_file (cyclomatic 18): compress.compress_file 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":".agents/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"3499851de5f30e2d1001085139ebfae7bd7676b6e7da1fc14f914eb1324805c5"}},{"ruleId":"D1","level":"warning","message":{"text":"SharingIntentService._handleSharedContent (cyclomatic 17): SharingIntentService._handleSharedContent 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/features/receive/application/sharing_intent_service.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fb8b57fd78ebf60ac8719478895d743f3ec956dff7ff9509242de05a9de961"}},{"ruleId":"D1","level":"warning","message":{"text":"_ImportViewState._handlePDFPick (cyclomatic 16): _ImportViewState._handlePDFPick 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/features/import/presentation/import_view.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c9e4c37420879f34754e86d89d8f0f9ac94940b49ccad571d1eb93520fe49b"}},{"ruleId":"D1","level":"warning","message":{"text":"TNSTCPNRFetcher._parseHtmlResponse (cyclomatic 16): TNSTCPNRFetcher._parseHtmlResponse 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/features/tnstc/data/remote/tnstc_pnr_fetcher.dart"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbf5858d236a752e748ecffa10747fa3d14ba1db0417733d709ee78433d29f1"}},{"ruleId":"D2","level":"warning","message":{"text":"KonfHubLayoutParser.parseTicketFromBlocks (cognitive 201): KonfHubLayoutParser.parseTicketFromBlocks has cognitive complexity 201 (threshold 15). Drivers by points: if/else 54 (124 pts), boolean chains 64, ternaries 3 (7 pts), loops 3 (6 pts) (nesting depth added 77). 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/features/events/application/parsers/konfhub_layout_parser.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c4d8e1923dc3126eb1ebcd7e0992f272ceb10c3602b77eeca7cb677586d299"}},{"ruleId":"D2","level":"warning","message":{"text":"TNSTCLayoutParser._extractPassengers (cognitive 117): TNSTCLayoutParser._extractPassengers has cognitive complexity 117 (threshold 15). Drivers by points: if/else 25 (48 pts), ternaries 9 (29 pts), boolean chains 20, loops 8 (16 pts), match/switch 1 (4 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/tnstc/application/tnstc_layout_parser.dart"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c86cb4d8f34d99f78e2bb1985ce702455c0c807b4d039301411fdce96ddd2a7"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfium_worker._shuffleInPlaceAccordingToIndices (cognitive 117): pdfium_worker._shuffleInPlaceAccordingToIndices has cognitive complexity 117 (threshold 15). Drivers by points: if/else 24 (77 pts), loops 11 (35 pts), boolean chains 5 (nesting depth added 77). 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":"web/assets/packages/pdfrx/assets/pdfium_worker.js"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa85c9f29b5c38738517cec79f673e240203b450b0dfb066c5730707f2ea570"}},{"ruleId":"D2","level":"warning","message":{"text":"Ticket.fromTNSTC (cognitive 109): Ticket.fromTNSTC has cognitive complexity 109 (threshold 15). Drivers by points: if/else 39 (61 pts), boolean chains 29, ternaries 8 (15 pts), error handling 2 (4 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/common/domain/models/ticket.dart"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90c889b442b4f7a3c9827294860a64298b6c2e1d2d6a335c8927aa11fb012f3"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutExtractor.findValueForKey (cognitive 103): LayoutExtractor.findValueForKey has cognitive complexity 103 (threshold 15). Drivers by points: if/else 25 (65 pts), boolean chains 19, ternaries 4 (10 pts), loops 2 (9 pts) (nesting depth added 53). 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/common/services/ocr/layout_extractor.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"585eb3b5171cef7d463346e4fdd389b7969fcb2107b1282094628e2706ae17a3"}},{"ruleId":"D2","level":"warning","message":{"text":"NotificationService.scheduleTicketReminderFor (cognitive 76): NotificationService.scheduleTicketReminderFor has cognitive complexity 76 (threshold 15). Drivers by points: if/else 20 (50 pts), error handling 4 (12 pts), ternaries 2 (6 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 44). 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/common/services/push_notification/notification_service.dart"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccdcdb8b98fc2b4bd38a7f4392d6e85828107afb66fcbaeb5a0ca394d4e4cd4"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedContentProcessor.processContent (cognitive 66): SharedContentProcessor.processContent has cognitive complexity 66 (threshold 15). Drivers by points: if/else 18 (43 pts), ternaries 5 (15 pts), boolean chains 7, error handling 1 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/receive/application/shared_content_processor.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"232f06500920eb9cfbc57e677c8ee9193672a21caffd7d3fd59553d2cc11c780"}},{"ruleId":"D2","level":"warning","message":{"text":"_TravelTicketViewState.build (cognitive 51): _TravelTicketViewState.build has cognitive complexity 51 (threshold 15). Drivers by points: if/else 19 (29 pts), ternaries 9 (13 pts), boolean chains 6, error handling 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/travel/presentation/travel_ticket_view.dart"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"161bfaead148f8889093ab8d7b49cfa7fad93523e0bbc0433a7341b342cdedaa"}},{"ruleId":"D2","level":"warning","message":{"text":"IRCTCSMSParser.parseTicket (cognitive 50): IRCTCSMSParser.parseTicket has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 8, ternaries 3 (6 pts), error handling 2 (3 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/irctc/application/irctc_sms_parser.dart"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"855c31308765db87ddee9cac29c74c0c95f8e53350d5fb69849146cb6b2378f3"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutExtractor._extractValueFromCandidates (cognitive 42): LayoutExtractor._extractValueFromCandidates has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (27 pts), boolean chains 13, loops 1, ternaries 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/common/services/ocr/layout_extractor.dart"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab18ddf7fcf5496650cfd43bdef63237c11cbb440ca85b346a8abb5ee772a22"}},{"ruleId":"D2","level":"warning","message":{"text":"_ImportViewState._handlePDFPick (cognitive 41): _ImportViewState._handlePDFPick has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (31 pts), error handling 2 (5 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 24). 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/features/import/presentation/import_view.dart"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee39675217722bdff2b1082bc8e61557cb984fce843f257e13ca0a6a926b9cda"}},{"ruleId":"D2","level":"warning","message":{"text":"SharingIntentService._handleSharedContent (cognitive 41): SharingIntentService._handleSharedContent has cognitive complexity 41 (threshold 15). Drivers by points: if/else 6 (19 pts), ternaries 3 (12 pts), boolean chains 4, error handling 2 (4 pts), loops 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/receive/application/sharing_intent_service.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c1db0266f902b6c11cc830c8bed694a710e10fa00ad034d960637d07240939"}},{"ruleId":"D2","level":"warning","message":{"text":"GoogleMLKitOCR.extractBlocksFromPDF (cognitive 39): GoogleMLKitOCR.extractBlocksFromPDF has cognitive complexity 39 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 3 (11 pts), error handling 3 (9 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/common/services/ocr/google_mlkit_ocr.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"742b514083d40785f140c7789cb073a4c129508e3f50d0c035ed2777373c86b7"}},{"ruleId":"D2","level":"warning","message":{"text":"DistrictMovieParser._extractMovieName (cognitive 36): DistrictMovieParser._extractMovieName has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 10, loops 3, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/events/application/parsers/district_layout_parser.dart"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf646648e4deeae5a6a6450067bb4989a824b765b8851347dd41f48a244bea2"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFService.extractTextForDisplay (cognitive 31): PDFService.extractTextForDisplay has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (21 pts), error handling 2 (5 pts), loops 1 (4 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/common/services/pdf/pdf_service.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb0d64f9b2a7af9f122144e116dda529dbd506ff94157354e003d290d444230"}},{"ruleId":"D2","level":"warning","message":{"text":"NotificationService.cancelAllRemindersForTicket (cognitive 31): NotificationService.cancelAllRemindersForTicket has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (19 pts), error handling 4 (9 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/common/services/push_notification/notification_service.dart"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8d61f5b48a29f2b76614bd027c7a1854e426207fdbefff007d8c289899c856"}},{"ruleId":"D2","level":"warning","message":{"text":"IRCTCLayoutParser.parseTicketFromBlocks (cognitive 30): IRCTCLayoutParser.parseTicketFromBlocks has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 7, loops 1 (2 pts), 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/features/irctc/application/irctc_layout_parser.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fdc626a8df96f3f2853e17ce46ef248326d7a9d72b45acccb86cc0f24382d3"}},{"ruleId":"D2","level":"warning","message":{"text":"TNSTCPNRFetcher.fetchTicketByPNR (cognitive 27): TNSTCPNRFetcher.fetchTicketByPNR has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), error handling 3 (7 pts), ternaries 1 (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/features/tnstc/data/remote/tnstc_pnr_fetcher.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4231a1836e06d5c2877607325b77b85b1101de2002d55140d1da4534921e6eeb"}},{"ruleId":"D2","level":"warning","message":{"text":"_HomeViewState.build (cognitive 25): _HomeViewState.build has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (25 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/features/home/presentation/home_view.dart"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6d3c8fa77bd99a4d7a0f2b423181c1b27f23defa95137b42d47ebeacb93a97"}},{"ruleId":"D2","level":"warning","message":{"text":"IRCTCLayoutParser.normalizeClass (cognitive 24): IRCTCLayoutParser.normalizeClass has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 12, if/else 11 (12 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/irctc/application/irctc_layout_parser.dart"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"8192bab0246757b53366b41db52df71f0f56713749531a30737d6d957275449f"}},{"ruleId":"D2","level":"warning","message":{"text":"TNSTCPNRFetcher._parseHtmlResponse (cognitive 24): TNSTCPNRFetcher._parseHtmlResponse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, error handling 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/tnstc/data/remote/tnstc_pnr_fetcher.dart"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaca0579638c8c9a4cd0e66f9cf40e30ede7e64f2c9df32fa16e945ef5d70292"}},{"ruleId":"D2","level":"warning","message":{"text":"KonfHubLayoutParser._parseBookingDate (cognitive 23): KonfHubLayoutParser._parseBookingDate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 9 (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/features/events/application/parsers/konfhub_layout_parser.dart"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bfdea025a345bb4b490f94090bff185fa04dec3668dbcccb3a06df6a9e2417"}},{"ruleId":"D2","level":"warning","message":{"text":"NotificationService.initialize (cognitive 22): NotificationService.initialize has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 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/common/services/push_notification/notification_service.dart"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e5d59ed9fdf039701ead5e86108d74807ba2e4781fd6d09172680052e0c897"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfium_worker.assemble (cognitive 22): pdfium_worker.assemble has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/assets/packages/pdfrx/assets/pdfium_worker.js"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"615b9706fbe8f87a89bf57d7c082039ac4a2f03423a92fe17370d1197b91c58f"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepLinkService._handleMedia (cognitive 21): DeepLinkService._handleMedia has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), error handling 1 (3 pts), boolean chains 1, 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/features/import/application/deep_link_service.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5f40e7532d9c2f0826c06eb1e5e0f1d298d731646c56fad2f534984469d3fb"}},{"ruleId":"D2","level":"warning","message":{"text":"PKPassParser._extractExtras (cognitive 21): PKPassParser._extractExtras has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/travel/application/pkpass_parser.dart"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6f6c4ee256c0875ffe578acca5153697a3c9034941742f17a72cdb9677a4cc"}},{"ruleId":"D2","level":"warning","message":{"text":"compress.compress_file (cognitive 21): compress.compress_file has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (15 pts), loops 2 (3 pts), error handling 1 (2 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/caveman-compress/scripts/compress.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa37536563f187ffedfd7fbcb405df57ddeb4964c0cd942836a762ec2c9b63d"}},{"ruleId":"D2","level":"warning","message":{"text":"check_dependencies.main (cognitive 20): check_dependencies.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (8 pts), ternaries 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd05aebae3fb742e1625b3e00166832421ece050ed3197b8ff7253062ec3340"}},{"ruleId":"D2","level":"warning","message":{"text":"check_dependencies.main (cognitive 20): check_dependencies.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (8 pts), ternaries 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/owasp-mobile-security-checker/scripts/check_dependencies.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc12008f73b90cb26e00c289b62c94c5b4f7b1b707963341ccdca2b0cacc7fc"}},{"ruleId":"D2","level":"warning","message":{"text":"SMSQueueService.drainQueue (cognitive 19): SMSQueueService.drainQueue has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 2 (4 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/features/receive/application/sms_queue_service.dart"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbd3dbe6fca9912dba83f48da016ef1d5144c94cded2cfd1766ca63a395c00e"}},{"ruleId":"D2","level":"warning","message":{"text":"detect.detect_file_type (cognitive 19): detect.detect_file_type has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/caveman-compress/scripts/detect.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea4c37c352273027e548120e9f6a7194239337e47036308f519016c370e5cf8"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze_storage_security.main (cognitive 19): analyze_storage_security.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (8 pts), ternaries 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e618336f5623d6525a04be3d666a6a0972bfb0140e71a10c6d3b69eb5401ca6a"}},{"ruleId":"D2","level":"warning","message":{"text":"check_dependencies.analyze_outdated_results (cognitive 19): check_dependencies.analyze_outdated_results has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), ternaries 2 (8 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f067df8db9550665b0776cb95369d4bcf09c0452ac7e308867919c0186f78dc2"}},{"ruleId":"D2","level":"warning","message":{"text":"check_network_security.main (cognitive 19): check_network_security.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (8 pts), ternaries 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58211cdb486d16fd695498119791e027ecd00c442b1a1b9fb3a77844205b33a"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze_storage_security.main (cognitive 19): analyze_storage_security.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (8 pts), ternaries 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc149ef09aba3e8c3222ad4a1d3e59f4f309c5048ed11e7340a06b87b4542e51"}},{"ruleId":"D2","level":"warning","message":{"text":"check_dependencies.analyze_outdated_results (cognitive 19): check_dependencies.analyze_outdated_results has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), ternaries 2 (8 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/owasp-mobile-security-checker/scripts/check_dependencies.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"91692f7994678bc52f4c745fc5e53110c4252d16368f4ae8c6c275abc3304e27"}},{"ruleId":"D2","level":"warning","message":{"text":"check_network_security.main (cognitive 19): check_network_security.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (8 pts), ternaries 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/owasp-mobile-security-checker/scripts/check_network_security.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"866100ca43c57188965c43d45190ae9892563cb024cae91b23be4d5a46d32c0d"}},{"ruleId":"D2","level":"warning","message":{"text":"TicketDao.updateTicketById (cognitive 18): TicketDao.updateTicketById has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/common/database/ticket_dao.dart"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e34859916acb76f3a2776807af5361bfaef985e4f00e71adb3853a3038cfb9"}},{"ruleId":"D2","level":"warning","message":{"text":"Ticket.fromIRCTC (cognitive 18): Ticket.fromIRCTC has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (8 pts), boolean chains 6, if/else 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/common/domain/models/ticket.dart"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"231a508c180992379fadb290b6e4888b2d4820f6f3264f90ec62d084b25b049d"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFService.extractBlocks (cognitive 18): PDFService.extractBlocks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 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/common/services/pdf/pdf_service.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c533596d18c8464c203a948f3f2865064370793c9cf524590160ce5cc64887"}},{"ruleId":"D2","level":"warning","message":{"text":"PKPassParser._logFullPassDetails (cognitive 18): PKPassParser._logFullPassDetails has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), 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/features/travel/application/pkpass_parser.dart"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"024ee319837679538bdcbaa1e7453a14b0011c2710aaae19e0764a5bd1a0a5e3"}},{"ruleId":"D2","level":"warning","message":{"text":"scan_hardcoded_secrets.scan_file (cognitive 18): scan_hardcoded_secrets.scan_file has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 3 (6 pts), ternaries 1 (4 pts), boolean chains 1, error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"45558231ec6aad60aacbb43a75458f44041f477b192b1060806b5ffb6d3f75f6"}},{"ruleId":"D2","level":"warning","message":{"text":"scan_hardcoded_secrets.scan_file (cognitive 18): scan_hardcoded_secrets.scan_file has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 3 (6 pts), ternaries 1 (4 pts), boolean chains 1, error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".claude/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d663a5a6880816677cd6afbf7f7d8ff4ee3903f84d61e1bf98edd3c633eb6a"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous).onmessage (cognitive 18): (anonymous).onmessage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 1 (4 pts), error handling 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/assets/packages/pdfrx/assets/pdfium_client.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b472ed7f5839310cd27de8f4c045c5ff7e8dfe0e52db0024f4da74c28b306a"}},{"ruleId":"D2","level":"warning","message":{"text":"_TicketReminderConfigDialogState.build (cognitive 17): _TicketReminderConfigDialogState.build has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (10 pts), if/else 5 (7 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/common/widgets/ticket_reminder_config_dialog.dart"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e3024fcacc05d060979abc393d91a1b50aea61e5dc716db984a5b64ad47de5"}},{"ruleId":"D2","level":"warning","message":{"text":"_ImportViewState._handleImagePick (cognitive 17): _ImportViewState._handleImagePick has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/import/presentation/import_view.dart"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"645079c29a30ce5ab6e9d2be1077e5a02eb3c998c6c550bc328ba6129fc658bc"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutExtractor._findKeyBlock (cognitive 16): LayoutExtractor._findKeyBlock has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 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/common/services/ocr/layout_extractor.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8665838645489dff82428fec3e28d54f4dc04ca5d294053377064eadcf01f8"}},{"ruleId":"D2","level":"warning","message":{"text":"CalendarList.build (cognitive 16): CalendarList.build has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (8 pts), if/else 5 (7 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/features/calendar/presentation/widgets/calendar_list.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed8048d8a06eff0fcf1fb52ef58c7e61066debe443746520fbcf60b753e1121"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportService.importAndSavePDFFile (cognitive 16): ImportService.importAndSavePDFFile has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), 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/features/import/application/import_service.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3383d71aeb0cd02f8ec52e62540444a3e3364542095c31f7669b7fa13dd6b51"}},{"ruleId":"D2","level":"warning","message":{"text":"_ImportViewState._handleClipboardRead (cognitive 16): _ImportViewState._handleClipboardRead has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/import/presentation/import_view.dart"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"533915323533fde80f1b27c6694742b232fdcd520886a25b59e548ccfe9ce56b"}},{"ruleId":"D2","level":"warning","message":{"text":"_ContributorsViewState.build (cognitive 16): _ContributorsViewState.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, error handling 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/features/settings/presentation/contributors_view.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"955454441633ae5467da80e4d0a29d1afd99cde574bb6119a8467dfa77163d05"}},{"ruleId":"D2","level":"warning","message":{"text":"_OCRDebugViewState.build (cognitive 16): _OCRDebugViewState.build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 4, boolean chains 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":"lib/src/features/settings/presentation/ocr_debug_view.dart"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9d6c38aa3b70b1f4f6c977791eda92fc7bc7455fc22a13824257010ae3799c"}},{"ruleId":"D2","level":"warning","message":{"text":"PKPassParser._findFieldValue (cognitive 16): PKPassParser._findFieldValue has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 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/features/travel/application/pkpass_parser.dart"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca0028dd6222dcbaddcb0d9507672805ee68f32345f933086c38efa79a5d5d8"}},{"ruleId":"D2","level":"warning","message":{"text":"TravelTextParserUtils.parseDate (cognitive 16): TravelTextParserUtils.parseDate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, error handling 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/travel/application/travel_text_parser_utils.dart"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c026394d66047a7d49137cfe269683e0b13d934c322d92eeb7ab54ff3f780606"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfium_worker.loadDocumentFromUrl (cognitive 16): pdfium_worker.loadDocumentFromUrl has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 3 (5 pts), loops 2 (4 pts), ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/assets/packages/pdfrx/assets/pdfium_worker.js"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ac60ba4b9672c4540360dbd35984b6fe0ee32b81d48f13f004afc30d9d7feb"}},{"ruleId":"D2","level":"warning","message":{"text":"ccall (cognitive 16): ccall has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). Of this number, 11 points are the body\u0027s own statements and 5 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/assets/packages/pdfrx/assets/pdfium_worker.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"258901df28c7010d40ad3c43aede933e8619e996987e26f3c74489c619879d58"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _TravelTicketViewState.build: MethodTooLong \u2014 build runs 415 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 315 over it, 4.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/travel/presentation/travel_ticket_view.dart"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"872520134abf032a67277c08072eb5b1c790c65aaf1094682e38f37ef3ad1a92"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: KonfHubLayoutParser.parseTicketFromBlocks: MethodTooLong \u2014 parseTicketFromBlocks runs 321 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 221 over it, 3.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/features/events/application/parsers/konfhub_layout_parser.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c69fa2d0326ee90fa36d5ab608c5f2578c4086410ec6838fd691db94518dd4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: assets/pdfium_worker.js: FileTooLong \u2014 1354 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 854 over it, 2.71\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":"web/assets/packages/pdfrx/assets/pdfium_worker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7aa7316b00c915c665b8193e2d4897caeab0dd1af2002937ffab3fdbb68008"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ReminderSettingsViewState.build: MethodTooLong \u2014 build runs 220 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 120 over it, 2.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/features/settings/presentation/reminder_settings_view.dart"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b146508a723f456885279000f5a58a53eec5e650de6716909724423c6a7e99f0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _TicketReminderConfigDialogState.build: MethodTooLong \u2014 build runs 212 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 112 over it, 2.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/common/widgets/ticket_reminder_config_dialog.dart"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"45eaae4dd8cb78b1e7e6804114d420229013daff3584bcf5e60cb8ba4131ff78"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Ticket.fromTNSTC: MethodTooLong \u2014 fromTNSTC runs 193 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 93 over it, 1.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and 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/common/domain/models/ticket.dart"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3e7118a099f85a92c4f719bd9f4b4af636e2717c9b86f179da66a3ad0f81ee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TravelTicketCardWidget.build: MethodTooLong \u2014 build runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba949ecf1cb73cd918b5eb2eccc8e04beb5499238fe047a533a5c700bfc0e95"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IRCTCLayoutParser.parseTicketFromBlocks: MethodTooLong \u2014 parseTicketFromBlocks 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/features/irctc/application/irctc_layout_parser.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c315179eea00e9a1dbf128f312f0e0444b03c831e976c7ba5a47d3c9d55b4a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IRCTCSMSParser.parseTicket: MethodTooLong \u2014 parseTicket 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/features/irctc/application/irctc_sms_parser.dart"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"29abb8f5d3511db49af0dfe3a3839cf5908aee51d78e0dc36892addd5309d384"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _TravelTicketViewState: ClassTooLong \u2014 659 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 259 over it, 1.65\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/travel/presentation/travel_ticket_view.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"51725e1e6cac5ac7dc0e67aac643b442d2048e1a08164923d71505b5fc91d960"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _HomeViewState.build: MethodTooLong \u2014 build 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/features/home/presentation/home_view.dart"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8565a06c65a9458d9be9d6c468198c814771b7f8eea2f148aba436bbef90b500"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EventCard.build: MethodTooLong \u2014 build runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/events/presentation/event_card.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b10824b66ae208dea03db322a1c99dca836d3b015b13c8ec8bcfe56c02da8cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TNSTCLayoutParser._extractPassengers: MethodTooLong \u2014 _extractPassengers runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/tnstc/application/tnstc_layout_parser.dart"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d943b0ee6315323891b48a8994e3d0108faa3edeb6b74f8ad7a9d8af3d1e8a4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ShareSuccessView.build: MethodTooLong \u2014 build runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/receive/presentation/share_success_view.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9283a9c79fd0963737f6df620f5acb9deef4e33157e286c60b3213133a4f2b0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: presentation/travel_ticket_view.dart: FileTooLong \u2014 701 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: _TravelTicketViewState (50-1021). The bar is 500 significant lines; this is 201 over it, 1.40\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/travel/presentation/travel_ticket_view.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c000e8cb43e660c3e450ed1a0b85ab126b4e3cbe0fc7d082ff8bcd40c83383bc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutExtractor.findValueForKey: MethodTooLong \u2014 findValueForKey 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/common/services/ocr/layout_extractor.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fed82573c47aa75a06d247a36bb3b386a86b089ef705ff6904033e2b5b8525a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TravelTicketListCardWidget.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/features/home/presentation/all_tickets_view.dart"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18d572e1f7d021d82834b4c2a76a48519f9e7d7b032c908ecac60b33b55b5ba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SharedContentProcessor.processContent: MethodTooLong \u2014 processContent 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/features/receive/application/shared_content_processor.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8124b0cea61d724b148337d08ae1d725e5b9b52687fb9a14222cd13c267c5b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _TicketReminderConfigDialogState: ClassTooLong \u2014 465 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 65 over it, 1.16\u00D7 the bar. To reduce it, group the members that share the same 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/common/widgets/ticket_reminder_config_dialog.dart"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdb5c2666ab6e1cfc9870ad4198d33a58e9a0b04d061c70cb332e2e13ad7351"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Ticket: ClassTooLong \u2014 450 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 50 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/common/domain/models/ticket.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"85766226ab0a734a064270ba9687aa17bb62c7621ec2d583834b20cfff31d6be"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _SettingsViewState.build: MethodTooLong \u2014 build runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/settings/presentation/settings_view.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11f6fa793b064305174bb56f5c58ebd12f2e1290a963337b6b45b1724da3adc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: KonfHubLayoutParser: ClassTooLong \u2014 441 significant lines (blank, comment-only and punctuation-only lines excluded), 8 methods. The bar is 400 significant lines; this is 41 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/events/application/parsers/konfhub_layout_parser.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45a9f0afc4b53319f0aa8a676eb88b73b77f747de2e822294e6e2ab31cdcf88"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _ContributorsViewState.build: MethodTooLong \u2014 build runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/settings/presentation/contributors_view.dart"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"85822967649fd2c71a2a29ee147570d38717a920acf34d1d57521c071f91f22b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _OCRDebugViewState.build: MethodTooLong \u2014 build runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/settings/presentation/ocr_debug_view.dart"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfda7bc961f53f1a3960d5452b7c65745a383d43b6fc07ed3e8aaacd5e72407"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: _AllTicketsViewState.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/features/home/presentation/all_tickets_view.dart"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a70977b96575f10c36ee4a6f58ef09bea37c52337dc78009f9cc39180c929b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TNSTCLayoutParser.parseTicketFromBlocks: MethodTooLong \u2014 parseTicketFromBlocks 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/features/tnstc/application/tnstc_layout_parser.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"df90afd744b6c1633930450059c26a9ec351b5ae9bfb57b814920f8934e66035"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (14 members, 50\u002B identical tokens): lib/src/common/theme/fonts.dart:59-81 | lib/src/common/theme/fonts.dart:89-111 | lib/src/common/theme/fonts.dart:119-141 | lib/src/common/theme/fonts.dart:149-171 | lib/src/common/theme/fonts.dart:179-201 | lib/src/common/theme/fonts.dart:209-231 | lib/src/common/theme/fonts.dart:239-261 | lib/src/common/theme/fonts.dart:269-291 | lib/src/common/theme/fonts.dart:299-321 | lib/src/common/theme/fonts.dart:329-351 | lib/src/common/theme/fonts.dart:359-381 | lib/src/common/theme/fonts.dart:389-411 | lib/src/common/theme/fonts.dart:419-448 | lib/src/common/theme/fonts.dart:457-479 \u2014 These 14 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 14 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 14 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/common/theme/fonts.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6851096ed8d8ce251bd8ba722c5f1e560fdf04d2a4fb6bdae3dec8ace426da52"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): .agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py:204-246 | .agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py:159-223 | .agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py:231-274 | .claude/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py:204-246 | .claude/skills/owasp-mobile-security-checker/scripts/check_dependencies.py:159-223 | .claude/skills/owasp-mobile-security-checker/scripts/check_network_security.py:231-274 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"023d2257a186f17f6729fb9172a1194024d20ed42d6aa9b14536ac3432d5536e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): lib/src/common/theme/fonts.dart:487-500 | lib/src/common/theme/fonts.dart:507-520 | lib/src/common/theme/fonts.dart:527-540 | lib/src/common/theme/fonts.dart:572-592 \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/common/theme/fonts.dart"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d550029edbdd269ca32b6058372e5b969fe63b6428533f349e33d2aabac37a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (66 corresponding lines): lib/src/features/import/application/import_service.dart:78-155 | lib/src/features/import/application/import_service.dart:157-222 \u2014 These two members are one piece of code written twice and then edited apart: 66 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/import/application/import_service.dart"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9220761567e931c4808ccc69bf97cf989a051f35f6a8039c249d1dec0780a5e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): android/app/src/main/java/com/nammaflutter/nammawallet/MainTicketWidgetProvider.kt:145-187 | android/app/src/main/java/com/nammaflutter/nammawallet/TicketListWidgetProvider.kt:84-122 \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":"android/app/src/main/java/com/nammaflutter/nammawallet/MainTicketWidgetProvider.kt"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc3483fab62c271242fb915ff8d4f352c6f511ee0753626aea2534c92d5f129"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 52\u002B corresponding lines): lib/src/features/events/application/event_parser_service.dart:21-87 | lib/src/features/travel/application/travel_parser_service.dart:398-456 | lib/src/features/travel/application/travel_parser_service.dart:458-509 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 52 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/features/events/application/event_parser_service.dart"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eac2a6b03729bb2a3b4fd4e326ab0e4077812e40e42d69eb6cb530691024a06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): lib/src/common/services/ocr/layout_extractor.dart:447-477 | lib/src/common/services/ocr/layout_extractor.dart:479-514 \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/common/services/ocr/layout_extractor.dart"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4e9c63b9246811b35beef37d9713c6b801adfd5c6c34bd1cfa857eb6dacc1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): lib/src/common/services/notification/reminder_preferences_service.dart:71-111 | lib/src/common/services/notification/reminder_preferences_service.dart:178-215 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/common/services/notification/reminder_preferences_service.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b224b1c016178b776c6202819add14ad6e8726c396fd9582bb45099da903e0a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): lib/src/features/settings/presentation/reminder_settings_view.dart:136-167 | lib/src/features/travel/presentation/travel_ticket_view.dart:211-239 \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/features/settings/presentation/reminder_settings_view.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"66abd864bb94fd8227a4c8150450a9835150871439360f9d8e59bf6fc6c0f9f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): lib/src/features/travel/application/travel_parser_service.dart:235-273 | lib/src/features/travel/application/travel_parser_service.dart:344-372 \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/features/travel/application/travel_parser_service.dart"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31e02a86353899d94e07eee5aa8041079f730f0c7ae506ac552f0d81bb7e282"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): android/app/src/main/java/com/nammaflutter/nammawallet/MainTicketWidgetProvider.kt:125-143 | android/app/src/main/java/com/nammaflutter/nammawallet/TicketListWidgetProvider.kt:54-82 \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":"android/app/src/main/java/com/nammaflutter/nammawallet/MainTicketWidgetProvider.kt"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbdc695b5eae46e6c11dab3bb52fcf9b0e9baa328b6ced75b301442716e944a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): lib/src/common/services/notification/reminder_preferences_service.dart:151-176 | lib/src/common/services/notification/reminder_preferences_service.dart:217-243 \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/common/services/notification/reminder_preferences_service.dart"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01f21c4b38e60543a79a1e90b8a7450273eee650aea0a7b8732b31c8d2a19f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): lib/src/features/events/application/parsers/district_layout_parser.dart:70-84 | lib/src/features/events/application/parsers/district_layout_parser.dart:180-195 | lib/src/features/events/application/parsers/district_layout_parser.dart:220-237 \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/features/events/application/parsers/district_layout_parser.dart"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"842b0e403f153bd7896ab33f21b7f91de0f397898e4e3c9b0eee400309eb632e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/src/features/calendar/application/calendar_provider.dart:171-180 | lib/src/features/calendar/application/calendar_provider.dart:182-190 \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/features/calendar/application/calendar_provider.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef910d3c221368080ec711e386e7c802c3661d2533ea11c1ad76490e624625c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): lib/src/common/theme/fonts.dart:547-563 | lib/src/common/theme/fonts.dart:600-615 \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/common/theme/fonts.dart"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5874c8cb8b6de8e9b59aad89bfd3e9585d710563048ef2b7bc3659f059bd5fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/src/features/calendar/presentation/widgets/booking_reminder/booking_reminder_popup.dart:151-159 | lib/src/features/calendar/presentation/widgets/booking_reminder/booking_reminder_popup.dart:161-169 \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/features/calendar/presentation/widgets/booking_reminder/booking_reminder_popup.dart"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e732ea7fa8279619686ed790ccfc7640f390899ee58a1a82e7549b0c7b3bcd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/src/common/services/widget/home_widget_service.dart:185-199 | lib/src/common/services/widget/home_widget_service.dart:218-237 \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/common/services/widget/home_widget_service.dart"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0d2b94be4355c69894c4f8e0e7fe62c32d8b3ac74f97f7cd5134ca53534621"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/src/common/services/booking_reminder/booking_reminder_preferences_service.dart:20-26 | lib/src/common/services/notification/reminder_preferences_service.dart:45-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/common/services/booking_reminder/booking_reminder_preferences_service.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8e6bf33bb39a4880846da0ab062223e9b244a46ed7e0f87e8ad5ff3eebb0a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): lib/src/features/events/application/event_parser_service.dart:57-87 | lib/src/features/travel/application/travel_parser_service.dart:426-456 \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/features/events/application/event_parser_service.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/features/events/application/event_parser_service.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18180c8f650766d901974183ed6b98c0455c00f09ff397e6b90479d527d0b7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): lib/src/features/home/presentation/widgets/ticket_card_widget.dart:23-52 | lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart:28-57 \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/features/home/presentation/widgets/ticket_card_widget.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ca8f6b69b1b790ae78d9f7ba798740940000d91d9c4d109eae1f295f42cf10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): lib/src/features/travel/presentation/travel_ticket_view.dart:707-736 | lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart:157-186 \u2014 before extracting anything, compare \u0060lib/src/features/travel/presentation/travel_ticket_view.dart\u0060 and \u0060lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 83 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/features/travel/presentation/travel_ticket_view.dart:707\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/features/travel/presentation/travel_ticket_view.dart"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"835589a0d92a01adc940f37f62a76418912563da01f6c7b20638b60f589a9f83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): lib/src/features/events/application/parsers/district_layout_parser.dart:342-369 | lib/src/features/events/application/parsers/konfhub_layout_parser.dart:545-572 \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/features/events/application/parsers/district_layout_parser.dart"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"375e1165c8a812f9861e86ba9b3385273e719c58785c5545715bf3efe40a2b40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): lib/src/features/import/application/import_service.dart:107-133 | lib/src/features/import/application/import_service.dart:185-210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/features/import/application/import_service.dart:107\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/features/import/application/import_service.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e5d7154ef3d8b51dba1d8857aaf76846956209908ffb2490d062d3a48fc3d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 14): lib/src/common/theme/fonts.dart:60-81 | lib/src/common/theme/fonts.dart:90-111 | lib/src/common/theme/fonts.dart:120-141 | lib/src/common/theme/fonts.dart:150-171 | lib/src/common/theme/fonts.dart:180-201 | lib/src/common/theme/fonts.dart:210-231 | lib/src/common/theme/fonts.dart:240-261 | lib/src/common/theme/fonts.dart:270-291 | lib/src/common/theme/fonts.dart:300-321 | lib/src/common/theme/fonts.dart:330-351 | lib/src/common/theme/fonts.dart:360-381 | lib/src/common/theme/fonts.dart:390-411 | lib/src/common/theme/fonts.dart:427-448 | lib/src/common/theme/fonts.dart:458-479 \u2014 all 14 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/common/theme/fonts.dart:427\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/common/theme/fonts.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6837b499e350acd805f0f7abb66160ee292c2c8284749b8ba203a120fd62fef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): lib/src/common/services/pdf/pdf_service.dart:121-141 | lib/src/common/services/pdf/pdf_service.dart:211-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/common/services/pdf/pdf_service.dart:121\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/common/services/pdf/pdf_service.dart"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b1b055232bdf26045757c30d808b8e0e9d7d1020b26856aa5ea42bcf0c54b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): lib/src/common/widgets/ticket_reminder_config_dialog.dart:261-281 | lib/src/features/settings/presentation/reminder_settings_view.dart:114-134 \u2014 before extracting anything, compare \u0060lib/src/common/widgets/ticket_reminder_config_dialog.dart\u0060 and \u0060lib/src/features/settings/presentation/reminder_settings_view.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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/common/widgets/ticket_reminder_config_dialog.dart:261\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/common/widgets/ticket_reminder_config_dialog.dart"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb8d5c78f3e864b6b24c8bb4cdaba7b55ab07fa2e3b713d6e9d81936b3b6f99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart:122-141 | lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart:183-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart:122\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/features/travel/presentation/widgets/travel_ticket_card_widget.dart"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d48b85e435786da55cfb37335454475163e848318012b5bfffe89e91eb0e99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): lib/src/common/widgets/ticket_reminder_config_dialog.dart:702-719 | lib/src/features/settings/presentation/reminder_settings_view.dart:440-458 \u2014 before extracting anything, compare \u0060lib/src/common/widgets/ticket_reminder_config_dialog.dart\u0060 and \u0060lib/src/features/settings/presentation/reminder_settings_view.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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/common/widgets/ticket_reminder_config_dialog.dart:702\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060height\u0060 to \u00608)\u0060 in one and \u006012)\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/common/widgets/ticket_reminder_config_dialog.dart"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76ac8247e6f3d5213d5e92bc4d2bde40b6d9b0b83416fdc19eaada2b984b2cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): lib/src/features/travel/presentation/travel_ticket_view.dart:691-709 | lib/src/features/travel/presentation/travel_ticket_view.dart:752-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/features/travel/presentation/travel_ticket_view.dart:691\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/features/travel/presentation/travel_ticket_view.dart"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"f207aef6d0a46a69e5169c88946f0866469d4ee0460a0bd960a01d6d95524aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/src/features/travel/presentation/travel_ticket_view.dart:672-689 | lib/src/features/travel/presentation/travel_ticket_view.dart:733-750 \u2014 both copies are in the same file, so extract the block 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/features/travel/presentation/travel_ticket_view.dart:672\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/features/travel/presentation/travel_ticket_view.dart"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"1caf6fbb4228317b6a6c9a69be99fcab76f9125eb69e0b1fb32579b8f75a53d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): lib/src/features/travel/presentation/travel_ticket_view.dart:682-699 | lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart:134-150 \u2014 before extracting anything, compare \u0060lib/src/features/travel/presentation/travel_ticket_view.dart\u0060 and \u0060lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 83 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/features/travel/presentation/travel_ticket_view.dart:682\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/src/features/travel/presentation/travel_ticket_view.dart:680\u0060 calls \u0060BoxShadow\u0060, \u0060withValues\u0060 and \u0060lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart:133\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/features/travel/presentation/travel_ticket_view.dart"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cd5c968ce3dc83c391b9238b88788aeae720803bd3295645fa74132c89ed91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): lib/src/features/travel/presentation/travel_ticket_view.dart:743-760 | lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart:195-211 \u2014 before extracting anything, compare \u0060lib/src/features/travel/presentation/travel_ticket_view.dart\u0060 and \u0060lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 83 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/features/travel/presentation/travel_ticket_view.dart:743\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060lib/src/features/travel/presentation/travel_ticket_view.dart:741\u0060 calls \u0060BoxShadow\u0060, \u0060withValues\u0060 and \u0060lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart:194\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/features/travel/presentation/travel_ticket_view.dart"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7485186d1e4fb034ea718b7845c3f8ba197bf3385a0899122c2ba12262eecce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 4): lib/src/features/travel/presentation/travel_ticket_view.dart:665-680 | lib/src/features/travel/presentation/travel_ticket_view.dart:726-741 | lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart:115-131 | lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart:176-192 \u2014 before extracting anything, compare \u0060lib/src/features/travel/presentation/travel_ticket_view.dart\u0060 and \u0060lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 83 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/features/travel/presentation/travel_ticket_view.dart:665\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/features/travel/presentation/travel_ticket_view.dart"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28603208e1a047c09e7230e9fae6a4f873cf3becf872ffb7960e605b3160119"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 3): lib/src/features/import/presentation/import_view.dart:63-76 | lib/src/features/import/presentation/import_view.dart:157-172 | lib/src/features/import/presentation/import_view.dart:221-237 \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/features/import/presentation/import_view.dart:63\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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/features/import/presentation/import_view.dart"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54fdaf5562e056df55bd0fb82bc19a97010edf4cac8f562f540c4fb27ee16d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): lib/src/common/widgets/ticket_reminder_config_dialog.dart:553-569 | lib/src/features/settings/presentation/reminder_settings_view.dart:315-330 \u2014 before extracting anything, compare \u0060lib/src/common/widgets/ticket_reminder_config_dialog.dart\u0060 and \u0060lib/src/features/settings/presentation/reminder_settings_view.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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/common/widgets/ticket_reminder_config_dialog.dart:553\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/common/widgets/ticket_reminder_config_dialog.dart"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"da95e16a3db7131d3c04ba00483d2bb470f0161ff96aa648148f979fbca28ebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/src/features/events/application/event_parser_service.dart:26-42 | lib/src/features/travel/application/travel_parser_service.dart:403-419 \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/features/events/application/event_parser_service.dart:26\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/features/events/application/event_parser_service.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36c0d4cbd0ad46a1327f77f9254719a90eec5fe163dbe53c2570e10a168fb49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/src/features/receive/presentation/share_success_view.dart:75-91 | lib/src/features/receive/presentation/share_success_view.dart:125-141 \u2014 both copies are in the same file, so extract the block 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/features/receive/presentation/share_success_view.dart:75\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/features/receive/presentation/share_success_view.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"237a0f8ec62737da6fba31dd163b60a04dfd5876e64d108b0243f431c300f690"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart:143-159 | lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart:204-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/features/travel/presentation/widgets/travel_ticket_card_widget.dart:143\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/features/travel/presentation/widgets/travel_ticket_card_widget.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0179c81eb6fadc6db8fe013c3fc275ece93fdbf0538af48ae593dbbe3ca6648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/src/common/services/push_notification/notification_service.dart:248-262 | lib/src/common/widgets/ticket_reminder_config_dialog.dart:412-426 \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/src/common/services/push_notification/notification_service.dart"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee52e5addaf367e67ae3a5c9c777a599d9c8958c0638c7765e657304241cd31b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): lib/src/features/travel/application/travel_parser_service.dart:123-138 | lib/src/features/travel/application/travel_parser_service.dart:328-342 \u2014 both copies are in the same file, so extract the block 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/features/travel/application/travel_parser_service.dart"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"434709d7e8207db5c90b35efe969a7ba515e27c9db7b0a808858aef35df96733"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): lib/src/common/theme/fonts.dart:488-500 | lib/src/common/theme/fonts.dart:508-520 | lib/src/common/theme/fonts.dart:528-540 \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. 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/common/theme/fonts.dart"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06d6f87be239be6270dbee9e2acd52edbfea9e84e00baec8737d4d85f10ac7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/src/common/widgets/ticket_reminder_config_dialog.dart:315-327 | lib/src/common/widgets/ticket_reminder_config_dialog.dart:342-354 \u2014 both copies are in the same file, so extract the block 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/common/widgets/ticket_reminder_config_dialog.dart:315\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/common/widgets/ticket_reminder_config_dialog.dart"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f376b2349af65e54361ac552e66038757b781ae59b4b73ae3638471634e8540"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): lib/src/common/theme/fonts.dart:488-499 | lib/src/common/theme/fonts.dart:508-519 | lib/src/common/theme/fonts.dart:528-539 | lib/src/common/theme/fonts.dart:573-584 \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/src/common/theme/fonts.dart"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"888392033f9b7138dddab9555277709eaef21924ee78bf623ed6fb72855bf7a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): lib/src/common/services/ocr/layout_extractor.dart:455-464 | lib/src/common/services/ocr/layout_extractor.dart:492-503 \u2014 both copies are in the same file, so extract the block 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/common/services/ocr/layout_extractor.dart:455\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/common/services/ocr/layout_extractor.dart"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"928a395d3a64f14d23a452e86302e569b91be271bf1be9e0fcc3eeb60fc876ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201312 lines \u00D7 3): lib/src/features/events/application/parsers/konfhub_layout_parser.dart:55-66 | lib/src/features/events/application/parsers/konfhub_layout_parser.dart:172-175 | lib/src/features/events/application/parsers/konfhub_layout_parser.dart:209-217 \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/features/events/application/parsers/konfhub_layout_parser.dart:55\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/features/events/application/parsers/konfhub_layout_parser.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a133f80d4f6ae5bb3ad965d9dc0168034590394732f250124c96df1dbb36b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): lib/src/features/calendar/presentation/widgets/calendar_list.dart:52-62 | lib/src/features/calendar/presentation/widgets/calendar_list.dart:83-90 \u2014 both copies are in the same file, so extract the block 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/features/calendar/presentation/widgets/calendar_list.dart:52\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/features/calendar/presentation/widgets/calendar_list.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"86179e74997767aed06daa0cd023dfa75d30c9141a2f1f858736b4ec48169338"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): lib/src/features/home/presentation/all_tickets_view.dart:383-393 | lib/src/features/home/presentation/widgets/ticket_card_widget.dart:20-30 \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/features/home/presentation/all_tickets_view.dart:383\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/features/home/presentation/all_tickets_view.dart"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71236434863b14ef27a313e8a21638b51ee9f7e6b3411cff7a8860e744746c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): lib/src/features/home/presentation/all_tickets_view.dart:55-64 | lib/src/features/home/presentation/home_view.dart:74-83 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/features/home/presentation/all_tickets_view.dart:55\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/features/home/presentation/all_tickets_view.dart"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"59af3d31973ab1921d89265585aad7e30879d033bf9923e3c698a786d4361b9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/common/widgets/ticket_reminder_config_dialog.dart:305-312 | lib/src/common/widgets/ticket_reminder_config_dialog.dart:332-339 \u2014 both copies are in the same file, so extract the block 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/common/widgets/ticket_reminder_config_dialog.dart"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84398ef2810108db4daf27e064f40884a6a3a14f1e47c4f4ecbd7ab7f45834a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/features/events/application/parsers/konfhub_layout_parser.dart:265-272 | lib/src/features/events/application/parsers/konfhub_layout_parser.dart:274-281 \u2014 both copies are in the same file, so extract the block 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/features/events/application/parsers/konfhub_layout_parser.dart"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"e981413cdca8e7e82ad9aba7d4cfeef4683be1cc5c282e1b2f9b10ffc9b6db64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/features/irctc/application/irctc_layout_parser.dart:348-355 | lib/src/features/irctc/application/irctc_layout_parser.dart:368-375 \u2014 both copies are in the same file, so extract the block 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/features/irctc/application/irctc_layout_parser.dart:348\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/features/irctc/application/irctc_layout_parser.dart"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"826c0328acebddeabaae770df7fa46298dfae85602c9fa06dad50245dd5041ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/src/features/events/application/parsers/konfhub_layout_parser.dart:483-490 | lib/src/features/events/application/parsers/konfhub_layout_parser.dart:498-505 \u2014 both copies are in the same file, so extract the block 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/features/events/application/parsers/konfhub_layout_parser.dart:483\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/features/events/application/parsers/konfhub_layout_parser.dart"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fe362c022157254145ff17b8b18aba91f8e5eeb6057f4905403cb2650880bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/src/common/widgets/ticket_reminder_config_dialog.dart:59-65 | lib/src/features/settings/presentation/reminder_settings_view.dart:45-51 \u2014 before extracting anything, compare \u0060lib/src/common/widgets/ticket_reminder_config_dialog.dart\u0060 and \u0060lib/src/features/settings/presentation/reminder_settings_view.dart\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/common/widgets/ticket_reminder_config_dialog.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3925891ac082e47e258b9bb7edc2de9dff8feee0dfbd8e4bf94681c47c2c158"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/src/common/services/push_notification/notification_service.dart:233-238 | lib/src/common/widgets/ticket_reminder_config_dialog.dart:397-402 \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/src/common/services/push_notification/notification_service.dart"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"d583603744b236177b4aadb38986cc94190075e0c1149037451c150479d94070"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): android/app/src/main/java/com/nammaflutter/nammawallet/MainTicketWidgetProvider.kt:146-157 | android/app/src/main/java/com/nammaflutter/nammawallet/TicketListWidgetProvider.kt:87-98 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/nammaflutter/nammawallet/MainTicketWidgetProvider.kt"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"678d196d5d0289502e3f13ad5c88a818c617737c80a4e2c3c2adc3b72c716a73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): android/app/src/main/java/com/nammaflutter/nammawallet/MainTicketWidgetProvider.kt:105-111 | android/app/src/main/java/com/nammaflutter/nammawallet/TicketListWidgetFactory.kt:92-98 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android/app/src/main/java/com/nammaflutter/nammawallet/MainTicketWidgetProvider.kt:105\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, \u0060android/app/src/main/java/com/nammaflutter/nammawallet/TicketListWidgetFactory.kt:90\u0060 calls \u0060d\u0060 and \u0060android/app/src/main/java/com/nammaflutter/nammawallet/MainTicketWidgetProvider.kt:104\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":"android/app/src/main/java/com/nammaflutter/nammawallet/MainTicketWidgetProvider.kt"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3c080aa381d87382af994067aac6945d8b2a8cf68d79a4d5f6e7c4f8e89641"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (65 lines \u00D7 2): .agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py:159-223 | .claude/skills/owasp-mobile-security-checker/scripts/check_dependencies.py:159-223 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/check_dependencies.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 198 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":".agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7410468dd78b92f8c89533e7f44a82ef6a0a7caaf11cf2aa4d2e41cb4a2a976"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2): .agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py:105-154 | .claude/skills/owasp-mobile-security-checker/scripts/check_network_security.py:105-154 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/check_network_security.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 243 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 \u0060.agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py: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. 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":".agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe422dfed487197b603a184670467772fb63a2baa9481fae7d4fa55d5ed4f2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2): .agents/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py:144-190 | .claude/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py:144-190 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 111 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":".agents/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d973ca2fa942111247e15a2f12e8e9d8dd89eb8fbc222e98c7f5402216e8e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2): .agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py:58-101 | .claude/skills/owasp-mobile-security-checker/scripts/check_network_security.py:58-101 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/check_network_security.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 243 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":".agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdaee914c074467f770a9dfb69323b5bc1761e3bd387f446d831bd8c92dad67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): .agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py:158-197 | .claude/skills/owasp-mobile-security-checker/scripts/check_network_security.py:158-197 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/check_network_security.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 243 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":".agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5bfc118c3d80b346fd174799f542bd506a1f55cd9d8adf7ea03f622d963a75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): .agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py:97-134 | .claude/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py:97-134 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 218 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 \u0060.agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py:97\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":".agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b95ed2dc46baa4b2a5e4155235eb2aa0aab87076367b0b8d60a4d0bd7261db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): .agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py:57-93 | .claude/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py:57-93 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 218 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 \u0060.agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py:57\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":".agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65b649dbe48e227e4b59974d7e80029f293c13c2af142e086d9db4603c5f439"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): .agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py:18-53 | .claude/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py:18-53 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 218 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 \u0060.agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py:18\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":".agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3a67517ce9f69db2b30e139a52fe126f376d1048f19e0e58ac0b8f5658d089"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): .agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py:138-172 | .claude/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py:138-172 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 218 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 \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":".agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9a0327094518df6ef63b8086b625ecec74a313bedff29e2848238b963a63a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): .agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py:20-54 | .claude/skills/owasp-mobile-security-checker/scripts/check_network_security.py:20-54 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/check_network_security.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 243 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 \u0060.agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py: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. 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":".agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6673a4e0627b8edac1339da112e910fb95c7ab1de3a3ba70403de342f83c3fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): .agents/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py:80-112 | .claude/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py:80-112 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 111 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":".agents/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6510d60467f3211d627158665c45cdcd087aa2d93102be3530c4b5bcaf8625af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): .agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py:30-60 | .claude/skills/owasp-mobile-security-checker/scripts/check_dependencies.py:30-60 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/check_dependencies.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 198 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":".agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdafca5f7cf07dd7dce4a6319c488f19154dbc0537ba29cd20147760c7ac8e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 4): .agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py:204-243 | .agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py:231-270 | .claude/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py:204-243 | .claude/skills/owasp-mobile-security-checker/scripts/check_network_security.py:231-270 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 218 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":".agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e871907f1dcf80f0ff10d8d7931e378ae1ef6c22f475e7d8a9b352f5335686"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): .agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py:201-227 | .claude/skills/owasp-mobile-security-checker/scripts/check_network_security.py:201-227 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/check_network_security.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 243 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":".agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"1968e8db28fb688eff78e649e5ea1f16af2f3f4193bd0b67fb74e47e1b312598"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): .agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py:176-200 | .claude/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py:176-200 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 218 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":".agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"392862cbd8bc1c1f2404fa620f8837467906c0dd0161d41e26b1fb2058947f27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): .agents/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py:116-140 | .claude/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py:116-140 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 111 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":".agents/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a104b61fd846418a495b09afeb9143c01ac4527a0060dba838cae609789b64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): .agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py:64-87 | .claude/skills/owasp-mobile-security-checker/scripts/check_dependencies.py:64-87 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/check_dependencies.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 198 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":".agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bf6dbea4b436876f3b20df89696ea04d984a8cf69eaba8b9c3ed6097af2113"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): .agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py:91-123 | .claude/skills/owasp-mobile-security-checker/scripts/check_dependencies.py:91-123 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/check_dependencies.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 198 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 \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":".agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d7f789109745554bdf7e96eaf695a68c1434c0ed77c966be77e86acc9e4407"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): .agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py:223-229 | .agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py:196-202 | .agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py:250-256 | .claude/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py:223-229 | .claude/skills/owasp-mobile-security-checker/scripts/check_dependencies.py:196-202 | .claude/skills/owasp-mobile-security-checker/scripts/check_network_security.py:250-256 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 218 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":".agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eaef7e10ce6dac7c240818bc068dd693850418cc53b726b42e2448b8433b014"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): .agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py:18-26 | .claude/skills/owasp-mobile-security-checker/scripts/check_dependencies.py:18-26 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/check_dependencies.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 198 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 \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":".agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d02431212d5dd3c6c137bf290d81854d14844574a89362ca90fa124988d3c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): .agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py:127-155 | .claude/skills/owasp-mobile-security-checker/scripts/check_dependencies.py:127-155 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/check_dependencies.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 198 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 \u0060.agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py:127\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/owasp-mobile-security-checker/scripts/check_dependencies.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf13acdb026d397986003ce34c152ed1d49a2b5f675a8adf0b763e14bd105ff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): .agents/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py:71-76 | .claude/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py:71-76 \u2014 before extracting anything, compare \u0060.agents/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py\u0060 and \u0060.claude/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 111 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":".agents/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a3ceb0512436f6aa08e46fe93cf452c12652b85169eac8ee1193cd861e0e58"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WebWidgetService (LCOM4 7): WebWidgetService\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/common/services/widget/web_widget_service.dart"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"698e62c634fab3005e20e4d2878f28826c0ed0f8fe2a0c649df3717424fdbeb9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _TravelTicketViewState (LCOM4 6): _TravelTicketViewState\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/features/travel/presentation/travel_ticket_view.dart"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdbb41b03b8a4ae48811ad421a39a746e018bdb0c865ce5d322453b8ebc345e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: IRCTCTrainParser (LCOM4 5): IRCTCTrainParser\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/features/travel/application/travel_parser_service.dart"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f53daef02aead1f18c0d9f228837204e0287b9e678eb1ea091b8b97034a4c1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TravelPDFParser (LCOM4 5): TravelPDFParser\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/features/travel/application/travel_pdf_parser.dart"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55f9353c44b1046b86d4b56d1d56849f339d8048fbd111edb3747f44ca613ce"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TNSTCBusParser (LCOM4 4): TNSTCBusParser\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/features/travel/application/travel_parser_service.dart"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b705365b05a2e1170213de7a2a3462d59c06edc9bbcc0a24005868b686049139"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SETCBusParser (LCOM4 4): SETCBusParser\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/features/travel/application/travel_parser_service.dart"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4acb204e22af2957523bfe32c450d688da884f617f628dc8d5a301f703d1200"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/features/events/application/parsers/konfhub_layout_parser.dart: lib/src/features/events/application/parsers/konfhub_layout_parser.dart changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 124 in KonfHubLayoutParser.parseTicketFromBlocks at line 37. 3 of those changes were fix/bug commits, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 22:24:36 \u002B05:30\u0027 --until=\u00272026-10-06 22:24:36 \u002B05:30\u0027 --full-history --no-merges -- lib/src/features/events/application/parsers/konfhub_layout_parser.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/events/application/parsers/konfhub_layout_parser.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"841c8861038e822b306adcf7c87812a4fba22ffb7331eb59f78feba256d9c1a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/features/travel/presentation/travel_ticket_view.dart: lib/src/features/travel/presentation/travel_ticket_view.dart changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in _TravelTicketViewState.build at line 443. 5 of those changes were fix/bug commits, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 22:24:36 \u002B05:30\u0027 --until=\u00272026-10-06 22:24:36 \u002B05:30\u0027 --full-history --no-merges -- lib/src/features/travel/presentation/travel_ticket_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/features/travel/presentation/travel_ticket_view.dart"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5a2af255e3c738addb94c8a91a33fc70c87e2651ee1c3bba4f4ab424003315"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/features/receive/application/shared_content_processor.dart: lib/src/features/receive/application/shared_content_processor.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in SharedContentProcessor.processContent at line 37. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 22:24:36 \u002B05:30\u0027 --until=\u00272026-10-06 22:24:36 \u002B05:30\u0027 --full-history --no-merges -- lib/src/features/receive/application/shared_content_processor.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/receive/application/shared_content_processor.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e09ca044269a0b596ffbf20027c5bc63ce67e51bbc59deb6f5b10957d1f542"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/features/receive/application/sharing_intent_service.dart: lib/src/features/receive/application/sharing_intent_service.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in SharingIntentService._handleSharedContent at line 62. 1 of those changes was a fix/bug commit, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 22:24:36 \u002B05:30\u0027 --until=\u00272026-10-06 22:24:36 \u002B05:30\u0027 --full-history --no-merges -- lib/src/features/receive/application/sharing_intent_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/features/receive/application/sharing_intent_service.dart"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d13bd9a800d636a82781370dbb7d604647fa1e82bdab473e2b2df2dc652d45"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/src/features/calendar/application/booking_reminder.dart: lib/src/features/calendar/application/booking_reminder.dart changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is BookingReminder.fromMap at line 45), 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: test\u201D; \u201Cfix: harden booking reminder persistence and parsing\u201D; \u201Cfix: use fixed IRCTC Tatkal opening times for reminders\u201D; \u201Cfix: booking reminder hash and mounted usage\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-08..2026-10-06, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-08 22:24:36 \u002B05:30\u0027 --until=\u00272026-10-06 22:24:36 \u002B05:30\u0027 --full-history --no-merges -- lib/src/features/calendar/application/booking_reminder.dart\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \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/features/calendar/application/booking_reminder.dart"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edb01c48e0e2ba7321a1c0ee4b3819f3c9e33467f7f2f260e903f85a8b5947f"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 22 significant file(s) lose their only recent owner: lib/src/common/services/ocr/layout_extractor.dart, lib/src/features/home/presentation/all_tickets_view.dart, lib/src/features/tnstc/application/tnstc_layout_parser.dart, lib/src/features/irctc/application/irctc_layout_parser.dart, ios/TicketWidget/TicketWidget.swift, lib/src/features/tnstc/data/remote/tnstc_pnr_fetcher.dart, lib/src/common/services/pdf/pdf_service.dart, lib/src/features/receive/application/sms_queue_service.dart (\u002B14 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4e3eda90b9c1193c94d2c5d1f55f4185f5565f69a03b2145485e41827959e68d"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (25 single-owned of 80 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 80 of the 172 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: lib/src/features/events/application/parsers/konfhub_layout_parser.dart, lib/src/common/constants/station_code.dart, lib/src/common/services/notification/reminder_preferences_service.dart."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(KV): This \u0060isUpdate\u0060 is only specified for TNSTC, need to work on this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/receive/presentation/share_success_view.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a18a05d821b93fd4e7faf6a5a8c05de3e2c035aa8403e9a67ee2b1d2475d4e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(keerthivasan-ai): need to get clarification from harishwarrior \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/calendar/presentation/widgets/calendar_widget.dart"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f27a823031fcce07a1a5dceefb8bcb41041c960b3098012598e9ed83043460c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(harish): Wire to IEventDAO when events feature is implemented \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/calendar/application/calendar_provider.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc51d6cdb75b98743df586f4000a85b65d2f232a63117fbd0e46a4e0197d4848"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(harish): Consider accepting field-mapping configuration or delegating \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/common/services/pdf/pdf_service.dart"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d331ecd01f0c50a1b5d93fd01986ddc898f9baf46891371eddaaf52a9e30156"}},{"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 \u0060lib/main.dart\u0060 makes this repository a deployable product (line 23)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/main.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8716bba673c3075887c415d08f1c9dd48ba3b1fdb124bf3e079c529efec988ec"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060_extractQrFromPdf\u0060 spells \u0060Pdf\u0060 where 14 names in the project spell it \u0060PDF\u0060: 14 of 15 names in project repository.src spell the token \u0060PDF\u0060 (14 of 15; unit: names in project repository.src containing \u0060PDF\u0060). Peers: GoogleMLKitOCR.extractBlocksFromPDF (lib/src/common/services/ocr/google_mlkit_ocr.dart:19); GoogleMLKitOCR.extractTextFromPDF (lib/src/common/services/ocr/google_mlkit_ocr.dart:147); IOCRService.extractBlocksFromPDF (lib/src/common/services/ocr/ocr_service_interface.dart:12); IOCRService.extractTextFromPDF (lib/src/common/services/ocr/ocr_service_interface.dart:26); WebOCRService.extractBlocksFromPDF (lib/src/common/services/ocr/web_ocr_service.dart:7). Rename to \u0060_extractQrFromPDF\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/events/application/parsers/konfhub_layout_parser.dart"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"038dafa121c2e2ebe65017527427efdfe663e5d182567255778abcdf20322bfc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check for rotation changes\u0022 repeats the code it sits on: 3 of its 3 words (check, rotation, changes) are already in \u0060if (!hasChanges \u0026\u0026 rotations)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/assets/packages/pdfrx/assets/pdfium_worker.js"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"7473062e688b2848c1b02232c01304099cc5e59e00fe0cd086a069650d0326b2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Insert the image object into the page\u0022 repeats the code it sits on: 4 of its 4 words (insert, image, object, page) are already in \u0060Pdfium.wasmExports.FPDFPage_InsertObject(pageHandle, imageObj);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/assets/packages/pdfrx/assets/pdfium_worker.js"},"region":{"startLine":1988}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9b14ee92a3902adaff9e17482b60650d4f57ff22943fcfc04d621be86007aa"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Generate page content\u0022 repeats the code it sits on: 3 of its 3 words (generate, page, content) are already in \u0060const generateResult = Pdfium.wasmExports.FPDFPage_GenerateContent(pageHandle);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/assets/packages/pdfrx/assets/pdfium_worker.js"},"region":{"startLine":1991}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f27a8b62379a464206acab34c0f4fd08b3931bd7b4453cf033645f67cf59a7b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Load and return the document\u0022 repeats the code it sits on: 3 of its 3 words (load, return, document) are already in \u0060return _loadDocument(docHandle, false, () =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/assets/packages/pdfrx/assets/pdfium_worker.js"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1bf1e4b0bf8a8e955a8d312d9948421ada7bb94b0a4663561bb5cc665c234f"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (33112 LoC, 210 module-visible types across 58 directories) overshoots its size bounds. 1 of 3 build unit(s) (Bundler, Gradle, pub) overshoot their size bounds, lowering Project Cohesion to 3.3/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":"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":"c07e3e953ec912bc6a426ac9659a229658d0240b4070bc1829f2c3940425c730"},"properties":{"commitSha":"f0b3dd6b4e632cdc7978ebe5bce9ae9138839f51"}},{"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":"ea5d9e7d2fc212ec99052244d12cdf51749b4a8baf1332a632f6c70edff7142d"},"taxa":[{"id":"CWE-494","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":"b3056ed77ebc74c9c204fe2f53bf40cb99302d31c1c7715b069e68e0a970b446"},"taxa":[{"id":"CWE-561","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","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":"ff287482dbc11560d9c2859f35b3cfbacfa2b5c8c5f1b7e76cf7114c5ca81a55"},"properties":{"dependency":{"package":"activesupport","version":"7.2.3.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"8.0.5.2","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"cef6abb5b41434945dcb5cfb8a6eb856a4bab501cfef28362383bc836f020afa"},"properties":{"dependency":{"package":"addressable","version":"2.9.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"2.9.1","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"fdaecc7a15be32e3c92d7a2ef38023ee75eb5bf9bb5d9ab2f4d3d8b006ec8e09"},"properties":{"dependency":{"package":"addressable","version":"2.9.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"2.9.1","reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 5 of 80 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 80 of the 172 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: lib/src/features/events/presentation/event_card.dart, android/app/src/main/java/com/nammaflutter/nammawallet/TicketListWidgetProvider.kt, lib/src/features/bottom_navigation/presentation/namma_navigation_bar.dart, lib/src/common/services/haptic/haptic_services.dart, lib/src/features/bottom_navigation/presentation/widgets/nav_bar.dart. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/events/presentation/event_card.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e98d6030a9ad8fc3f65936327f9e1633f75df75e29a9719f60b7d89a1336908"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/nammaflutter/nammawallet/TicketListWidgetProvider.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43608242afd10f4451343424005db9fa8a312a55271224d4c41ee17e04a73d85"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/bottom_navigation/presentation/namma_navigation_bar.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60b5bc6e79fbebb8ecef6835135e9cbfab82196043e859f394010956da183fa"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/common/services/haptic/haptic_services.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27190c87d5e6c84683635203a579366c9259d6cb4b4ff14f565d58629007a29b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/bottom_navigation/presentation/widgets/nav_bar.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7caf3d809e964dafdecef122c53d076f682d8d4615317d9924a046b6eaf1e9f9"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: rounded_back_button.dart \u2194 home_view.dart: \u0060lib/src/common/widgets/rounded_back_button.dart\u0060 (context common) and \u0060lib/src/features/home/presentation/home_view.dart\u0060 (context features) sit in DIFFERENT parts of the tree yet change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 \u00604cb02b75\u0060 feat/add-haptic-feedback-3106858695941641305 (#423); \u006067bae903\u0060 feat(ios): add deep link support for ticket widgets; \u00607b31eb7e\u0060 refactor: implement feature-first architecture with provider relocati\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/common/widgets/rounded_back_button.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"011fe10e78cedd5ef6b9753ef9739575126065b0016048e98183ceca1b9112c2"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: rounded_back_button.dart \u2194 travel_ticket_card_widget.dart: \u0060lib/src/common/widgets/rounded_back_button.dart\u0060 (context common) and \u0060lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart\u0060 (context features) sit in DIFFERENT parts of the tree yet 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) \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 6 shared commits counted here, the most recent 3 are \u00607b31eb7e\u0060 refactor: implement feature-first architecture with provider relocati\u2026; \u00600710dca1\u0060 feat: updated theme to blue (at that commit the files were still \u0060lib/src/common/widgets/custom_back_button.dart\u0060 and \u0060lib/src/features/home/presentation/widgets/travel_ticket_card_widget.dart\u0060); \u006013febfdf\u0060 refactor: updated theme folder (at that commit the files were still \u0060lib/src/common/widgets/custom_back_button.dart\u0060 and \u0060lib/src/features/home/presentation/widgets/travel_ticket_card_widget.dart\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/common/widgets/rounded_back_button.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d88412eb55352aaf50ee0849707e27a3c8b785dccfea65261a26a3d0a26e077"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ticket_card_widget.dart \u2194 travel_ticket_card_widget.dart: \u0060lib/src/features/home/presentation/widgets/ticket_card_widget.dart\u0060 and \u0060lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart\u0060 change together 72% of the time (13 of the 18 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 13 shared commits counted here, the most recent 3 are \u006077d36320\u0060 refactor(model): make primaryText, secondaryText, and location nullable; \u0060abafade2\u0060 refactor(ticket): make type field nullable; \u0060fb4921d3\u0060 refactor: Update startTime handling across ticket-related components \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/home/presentation/widgets/ticket_card_widget.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dd761d667b873ce2728110ec8eeb6260159e6d7fad8b3391f8b3a72182569d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: travel_ticket_view.dart \u2192 header_widget.dart, ticket_card_widget.dart, db_viewer_view.dart, travel_ticket_card_widget.dart: \u0060lib/src/features/travel/presentation/travel_ticket_view.dart\u0060 changes together with 4 other files \u2014 \u0060lib/src/features/home/presentation/widgets/header_widget.dart\u0060, \u0060lib/src/features/home/presentation/widgets/ticket_card_widget.dart\u0060, \u0060lib/src/features/settings/presentation/db_viewer_view.dart\u0060, \u0060lib/src/features/travel/presentation/widgets/travel_ticket_card_widget.dart\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/travel/presentation/travel_ticket_view.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b41a565bef5ded6c8612db6b8f5c430998c964e446e031438e7efd7751415e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: header_widget.dart \u2194 settings_view.dart: \u0060lib/src/features/home/presentation/widgets/header_widget.dart\u0060 and \u0060lib/src/features/settings/presentation/settings_view.dart\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060b8c60d5e\u0060 refactor: restructure haptic services into haptic subdirectory (at that commit the file was still \u0060lib/src/features/profile/presentation/profile_view.dart\u0060); \u00600eeef842\u0060 refactor: update async patterns across codebase and dependencies (at that commit the file was still \u0060lib/src/features/profile/presentation/profile_view.dart\u0060); \u0060911683c1\u0060 feat: Added Giamon package and vibration initial commit (at that commit the file was still \u0060lib/src/features/profile/presentation/profile_view.dart\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/home/presentation/widgets/header_widget.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e817aef3816e937e2bcbc3a730a8b1ea448b8458a16e4d21ba8955a81e59fc39"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: booking_reminder.dart \u2194 calendar_view.dart: \u0060lib/src/features/calendar/application/booking_reminder.dart\u0060 and \u0060lib/src/features/calendar/presentation/calendar_view.dart\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u006058620f70\u0060 fix: harden booking reminder persistence and parsing; \u0060b8b3e45f\u0060 fix: booking reminder hash and mounted usage; \u00609c20751d\u0060 feat: booking horizon reminder \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/calendar/application/booking_reminder.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58aa1cc820ce85331a88123b1da148647515d340a19f232a41d3b9c2d66889f4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: clipboard_service.dart \u2194 irctc_scanner_service.dart: \u0060lib/src/features/clipboard/application/clipboard_service.dart\u0060 and \u0060lib/src/features/irctc/application/irctc_scanner_service.dart\u0060 change together 59% of the time (13 of the 22 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 13 shared commits counted here, the most recent 3 are \u00603c067ee3\u0060 refactor: simplify constructor parameters by using \u0027this\u0027 shorthand f\u2026; \u0060255558de\u0060 refactor: migrate services to explicit dependency injection with inte\u2026; \u0060e3da21f2\u0060 feat: introduce custom snackbar widget, refactor existing snackbar ca\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/clipboard/application/clipboard_service.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc06f36dd73f50ee2305cac7322cb0690dffacc771986a116b98a165acf26df"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: calendar_view.dart \u2194 irctc_qr_parser.dart: \u0060lib/src/features/calendar/presentation/calendar_view.dart\u0060 and \u0060lib/src/features/irctc/application/irctc_qr_parser.dart\u0060 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) 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 \u0060fa4ce353\u0060 refactor: Ticket Model and Related Components; \u0060e489f465\u0060 refactor: make IRCTCTicket date fields nullable and update parsing to\u2026; \u0060f0b3dd6b\u0060 feat: refactor services and parsers to use dependency injection for I\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/calendar/presentation/calendar_view.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed68e9796890a608b1b0b246b1a628a590751d98fe5f25a085a59b7269710d41"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ticket.dart \u2194 layout_extractor.dart: \u0060lib/src/common/domain/models/ticket.dart\u0060 and \u0060lib/src/common/services/ocr/layout_extractor.dart\u0060 change together 53% of the time (8 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00600ef61972\u0060 refactor: Make ticket location and fare nullable, and enhance IRCTC P\u2026; \u006051c6c078\u0060 feat: Add arrival time to IRCTC tickets and refactor IRCTC layout par\u2026; \u006057106f7f\u0060 feat: irctc layout parser method \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/common/domain/models/ticket.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1213cfbe4758c9eeb05e2bb2ecb4bcb7b7cf9f8618be78fc1ac8c7511db07298"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: header_widget.dart \u2194 db_viewer_view.dart: \u0060lib/src/features/home/presentation/widgets/header_widget.dart\u0060 and \u0060lib/src/features/settings/presentation/db_viewer_view.dart\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060b8c60d5e\u0060 refactor: restructure haptic services into haptic subdirectory (at that commit the file was still \u0060lib/src/features/profile/presentation/db_viewer_view.dart\u0060); \u00600eeef842\u0060 refactor: update async patterns across codebase and dependencies (at that commit the file was still \u0060lib/src/features/profile/presentation/db_viewer_view.dart\u0060); \u0060911683c1\u0060 feat: Added Giamon package and vibration initial commit (at that commit the file was still \u0060lib/src/features/profile/presentation/db_viewer_view.dart\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/features/home/presentation/widgets/header_widget.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec694fe85615299547c3b25173a9f8dab84fb6e0175d2ff527aabe08f2266dc5"}},{"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":"122fcb356ea8b726c6c44bd0f6250ddff81c3c2f62175e9c3b2712353cd00cee"}},{"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":"1fa2ac019a0fc47b146e94274d7a1e17606e90a521ea613890ae3208e6a8c98d"}},{"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":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch gradle: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060gradle\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3bff8eed2eb29302c3d10644f1ecba23171c77cd6c406b6dfa078dfc05ad87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0027android:allowBackup=\u0022false\u0022\u0027 not in content and \u0027android:fullBackupContent\u0027 not in content\u0060 appears character-identically in 2 files \u2014 .agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py, .claude/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96e41d2ac3cd51b808939a14fe53f744ea7fcf51515c4f7287f1a6c8100de48"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060has_http_client and not has_cert_pinning and not has_bad_cert_callback\u0060 appears character-identically in 2 files \u2014 .agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py, .claude/skills/owasp-mobile-security-checker/scripts/check_network_security.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/owasp-mobile-security-checker/scripts/check_network_security.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e53503ba2314ba211121f3af70abe234182bab404757170d6c23246c99514f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060has_sqflite and not has_encrypted_sqflite\u0060 appears character-identically in 2 files \u2014 .agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py, .claude/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/owasp-mobile-security-checker/scripts/analyze_storage_security.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2fec4bd8af16ba7550dfbcf3912a5b4763eafd30990c2dabceed8c6fe5bb00"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.strip().startswith(\u0027//\u0027) or line.strip().startswith(\u0027/*\u0027)\u0060 appears character-identically in 2 files \u2014 .agents/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py, .claude/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/owasp-mobile-security-checker/scripts/scan_hardcoded_secrets.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"79eb8185a4dede0fba71e6f32a5c21e8e284866e951496ca320769057dc93518"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 0/2 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: loadDocumentFromUrl: \u0060loadDocumentFromUrl\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/assets/packages/pdfrx/assets/pdfium_worker.js"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e38472f9aa3f63f2f6897b74d51ba1eaf4f6df69a1fe6131c14b17574d35df"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: initializePdfium: \u0060initializePdfium\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/assets/packages/pdfrx/assets/pdfium_worker.js"},"region":{"startLine":2128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce653371493f34d4f2882446c23a05be5e3d6f8ca58c53ce67286309737a4373"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 68 is called with an argument built by \u0060jsonEncode(t.toMap())\u0060 (line 69), whose cost grows with the collection it walks. Dart evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isLoggable\u0060 test, no \u0060kDebugMode\u0060 or debug flag, no \u0060assert\u0060, no closure the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/common/services/widget/home_widget_service.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b54492320b6da921ea4900eb802194a7285e855d436502821cadc3190c86c27"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/sqflite_sw.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7986c3a34e97dce7bb505b4496d45ec1e21a802fd02f7a8a036e1cea59e6c6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/sqflite_sw.js"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"65885c2462c51e943cd4aea099508f168fc7452bf2c80a6d15d04cb39d1234c9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/sqflite_sw.js"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"101d98a00f48d2f023f45cb35f97779cd54b47aac44ce92c47d1fabdca541987"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/sqflite_sw.js"},"region":{"startLine":3628}}}],"partialFingerprints":{"codehealthFindingId/v1":"380029e3f6a042c9d00b1d7b223ff0f1d894fae61b8837675d80b42f12313f81"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/sqflite_sw.js"},"region":{"startLine":5976}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c4c7e282ae534776622e8e47de5ff12ae0f35e7d7002122bb7b36c395490d4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/sqflite_sw.js"},"region":{"startLine":5981}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae76745997b5d4ecc22386f341b7f2387159b2bfadec80a3af4cd9e136f2b72"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/sqflite_sw.js"},"region":{"startLine":6893}}}],"partialFingerprints":{"codehealthFindingId/v1":"40925b49ebfec7759a6f20a9981e426d039367ee81a2c104c6209d7e94a7422a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/sqflite_sw.js"},"region":{"startLine":7036}}}],"partialFingerprints":{"codehealthFindingId/v1":"631ca5c92005c5719e3fb0eeee98db007367cb567fd8a919bb7de9b219c77925"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/sqflite_sw.js"},"region":{"startLine":7343}}}],"partialFingerprints":{"codehealthFindingId/v1":"705a955239976dc36ffa185b3a0135a89031b7789fbe6324a73039673b0cfb26"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/assets/packages/pdfrx/assets/pdfium_worker.js"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"0420a5a02a97544eef20b1a3669ccf6dcb7d4d8525cbc09f9ecacb473c861b0e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/assets/packages/pdfrx/assets/pdfium_worker.js"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"413c198b26791673b9328a52214d9c1ab39c88f980620fc056f0a2670dd2887f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Object catch (_)\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/features/travel/application/pkpass_parser.dart"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2d836f29d447a861e3222fa70bed4922ce1f05561d994eee70844e35488bfe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Exception catch (_)\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/features/irctc/application/irctc_sms_parser.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c3348ef103e865bc2c0dbddf4243640e4cb2dc5d2abb128074b82b4b33a7a0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on Exception catch (_)\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/features/irctc/application/irctc_sms_parser.dart"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"89309bbd5780dfd7dd7db0cdd81e3f666a35319e9f504c92b20f002e58234cfd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060on 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":"lib/src/common/services/push_notification/notification_service.dart"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"f645903dabf2d640f270d00cb6e422aaa113d90927238b0f351afe62eb662a65"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-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-561","guid":"522a7ba7-45e9-ab53-9088-45d86e04b53a","name":"CWE-561","shortDescription":{"text":"CWE-561"},"helpUri":"https://cwe.mitre.org/data/definitions/561.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"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-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":10,"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."]}]}